Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion.
Christophe SauveyNathalie SauerPublished in: Algorithms (2020)
Keyphrases
- permutation flowshop
- total flowtime
- scheduling problem
- flowshop
- strongly np hard
- maximum tardiness
- tabu search
- flowshop scheduling problems
- unrelated parallel machines
- minimizing makespan
- single machine
- setup times
- processing times
- np hard
- upper bound
- lower bound
- precedence constraints
- scheduling jobs
- job shop scheduling problem
- flowshop scheduling
- bicriteria
- sequence dependent setup times
- parallel machines
- makespan minimization
- total tardiness
- minimizing total tardiness
- dynamic programming
- optimal solution
- identical parallel machines
- maximum lateness
- job shop
- heuristic methods
- open shop
- search procedure
- branch and bound algorithm
- search algorithm
- feasible solution