Efficient heuristic for solving non-permutation flow-shop scheduling problems with maximal and minimal time lags.
Song YeNing ZhaoKaidian LiChuanjin LeiPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- scheduling problem
- flowshop
- strongly np hard
- tabu search
- squeaky wheel
- job shop scheduling problem
- single machine
- unrelated parallel machines
- asymptotic optimality
- setup times
- list scheduling
- processing times
- graph coloring problems
- np hard
- job shop
- total tardiness
- parallel machines
- maximum lateness
- job shop scheduling
- special case
- total weighted tardiness
- makespan minimization
- flowshop scheduling
- minimizing makespan
- bicriteria
- dynamic programming
- sequence dependent setup times
- quay crane
- sequencing problems
- release dates
- precedence constraints
- combinatorial optimization
- search algorithm
- optimal solution
- np complete
- flowshop scheduling problems