Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine.
Han HoogeveenSteef L. van de VeldePublished in: Math. Program. (1998)
Keyphrases
- flowshop
- scheduling problem
- completion times
- unrelated parallel machines
- single machine
- setup times
- parallel machines
- processing times
- maximum lateness
- sequence dependent setup times
- np hard
- special case
- precedence constraints
- release dates
- job shop
- tabu search
- open shop
- asymptotic optimality
- release times
- lot streaming
- job shop scheduling
- manufacturing cell
- single machine scheduling problem
- job shop scheduling problem
- identical machines
- strongly np hard
- absolute deviation
- optimal solution
- shortest processing time
- resource consumption
- search algorithm