Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness

International Journal of Systems Science

Volumn 31, Issue 5, 2000, Pages 639-647

  Wu, Chin Chia ^a   Lee, Wen Chiung ^a   You, Juinn Ming ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EFFICIENCY; HEURISTIC METHODS; INVENTORY CONTROL; MACHINERY; PRODUCTION CONTROL;

TRADE-OFF SOLUTIONS;

SCHEDULING;

EID: 0034191605     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/002077200290948     Document Type: Article

References (16)

1. Alidaee, B., and Rosa, D 1995, A note on the V-shaped property in one-machine scheduling. Journal of the Operational Research Society, 46, 128-132.
2. Baker, K. R., and Scudder, G. D., 1990, Sequence with earliness and tardiness penalties: a review. Operations Research, 38, 22-36.
3. Chen, C. L., and Bulfin, R. L., 1993, Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research, 70, 115-125.
4. Chen, T., Qi, X., and Tu, M., 1997, Single machine scheduling to minimize weighted earliness subject to maximum tardiness. Computers and Operations Research, 24, 147-152.
5. Davis, J. S., and Kanet, J. J., 1993, Single-machine scheduling with early and tardy completion costs. Naval Research Logistics, 40, 85101.
6. Dileepan, P., and Sen, T., 1988, Bicriterion static scheduling research for a single machine. Omega, 16, 53-59.
7. Fisher, M. L., 1971, A dual algorithm for the one-machine scheduling problem. Mathematical Programming, 11, 229-251.
8. Fry, T. D., Armstrong, R. D., and Lewis, H., 1989, A framework for single machine multiple objective sequencing research. Omega, 17, 595-607.
9. Hall, N.G., Kubiak, W., and Sethi, S. P., 1991, Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date. Operations Research, 39, 847-856.
10. Kahlbacher, H. G., 1993, Scheduling with monotonous earliness and tardiness penalties. European Journal of Operational Research, 64, 258-277.
11. Koksalan, M., Azizoglu, M., and Kondakci, S. K., 1998, Minimizing flowtime and maximum earliness on a single machine. IIE Transactions, 30, 192-200.
12. Liman, S D., Panwalkar, S. S., and Thongmee, S., 1998, Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society, 49, 1007-1010.
13. Ow, P. S., and Morton, T. E., 1989, The single machine early/tardy problem. Management Science, 15, 117-191.
14. Robb, D. J., and Rohleder, T. R., 1996, An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs. Naval Research Logistics, 43, 349-364.
15. Smith, W. E., 1956, Various optimizers for single-stage production. Naval Research Logistic Quarterly, 3, 59-66.
16. Szwarc, W., and Mukhopadhyay, S. K., 1995, Optimal timing schedules in earliness-tardiness single machine sequencing. Naval Research Logistics, 42, 1109-1114.