Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements.
Hanyu GuAlexander V. KononovJulia MemarYakov ZinderPublished in: J. Discrete Algorithms (2018)
Keyphrases
- flowshop
- scheduling problem
- flowshop scheduling problems
- lot streaming
- asymptotic optimality
- flowshop scheduling
- processing times
- buffer allocation
- job shop
- maximum lateness
- setup times
- special case
- tabu search
- minimizing makespan
- genetic algorithm
- sequence dependent setup times
- job shop scheduling
- harmony search algorithm
- asymptotically optimal
- single machine
- completion times
- production scheduling
- multistage
- optimal solution