Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times.
Márton DrótosTamás KisPublished in: J. Sched. (2013)
Keyphrases
- minimize total
- objective function
- completion times
- total cost
- weighted sum
- scheduling problem
- single machine
- release dates
- parallel machines
- job processing times
- optimal solution
- weighted tardiness
- identical parallel machines
- release times
- processing times
- tardiness cost
- lead time
- unrelated parallel machines
- job scheduling
- identical machines
- setup times
- lot sizing
- flowshop
- single machine scheduling problem
- scheduling strategy
- multi item
- scheduling jobs
- maximum lateness
- optimal scheduling
- wafer fabrication
- holding cost
- optimization problems
- sequence dependent setup times
- deteriorating jobs
- scheduling algorithm
- batch processing machines
- scheduling policies
- precedence constraints
- batch processing
- computational grids
- fixed number
- linear programming
- material handling
- planning horizon
- precedence relations
- lower bound
- resource allocation
- lot size
- single item
- queue length
- service level
- feasible solution
- setup cost
- round robin
- supply chain
- list scheduling
- cost function
- inventory level
- tabu search
- dynamic programming