Minimizing maximum lateness of jobs in inventory constrained scheduling.
Dirk BriskornJoseph Y.-T. LeungPublished in: J. Oper. Res. Soc. (2013)
Keyphrases
- maximum lateness
- single machine
- batch processing machines
- release dates
- scheduling problem
- parallel machines
- sequence dependent setup times
- completion times
- flowshop
- precedence constraints
- lot sizing
- release times
- dominance rules
- deteriorating jobs
- processing times
- single machine scheduling problem
- parallel machine scheduling problem
- holding cost
- identical parallel machines
- identical machines
- setup times
- lead time
- service level
- supply chain
- special case
- setup cost
- objective function
- total cost
- branch and bound algorithm
- planning horizon
- parallel computing
- tabu search
- linear programming
- state space
- np hard