Single machine scheduling to minimize the number of late jobs under uncertainty

Fuzzy Sets and Systems

Volumn 139, Issue 2, 2003, Pages 421-430

  Sung, Shao Chin ^a   Vlach, Milan ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Combinatorial problems; Number of late jobs; Scheduling; Single machine

Indexed keywords

ALGORITHMS; BINARY CODES; COMBINATORIAL MATHEMATICS; SCHEDULING;

SINGLE MACHINES;

FUZZY SETS;

EID: 0141457949     PISSN: 01650114     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-0114(02)00505-5     Document Type: Article

References (8)

1. P. Brucker, Scheduling Algorithms, Second Revised and Enlarged Edition, Ch. 4, Springer, Berlin, 1998.
2. Hodgson T.J. A note on single machine sequencing with random processing times. Management Sci. 23(10):1977;1144-1146.
3. T. Itoh, H. Ishii, Fuzzy scheduling problem with processing time, Proc. EURO-INFORMS Conf., Barcelona, 1997, 1999.
4. Itoh T., Ishii H. Fuzzy due-date scheduling problem with fuzzy processing time. Internat. Trans. Oper. Res. 6:1999;639-647.
5. E.L. Lawler, Scheduling a single machine to minimize the number of late jobs, Report No. UCB/CSD83/139, Computer Science Division, University of California, Berkeley, 1983.
6. Lawler E.L., Lenstra J.K., Kan A.R., Shmoys D.B. Sequencing and scheduling: algorithms and complexity. Graves S., Kan A.R., Zipkin P. Handbooks in Operations Research and Management Science 4: Logistics of Production and Inventory. 1993;445-522 Elsevier, New York.
7. Moore J.M. An. n job, one machine sequencing algorithm for minimizing the number of late jobs Management Sci. 15(1):1968;102-109.
8. S.C. Sung, M. Vlach, On minimizing the number of late jobs with fuzzy processing times and date dues, Proc. Czech-Japan Seminar, Čeladná, Czech Republic, 1999, pp. 17-20.