Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
Authors:
- Chinyao LowCLChinyao Low
- Min JiMJMin Ji
- 1 February 2010
- journal article
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 34 (2) , 334-342
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespanEuropean Journal of Operational Research, 2008
- Single-machine scheduling with flexible and periodic maintenanceJournal of the Operational Research Society, 2006
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenanceJournal of the Operational Research Society, 2006
- Optimization models for the machine scheduling problem with a single flexible maintenance activityEngineering Optimization, 2006
- Single machine scheduling with a restricted rate‐modifying activityNaval Research Logistics (NRL), 2005
- Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion TimesAnnals of Operations Research, 2005
- Single-machine scheduling with periodic maintenance and nonresumable jobsComputers & Operations Research, 2003
- MINIMIZING THE MAKESPAN IN A SINGLE MACHINE SCHEDULING PROBLEM WITH A FLEXIBLE MAINTENANCEJournal of the Chinese Institute of Industrial Engineers, 2002
- Single machine flow-time scheduling with scheduled maintenanceActa Informatica, 1992
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer SystemsJournal of the ACM, 1975