Minimizing number of tardy jobs on a single machine subject to periodic maintenance

Omega

Volumn 37, Issue 3, 2009, Pages 591-599

  Chen, Wen Jinn ^a  

^a CHINA UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Nonresumable job; Periodic maintenance; Scheduling; Tardy job

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTATION THEORY; JOB SHOP SCHEDULING; MAINTENANCE;

MAINTENANCE PERIODS; MINIMIZING NUMBER OF TARDY JOBS; NONRESUMABLE JOB; OPTIMAL SCHEDULE; PERIODIC MAINTENANCE; PERIODIC TIME; SCHEDULING; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE- MACHINES; TARDY JOBS;

SCHEDULING ALGORITHMS;

EID: 50349092766     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2008.01.001     Document Type: Article

References (21)

1. Chen W.J. Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. Journal of Operational Research Society 57 (2006) 410-415
2. Qi X., Chen T., and Tu F. Scheduling the maintenance on a single machine. Journal of Operational Research Society 50 (1999) 1071-1078
3. Ji M., He Y., and Cheng T.C.E. Single-machine scheduling with periodic maintenance to minimize makespan. Computers and Operations Research 34 (2007) 1764-1770
4. Chen JS. Optimization models for the tool change scheduling problem. Omega 2008;36:888-94.
5. Adiri I., Frostig E., and Rinnooy Kan A.H.G. Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics 38 (1991) 261-271
6. Lee C.Y., and Liman S.D. Single machine flow-time scheduling with scheduled maintenance. Acta Informatica 29 (1992) 375-382
7. Lee C.Y., and Lin C.S. Single-machine scheduling with maintenance and repair rate-modifying activities. European Journal of Operational Research 135 (2001) 493-513
8. Pinedo M.I., and Rammouz E. A note on stochastic scheduling machine subject to breakdown and repair. Probability in the Engineering and Informational Sciences 2 (1988) 41-49
9. Espinouse M.L., Formanowicz P., and Penz B. Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability. Computers and Industrial Engineering 37 (1999) 497-500
10. Blazewicz B., Breit J., Formanowicz P., Kubiak W., and Schmidt G. Heuristic algorithms for the two-machine flowshop with limited machine availability. Omega 29 6 (2001) 599-608
11. Allahverdi A. Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers and Operations Research 23 (1996) 909-916
12. Mosheiov G. Minimizing the sum of job completion times on capacitated parallel machines. Mathematical and Computer Modeling 20 (1994) 91-99
13. Schmidt G. Scheduling independent tasks with deadlines on semi-identical processors. Journal of the Operational Research Society 39 (1988) 271-277
14. Lee C.Y. Parallel machines scheduling with non-simultaneous machine available time. Discrete Applied Mathematics 30 (1991) 53-61
15. Lee C.Y. Machine scheduling with an availability constraint. Journal of Global Optimization 9 (1996) 395-416
16. Lee C.Y. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters 20 (1997) 129-139
17. Kubiak W., Blazewicz J., Formanowicz P., Breit J., and Schmidt G. Two-machine flow shops with limited machine availability. European Journal of Operational Research 136 (2002) 528-540
18. Sanlaville E. Nearly on line scheduling of preemptive independent task. Discrete Applied Mathematics 57 (1995) 229-241
19. Schmidt G. Scheduling with limited machine availability. European Journal of Operational Research 121 (2000) 1-15
20. Lee C.Y., Lei L., and Pinedo M. Current trends in deterministic scheduling. Annals of Operations Research 70 (1997) 1-41
21. French S. Sequencing and scheduling: an introduction to the mathematics of the job-shop (1982), Ellis Horwood, Chichester, England