Minimising the makespan in the two-machine job shop problem under availability constraints.
Mourad BenttalebFaicel HnaienFarouk YalaouiPublished in: Int. J. Prod. Res. (2019)
Keyphrases
- flowshop
- scheduling problem
- batch processing
- scheduling jobs
- minimizing makespan
- processing times
- bicriteria
- strongly np hard
- constraint satisfaction
- single machine
- linear constraints
- real time
- job shop
- geometric constraints
- unrelated parallel machines
- open shop
- sequence dependent setup times
- constrained optimization
- dynamic programming
- special case
- lower bound
- databases
- data sets