Scheduling two parallel machines with machine-dependent availabilities
Authors:
- Jie HeJHJie He
- Qingguo LiQLQingguo Li
- Dehua XuDehua Xu
- 1 August 2016
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 72, 31-42
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (71201022)
- Natural Science Foundation of Jiangxi Province (20122BAB201010)
This publication has 25 references indexed in Scilit:
- Makespan minimization for two parallel machines scheduling with a periodic availability constraintComputers & Operations Research, 2009
- Minimizing number of tardy jobs on a single machine subject to periodic maintenance☆Omega, 2009
- Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardinessComputers & Industrial Engineering, 2008
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespanEuropean Journal of Operational Research, 2008
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespanComputers & Operations Research, 2008
- An efficient algorithm for scheduling jobs on a machine with periodic maintenanceThe International Journal of Advanced Manufacturing Technology, 2006
- 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
- Scheduling of jobs and maintenance in a textile companyThe International Journal of Advanced Manufacturing Technology, 2006
- Single-machine scheduling with periodic maintenance and nonresumable jobsComputers & Operations Research, 2003