Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements.
Hanyu GuJulia MemarYakov ZinderPublished in: IWOCA (2017)
Keyphrases
- flowshop
- scheduling problem
- flowshop scheduling problems
- lot streaming
- processing times
- asymptotic optimality
- buffer allocation
- flowshop scheduling
- special case
- setup times
- maximum lateness
- tabu search
- job shop
- multistage
- sequence dependent setup times
- optimal solution
- minimizing makespan
- total weighted tardiness
- asymptotically optimal
- harmony search algorithm
- completion times
- parallel machines
- production system
- np hard
- neural network