Three-machine flowshop with two operations per job to minimize makespan.
Ling-Huey SuCheng-Te LinPublished in: Comput. Ind. Eng. (2006)
Keyphrases
- flowshop
- scheduling problem
- processing times
- special case
- sequence dependent setup times
- minimizing total tardiness
- bicriteria
- flowshop scheduling
- tabu search
- maximum lateness
- makespan minimization
- minimizing makespan
- total weighted tardiness
- total tardiness
- preventive maintenance
- setup times
- parallel machines
- flowshop scheduling problems
- lot streaming
- robotic cell
- np hard
- single machine
- job shop
- job processing times
- release dates
- completion times
- precedence constraints
- dispatching rule
- maximum tardiness
- number of tardy jobs
- shortest processing time