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

Operations Research Letters

Volumn 29, Issue 5, 2001, Pages 231-239

  Hurink, Johann ^a   Knust, Sigrid ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

Complexity; List scheduling; Parallel machines; Scheduling; Setup times

Indexed keywords

ALGORITHMS; OPERATIONS RESEARCH; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS;

PARALLEL MACHINES;

SCHEDULING;

EID: 0035681031     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00104-3     Document Type: Article

References (11)

1. An exact method for solving the multi-processor flow-shop
2. Bounds on multiprocessing timing anomalies
3. Optimization and approximation in deterministic sequencing and scheduling: A survey
4. On the complexity of scheduling with batch setup times
5. List scheduling revisited
6. Parallel machine scheduling with release dates, due dates and family setup times
7. Various optimizers for single-stage production
8. Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm