Minimizing makespan in a Flow Shop Sequence Dependent Group Scheduling problem with blocking constraint.
Antonio CostaF. V. CappadonnaSergio FicheraPublished in: Eng. Appl. Artif. Intell. (2020)
Keyphrases
- minimizing makespan
- flowshop
- scheduling problem
- total flowtime
- processing times
- maximum tardiness
- setup times
- flowshop scheduling
- single machine
- bicriteria
- tabu search
- sequence dependent setup times
- special case
- parallel machines
- np hard
- maximum lateness
- makespan minimization
- total tardiness
- permutation flowshop
- flowshop scheduling problems
- precedence constraints
- asymptotic optimality
- strongly np hard
- total weighted tardiness
- unrelated parallel machines
- neural network
- open shop
- job shop