Two-machine flowshop scheduling to minimize the number of tardy jobs

Journal of the Operational Research Society

Volumn 48, Issue 2, 1997, Pages 212-220

  Gupta, J N D ^a   Hariri, A M A ^b  

^a BALL STATE UNIVERSITY   (United States)

^b KING ABDULAZIZ UNIVERSITY   (Saudi Arabia)

Author keywords

Flowshop scheduling; Heuristic algorithms; Minimizing tardy jobs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MACHINERY; OPTIMIZATION;

FLOWSHOP SCHEDULING; HEURISTIC ALGORITHMS; TARDY JOBS;

SCHEDULING;

EID: 0031070655     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600346     Document Type: Article

References (7)

1. Johnson, S.M., (1954). Optimal two and three stage productionschedules with setup times included. Naval Res Logis 1:61-68
2. Lawler, E.L., et al(1993). Sequencing and scheduling: algorithmsand complexity. In: Graves SC, RinnooyKan AHG, Zipkin PH(eds). Logistics of Production and Inventory. North Holland, Amsterdam, Netherlands, pp 445-522.
3. Lenstra, J.K., Rinnooy, A.H.G., Brucker, P., (1977). Complexityof machine scheduling problems. Annals of Dis Math 1: 343-362
4. Hariri, A.M.A., Potts, C.N., (1989). A branch and boundalgorithm to minimize number of late jobs in a permutationflow-shop. Eur J Opl Res 38: 228-237
5. Ho, J.C., Gupta, J.N.D., (1995). Flowshop scheduling withdominant machines. Comp and Opns Res 15: 237-246
6. Moore, J.M., (1968).Ann-job, one-machine sequencing algorithmfor minimizing the number of late jobs. Mgmt Sci 15: 102-109
7. Smith, M.L., Panwalkar, S.S., Dudek, R.A., (1975). Flow-shopsequencing problems with ordered processing time matrices. Mgmt Sci 21: 544-549