Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date.
Celso S. SakurabaDébora P. RonconiFrancis SourdPublished in: Comput. Oper. Res. (2009)
Keyphrases
- flowshop
- scheduling problem
- sequence dependent setup times
- minimizing total tardiness
- maximum lateness
- unrelated parallel machines
- setup times
- parallel machines
- single machine
- preventive maintenance
- processing times
- bicriteria
- flowshop scheduling
- minimizing makespan
- precedence constraints
- job processing times
- makespan minimization
- np hard
- tabu search
- total weighted tardiness
- job shop
- robotic cell
- special case
- number of tardy jobs
- manufacturing cell
- job shop scheduling problem
- total tardiness
- objective function
- flowshop scheduling problems
- strongly np hard
- permutation flowshop
- release dates
- identical parallel machines
- dispatching rule
- completion times
- multistage
- linear combination
- genetic algorithm