List scheduling revisited

Authors:
J. M. J. Schutten
Affiliations:
Faculty of Mechanical Engineering, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Venue:
Operations Research Letters
Year:
1996

Citing 1
Cited 7

Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times

Operations Research Letters

The parcel hub scheduling problem: a simulation-based solution approach

Computers and Industrial Engineering
An exact method for Pm/sds,ri/Σi=1nCi problem

Computers and Operations Research
The parcel hub scheduling problem: A simulation-based solution approach

Computers and Industrial Engineering
Using genetic algorithms for planning of ASIC chip-design project flows

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Parallel machine scheduling with precedence constraints and setup times

Computers and Operations Research
Scheduling in HC and Grids Using a Parallel CHC

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list schedules are dominant for this type of problem. Furthermore, we prove that an alternative list scheduling algorithm, focusing on the completion times rather than the start times, yields also dominant list schedules for problems with sequence dependent setup times.