A note on batch scheduling on a two-machine flowshop with machine-dependent processing times.
Gur MosheiovDaniel OronPublished in: 4OR (2023)
Keyphrases
- flowshop
- processing times
- scheduling problem
- sequence dependent setup times
- makespan minimization
- special case
- bicriteria
- minimizing total tardiness
- flowshop scheduling
- setup times
- single machine
- tabu search
- minimizing makespan
- parallel machines
- single machine scheduling problem
- completion times
- scheduling jobs
- total weighted tardiness
- number of tardy jobs
- np hard
- strongly np hard
- preventive maintenance
- release dates
- precedence constraints
- identical machines
- linear combination
- identical parallel machines
- polynomially solvable
- metaheuristic
- flowshop scheduling problems
- error bounds