Makespan minimization for parallel machines scheduling with multiple availability constraints |
| |
Authors: | Navid Hashemian Claver Diallo Béla Vizvári |
| |
Affiliation: | 1. Dalhousie University, 5269 Morris Street, Halifax, NS, Canada 2. Eastern Mediterranean University, Famagusta Mersin 10, Turkey
|
| |
Abstract: | The problem of makespan minimization for parallel machines scheduling with multiple planned nonavailability periods in the case of resumable jobs is considered. In the current state of the literature, there is a limited number of models and algorithms dealing with this problem and only for very small problem size, and nonavailability limited to some machines. The problem is first formulated as a mixed integer linear programming model and optimally solved using CPLEX for small to moderately large size problems with multiple availability constraints on all machines. An implicit enumeration algorithm using the lexicographic order is then designed to solve large-scale problems. Numerical results are obtained for several experiments and they show the validity and performance improvements procured by both the MILP model and the new enumeration algorithm. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|