Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach.
Hanyu GuJulia MemarYakov ZinderPublished in: WALCOM (2018)
Keyphrases
- batch processing
- lagrangian relaxation
- flowshop
- total weighted tardiness
- scheduling problem
- setup times
- np hard
- processing times
- dispatching rule
- makespan minimization
- integer programming
- scheduling jobs
- sequence dependent setup times
- single machine
- feasible solution
- maximum lateness
- special case
- branch and bound algorithm
- flowshop scheduling
- lower bound
- tabu search
- linear programming
- single machine scheduling problem
- minimizing makespan
- job shop
- dynamic programming
- column generation
- preventive maintenance
- bicriteria
- precedence constraints
- job processing times
- parallel machines
- lower and upper bounds
- identical parallel machines
- release dates
- number of tardy jobs
- branch and bound
- lot streaming
- strongly np hard
- completion times
- simulated annealing
- shortest path
- constraint programming
- approximation algorithms
- knapsack problem
- optimal solution