International Journal of Industrial Engineering Computations · 2016 · 18 citations · 50 references
ManagementIndustrial EngineeringOperations ManagementOptimizationParallel ComputingSchedulingGenetic AlgorithmsJob SchedulingMachine SchedulingMetaheuristic OptimizationMulti-objective OptimizationMulti-objective SchedulingDue DatesHybrid AlgorithmsLocal SearchMulti-objective Parallel Machine SchedulingParallel Machine SchedulingSequence-dependent Setup TimesSetup TimesUnrelated Parallel Machine Scheduling
In this paper, a new hybrid algorithm based on multi-objective genetic algorithm (MOGA) using simulated annealing (SA) is proposed for scheduling unrelated parallel machines with sequencedependent setup times, varying due dates, ready times and precedence relations among jobs. Our objective is to minimize makespan (Maximum completion time of all machines), number of tardy jobs, total tardiness and total earliness at the same time which can be more advantageous in real environment than considering each of objectives separately. For obtaining an optimal solution, hybrid algorithm based on MOGA and SA has been proposed in order to gain both good global and local search abilities. Simulation results and four well-known multi-objective performance metrics, indicate that the proposed hybrid algorithm outperforms the genetic algorithm (GA) and SA in terms of each objective and significantly in minimizing the total cost of the weighted function.
50
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
Scheduling: Theory, Algorithms, and Systems
Michael Pinedo · IIE Transactions · 1996 · 6.3K citations
A survey of scheduling problems with setup times or costs
Ali Allahverdi, C.T. Ng, T.C.E. Cheng et al. · European Journal of Operational Research · 2006 · 1.3K citations · Full text
Management, Industrial Engineering, Operations Management +12