Sequencing heuristic for scheduling jobs with periodic maintenance

International Journal of Information and Management Sciences

Volumn 19, Issue 4, 2008, Pages 635-649

  Chen, Wen Jinn ^a   Tsou, Jia Chi ^a  

^a CHINA UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Maintenance; Scheduling; Tardy job; Total flow time

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; MAINTENANCE; SCHEDULING;

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL RESULTS; MANUFACTURING SYSTEMS; NUMBER OF TARDY JOBS; OPTIMAL SCHEDULES; PERIODIC MAINTENANCES; SCHEDULING JOBS; SCHEDULING PROBLEMS; TARDY JOB; TOTAL FLOW TIME;

MAINTAINABILITY;

EID: 57649177454     PISSN: 10171819     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Asano, M. and Ohta, H., Single-machine scheduling to meet due dates under shutdown constraints, International Journal of Production Economics, Vol. 60-61, pp.537-547, 1999.
2. Azizoglu, M., Kondakci, S. and Kirca, O., Bicriteria scheduling problem involving total tardiness and total earliness penalties, International Journal of Production Economics, Vol. 23, pp.17-24, 1991.
3. Chen, W. J., Minimizing total flow time in the single-machine scheduling problem with periodic maintenance, Journal of the Operational Research Society, Vol. 57, pp.410-415, 2006.
4. Emmons, H., One machine sequencing to minimize mean flow time with minimum tardy, Naval Research Logistics Quarterly, Vol. 22, pp.585-592, 1975.
5. French, S., Sequencing and scheduling: an introduction to the mathematics of the job-shop, Ellis Horwood Chichester England, 1982.
6. Hoogeveen, H., Multicriteria scheduling, European Journal of Operational Research, Vol. 167, pp.592-623, 2005.
7. Kiran, A. S. and Unal, A. T., A single-machine problem with multiple criteria, Naval Research Logistics, Vol. 38, pp.721-727, 1991.
8. Lee, C. Y., Parallel machines scheduling with non-simultaneous machine available time, Discrete Applied Mathematics, Vol. 30, pp.53-61, 1991.
9. Lee, C. Y., Machine scheduling with an availability constraint, Journal of Global Optimization, Vol. 9, pp.395-416, 1996.
10. Lee, C. Y., Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Operations Research Letters, Vol. 20, pp.129-139, 1997.
11. Lee, C. Y., Two-machine flowshop scheduling with availability constraints, European Journal of Operational Research, Vol. 114, pp.420-429, 1999.
12. Lee, C. Y. and Lin, C. S., Single-machine scheduling with maintenance and repair rate-modifying activities, European Journal of Operational Research, Vol. 135, pp.493-513, 2001.
13. Mosheiov, G., Minimizing the sum of job completion times on capacitated parallel machines, Mathematical and Computer Modeling, Vol. 20, pp.91-99, 1994.
14. Schmidt, G., Scheduling independent tasks with deadlines on semi-identical processors, Journal of Operational Research Society, Vol. 39, pp.271-277, 1988.
15. Vairaktarakis, G. L. and Lee, C. Y., The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs, IIE Transactions, Vol. 27, pp.250-256, 1995.
16. Van Wassenhove, L. N. and Gelders, L. F., Solving a bicriterion scheduling problem, European Journal of Operational Research, Vol. 4, pp.42-48, 1980.