Minimising makespan in the two-machine flow-shop with release times.
Roberto TadeiJatinder N. D. GuptaFederico Della CroceM. CortesiPublished in: J. Oper. Res. Soc. (1998)
Keyphrases
- release times
- processing times
- single machine
- scheduling problem
- scheduling jobs
- release dates
- single machine scheduling problem
- number of late jobs
- flowshop
- completion times
- learning effect
- setup times
- maximum lateness
- minimizing makespan
- resource consumption
- identical machines
- np hard
- deteriorating jobs
- precedence constraints
- integer programming
- linear programming
- competitive ratio
- dynamic programming