论文信息 - Scheduling a deteriorating maintenance activity on a single machine

Scheduling a deteriorating maintenance activity on a single machine

We study a problem of scheduling a maintenance activity on a single machine. Following several recent papers, the maintenance is assumed to be deteriorating, that is, delaying the maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We introduce polynomial time solutions for all these problems.

[1] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[2] S. S. Panwalkar,et al. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[3] Eric Sanlaville,et al. Machine scheduling with availability constraints , 1998, Acta Informatica.

[4] Zhi-Long Chen,et al. Scheduling jobs and maintenance activities on parallel machines , 2000 .

[5] C.-Y. Lee,et al. Machine scheduling with a rate-modifying activity , 2001, Eur. J. Oper. Res..

[6] Gur Mosheiov,et al. New Results On Sequencing With Rate Modification , 2003 .

[7] Chung-Yee Lee,et al. Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[8] Bertrand M. T. Lin,et al. A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[9] Vitaly A. Strusevich,et al. Planning Machine Maintenance in Two-Machine Shop Scheduling , 2006, Oper. Res..

[10] L. Steg,et al. Conclusions and Directions of Further Research , 2008 .

[11] Harold W. Kuhn,et al. The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.