A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem.
Antonio CostaFulvio Antonio CappadonnaSergio FicheraPublished in: J. Intell. Manuf. (2017)
Keyphrases
- minimizing makespan
- flowshop
- scheduling problem
- total flowtime
- single machine
- maximum tardiness
- flowshop scheduling
- processing times
- bicriteria
- special case
- tabu search
- setup times
- flowshop scheduling problems
- sequence dependent setup times
- total tardiness
- makespan minimization
- maximum lateness
- parallel machines
- np hard
- asymptotic optimality
- permutation flowshop
- precedence constraints
- job shop scheduling problem
- lot streaming
- total weighted tardiness
- open shop
- unrelated parallel machines
- strongly np hard
- neural network