Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times

Authors:
Rene Driessel;Lars Mönch
Affiliations:
Chair of Enterprise-wide Software Systems, Faculty for Mathematics and Computer Science, University of Hagen, 58097 Hagen, Germany;Chair of Enterprise-wide Software Systems, Faculty for Mathematics and Computer Science, University of Hagen, 58097 Hagen, Germany
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 16
Cited 2

The shifting bottleneck procedure for job shop scheduling

Management Science
Variable neighborhood search

Computers and Operations Research
Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness

Computers and Industrial Engineering
Scheduling jobs on parallel machines applying neural network and heuristic rules

Computers and Industrial Engineering
On Permutation Representations for Scheduling Problems

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
On a parallel machine scheduling problem with precedence constraints

Journal of Scheduling
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

Computers and Operations Research
Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach

Computers and Operations Research
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date

Computers and Industrial Engineering
Scheduling jobs on parallel machines with setup times and ready times

Computers and Industrial Engineering
A population-based variable neighborhood search for the single machine total weighted tardiness problem

Computers and Operations Research
A distributed shifting bottleneck heuristic for complex job shops

Computers and Industrial Engineering
A comparison of mip-based decomposition techniques and VNS approaches for batch scheduling problems

Winter Simulation Conference
Tabu search heuristics for parallel machine scheduling with sequence-dependent setup and ready times

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A variable neighbourhood search algorithm for job shop scheduling problems

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
List scheduling in a parallel machine environment with precedence constraints and setup times

Operations Research Letters

Tabu search and lower bound for an industrial complex shop scheduling problem

Computers and Industrial Engineering
Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss a scheduling problem for jobs on identical parallel machines. Ready times of the jobs, precedence constraints, and sequence-dependent setup times are considered. We are interested in minimizing the performance measure total weighted tardiness that is important for achieving good on-time delivery performance. Scheduling problems of this type appear as subproblems in decomposition approaches for large scale job shops with automated transport of the jobs as, for example, in semiconductor manufacturing. We suggest several variants of variable neighborhood search (VNS) schemes for this scheduling problem and compare their performance with the performance of a list based scheduling approach based on the Apparent Tardiness Cost with Setups and Ready Times (ATCSR) dispatching rule. Based on extensive computational experiments with randomly generated test instances we are able to show that the VNS approach clearly outperforms heuristics based on the ATCSR dispatching rule in many situations with respect to solution quality. When using the schedule obtained by ATCSR as an initial solution for VNS, then the entire scheme is also fast and can be used as a subproblem solution procedure for complex job shop decomposition approaches.