Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence.
F. J. HwangMikhail Y. KovalyovBertrand M. T. LinPublished in: Discret. Optim. (2012)
Keyphrases
- scheduling problem
- processing times
- flowshop
- completion times
- single machine
- release times
- job processing times
- parallel machine scheduling problem
- job shop
- release dates
- single machine scheduling problem
- maximum lateness
- identical machines
- identical parallel machines
- limited capacity
- tabu search
- setup times
- np hard
- precedence constraints
- objective function
- job shop scheduling
- parallel machines
- sequence dependent setup times
- total weighted tardiness
- deteriorating jobs
- minimizing makespan
- fixed number
- scheduling decisions
- greedy heuristics
- tardiness penalties
- strongly np hard
- job shop scheduling problem
- dynamic programming
- evolutionary algorithm
- genetic algorithm