A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion.
Liangshan ShenMehmet Fatih TasgetirenHande ÖztopLevent KandillerLiang GaoPublished in: SSCI (2019)
Keyphrases
- scheduling problem
- flowshop
- total flowtime
- tabu search
- total weighted tardiness
- special case
- permutation flowshop
- variable neighborhood search
- minimizing makespan
- single machine
- sequence dependent setup times
- processing times
- flowshop scheduling problems
- np hard
- makespan minimization
- setup times
- bicriteria
- total tardiness
- flowshop scheduling
- maximum lateness
- precedence constraints
- parallel machines
- strongly np hard
- maximum tardiness
- job shop scheduling problem
- preventive maintenance
- heuristic methods
- computational complexity
- evolutionary algorithm
- unrelated parallel machines
- metaheuristic
- np complete
- upper bound
- cost function
- vehicle routing problem
- search procedure
- memetic algorithm
- lot streaming
- job processing times
- optimal solution