Dynamic programming algorithms for scheduling parallel machines with family setup times

Computers and Operations Research

Volumn 28, Issue 2, 2001, Pages 127-137

  Webster, Scott ^a   Azizoglu, Meral ^b  

^a SYRACUSE UNIVERSITY   (United States)

^b MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Dynamic programming; Family setup times; Production scheduling

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; DYNAMIC PROGRAMMING; PARALLEL ALGORITHMS; RESPONSE TIME (COMPUTER SYSTEMS);

BACKWARD ALGORITHMS; FORWARD ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

ALGORITHM; COMPUTER PROGRAM;

EID: 0034139566     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00094-5     Document Type: Article

References (11)

1. Single facility multi-class job scheduling
2. Task sequencing in a batch environment with setup times
3. Minimizing flow time on a single machine with job classes and setup times
4. On the complexity of scheduling with batch setup times
5. Scheduling groups of jobs on a single machine
6. The complexity of scheduling job families about a common due date
7. Scheduling independent tasks to reduce mean finishing time
8. A new dynamic programming algorithm for the parallel machines total weighted completion time problem
9. Scheduling independent tasks on parallel processors
10. A functional equation and its application to resource allocation and scheduling problems