List scheduling in a parallel machine environment with precedence constraints and setup times

Authors:
Johann Hurink;Sigrid Knust
Affiliations:
Faculty of Mathematical Sciences, University of Twente, P.O. Box 217, NL-7500 AE Enschede, The Netherlands;Fachbereich Mathematik/Informatik, Universität Osnabrück, D-49069 Osnabrück, Germany
Venue:
Operations Research Letters
Year:
2001

Citing 1
Cited 4

List scheduling revisited

Operations Research Letters

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

Computers and Operations Research
Parallel machine scheduling with precedence constraints and setup times

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

Computers and Industrial Engineering
A GRASP approach to transporter scheduling and routing at a shipyard

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present complexity results which have influence on the strength of list scheduling in a parallel machine environment where additional precedence constraints and sequence-dependent setup times are given and the makespan has to be minimized. We show that contrary to various other scheduling problems, in this environment a set of dominant schedules cannot be calculated efficiently with list scheduling techniques.