Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence.
Bertrand M. T. LinF. J. HwangJatinder N. D. GuptaPublished in: J. Sched. (2017)
Keyphrases
- flowshop
- flowshop scheduling
- scheduling problem
- processing times
- flowshop scheduling problems
- maximum lateness
- asymptotic optimality
- special case
- setup times
- sequence dependent setup times
- tabu search
- minimizing makespan
- strongly np hard
- job processing times
- single machine
- total weighted tardiness
- identical parallel machines
- parallel machine scheduling problem
- scheduling decisions
- completion times
- parallel machines
- unrelated parallel machines
- job shop
- identical machines
- total flowtime
- information technology
- scheduling jobs
- np hard
- shortest processing time
- release dates