A matheuristic approach for the two-machine total completion time flow shop problem.
Federico Della CroceAndrea GrossoFabio SalassaPublished in: Ann. Oper. Res. (2014)
Keyphrases
- flowshop
- scheduling problem
- job processing times
- completion times
- special case
- bicriteria
- flowshop scheduling
- setup times
- sequence dependent setup times
- processing times
- minimizing makespan
- tabu search
- maximum lateness
- makespan minimization
- asymptotic optimality
- flowshop scheduling problems
- single machine
- strongly np hard
- unrelated parallel machines
- robotic cell
- job shop
- parallel machines
- total weighted tardiness
- manufacturing cell
- ant colony optimization
- precedence constraints
- job shop scheduling problem