Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type.
Bertrand M. T. LinF. J. HwangPublished in: Inf. Process. Lett. (2011)
Keyphrases
- flowshop
- scheduling problem
- job processing times
- processing times
- maximum lateness
- completion times
- special case
- flowshop scheduling
- minimizing makespan
- single machine
- sequence dependent setup times
- makespan minimization
- setup times
- total tardiness
- tabu search
- bicriteria
- release dates
- lot streaming
- flowshop scheduling problems
- preventive maintenance
- maximum tardiness
- job shop
- minimizing total tardiness
- total weighted tardiness
- objective function
- parallel machines
- strongly np hard
- precedence constraints
- fixed number
- number of tardy jobs
- particle swarm optimization
- dispatching rule