On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?

References

• Abdul-Razaq T. S. , Potts C. N. Dynamic programming state-space relaxation for single-machine scheduling. J. Opnl. Res. Soc. (1988) 39 141 152 Crossref, Google Scholar
• Abdul-Razaq T. S. , Potts C. N. , van Wassenhove L. N. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Appl. Math. (1990) 26 235 253 Crossref, Google Scholar
• Ahmed M. U. , Sundararaghavan P. S. Minimizing the weighted sum of late and early completion penalties in a single machine. IIE Trans. (1990) 288 290 Google Scholar
• Auguston K. A. Parts delivery system takes off at O'Hare Int'L airport. Modern Materials Handling (1989) October 52 54 Google Scholar
• Bagchi U. , Chang Y. , Sullivan R. Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date. Naval Res. Logist. (1987) 34 739 751 Crossref, Google Scholar
• Bagchi U. , Sullivan R. , Chang Y. Minimizing mean absolute deviation of completion times about a common due date. Naval Res. Logist. (1986) 33 227 240 Crossref, Google Scholar
• Baker K. R. , Scudder G. W. On the assignment of optimal due dates. J. Opnl. Res. Soc. (1989) 40 93 95 Crossref, Google Scholar
• Baker K. R. , Scudder G. W. Sequencing with earliness and tardiness penalties: A review. Opns. Res. (1990) 38 22 36 Link, Google Scholar
• Bector C. , Gupta Y. , Gupta M. Determination of an optimal due date and optimal sequence in a single machine job shop. Int. J. Prod. Res. (1988) 26 613 628 Crossref, Google Scholar
• Chand S. , Schneeberger H. Single machine scheduling to minimize weighted earliness subject to no tardy jobs. Eur. J. Opnl. Res. (1988) 34 221 230 Crossref, Google Scholar
• Cheng T. An algorithm for the CON due date determination and sequencing problem. Comp. Opns. Res. (1987) 14 537 542 Crossref, Google Scholar
• Cheng T. C. E. Dynamic programming approach to the single-machine sequencing problem with different due-dates. Comput. Math. Appl. (1990) 19 1 7 Crossref, Google Scholar
• Coombs C. H. , Dawes R. M. , Tversky A. Mathematical Psychology: An Elementary Introduction (1970) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Cozzens M. , Roberts F. S. Greedy algorithms for T-colorings of graphs and the meaningfulness of conclusions about them. J. Comb. Inf. Syst. Sci. (1991) 16 286 299 Google Scholar
• Elsayed E. A. , Lee M.-K. , Kim S. , Scherer E. Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals. Int. J. Prod. Res. (1993) 31 727 738 Crossref, Google Scholar
• Emmons H. Scheduling to a common due date on parallel common processors. Naval Res. Logist. (1987) 34 803 810 Crossref, Google Scholar
• Ferris M. C. , Vlach M. Scheduling with earliness and tardiness penalties. Naval Res. Logist. (1992) 39 229 245 Crossref, Google Scholar
• Fry T. , Armstrong R. D. , Blackstone J. H. Minimizing weighted absolute deviation in single machine scheduling. IIE Trans. (1987a) 19 445 450 Crossref, Google Scholar
• Fry T. D. , Leong G. A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden. Comp. Opns. Res. (1987) 14 363 368 Crossref, Google Scholar
• Fry T. , Leong G. , Rakes R. Single machine scheduling: A comparison of two solution procedures. Omega (1987b) 15 277 282 Crossref, Google Scholar
• Hall N. Single and multi-processor models for minimizing completion time variance. Naval Res. Logist. (1986) 33 49 54 Crossref, Google Scholar
• Hall N. G. , Kubiak W. , Sethi S. P. Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Opns. Res. (1991) 39 847 856 Link, Google Scholar
• Hall N. G. , Posner M. E. Earliness-tardiness scheduling problems I: Weighted deviation of completion times about a common due date. Opns. Res. (1991) 39 836 846 Link, Google Scholar
• Hoogeveen J. A. , van de Velde S. L. Scheduling around a small common due date. Eur. J. Opnl. Res. (1991) 55 237 242 Crossref, Google Scholar
• Kanet J. J. Minimizing the average deviation of job completion times about a common due date. Naval Res. Logist. (1981) 28 643 651 Crossref, Google Scholar
• Keeney R. L. , Raiffa H. Decisions with Multiple Objectives: Preferences and Value Tradeoffs (1976) (Wiley, New York) Google Scholar
• Koulamas C. The total tardiness problem: Review and extensions. Opns. Res. (1994) 42 1025 1041 Link, Google Scholar
• Krantz D. H. , Luce R. D. , Suppes P. , Tversky A. Foundations of Measurement (1971) I (Academic Press, New York) Google Scholar
• Liu W.-P. , Sidney J. B. Bin packing using semiordinal data. O. R. Lett. (1996a) 19 101 104 Crossref, Google Scholar
• Liu W.-P. , Sidney J. B. Ordinal algorithms for packing with target center of gravity. Order (1996b) 13 17 31 Crossref, Google Scholar
• Liu W.-P. , Sidney J. B. , van Vliet A. Ordinal algorithms for parallel machine scheduling. O. R. Lett. (1996) 18 223 232 Crossref, Google Scholar
• Luce R. D. , Krantz D. H. , Suppes P. , Tversky A. Foundations of Measurement (1990) III (Academic Press, New York) Google Scholar
• Ow P. S. , Morton T. E. Filtered beam search in scheduling. Int. J. Prod. Res. (1988) 26 35 62 Crossref, Google Scholar
• Ow P. S. , Morton T. E. The single machine early/tardy problem. Management Sci. (1989) 35 177 191 Link, Google Scholar
• Panwalkar S. , Smith M. , Seidmann A. Common due date assignment to minimize total penalty for the one machine scheduling problem. Opns. Res. (1982) 30 391 399 Link, Google Scholar
• Quaddus M. A generalized model of optimal due-date assignment by linear programming. J. Opnl. Res. Soc. (1987) 38 353 359 Crossref, Google Scholar
• Roberts F. S. Measurement Theory with Applications to Decisionmaking, Utility and the Social Sciences (1979) (Addison-Wesley, Reading, MA) Google Scholar
• Roberts F. S. Applications of the theory of meaningfulness to psychology. J. Math. Psychol. (1985) 29 311 332 Crossref, Google Scholar
• Roberts F. S. Meaningfulness of conclusions from combinatorial optimization. Discr. Appl. Math. (1990) 29 221 241 Crossref, Google Scholar
• Roberts F. S. , Barnett A. , Pollock S. M. , Rothkopf M. H. Limitations on conclusions using scales of measurement. Operations Research and the Public Sector (1994) (Elsevier, Amsterdam) 621 671 Crossref, Google Scholar
• Sidney J. Optimal single-machine scheduling with earliness and tardiness penalties. Opns. Res. (1977) 25 62 69 Link, Google Scholar
• Smith W. E. Various optimizers for single-stage production. Naval Res. Logist. (1956) 3 59 66 Crossref, Google Scholar
• Stevens S. S. On the theory of scales of measurement. Science (1946) 103 677 680 Crossref, Google Scholar
• Stevens S. S. , Stevens S. S. Mathematics, measurement, and psychophysics. Handbook of Experimental Psychology (1951) (Wiley, New York) 1 49 Google Scholar
• Stevens S. S. , Churchman C. W. , Ratoosh P. Measurement, psychophysics, and utility. Measurement: Definitions and Theories (1959) (Wiley, New York) 18 63 Google Scholar
• Sundararaghavan P. S. , Ahmed M. U. Minimizing the sum of absolute lateness in single-machine and multimachine scheduling. Naval Res. Logist. (1984) 31 325 333 Crossref, Google Scholar
• Suppes P. , Krantz D. H. , Luce R. D. , Tversky A. Foundations of Measurement (1989) II (Academic Press, New York) Google Scholar
• Szwarc W. Single machine scheduling to minimize absolute deviation of completion times from a common due date. Naval Res. Logist. (1989) 36 663 673 Crossref, Google Scholar