Two-machine shop scheduling with zero and unit processing times.
Irene N. LushchakovaSvetlana A. KravchenkoPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- processing times
- identical machines
- scheduling jobs
- scheduling problem
- flowshop
- single machine
- job processing times
- scheduling decisions
- release dates
- sequence dependent setup times
- identical parallel machines
- setup times
- manufacturing cell
- completion times
- parallel machines
- precedence relations
- number of tardy jobs
- makespan minimization
- batch processing
- single machine scheduling problem
- polynomially solvable
- total weighted tardiness
- earliness tardiness
- resource consumption
- precedence constraints
- release times
- worst case performance ratio
- shortest processing time
- np hard
- job shop
- assembly line
- special case
- communication delays
- dynamic programming