Campus Event Calendar
Event Entry
What and Who
Makespan Minimization for Parallel Machines Scheduling with Multiple Availability Constraints
Navid Hashemian
Dalhousie University - Canada
PhD Application Talk
Masters Student from Dalhousie University
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 7 October 2013
08:50
120 Minutes
E1 4
024
Saarbrücken
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.
Contact
Aaron Alsancak
068193251800
--email hidden
passcode not visible
logged in users only
Aaron Alsancak, 10/04/2013 11:37 -- Created document.