On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost.
Bin HanWenjun Chris ZhangXiwen LuYingzi LinPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- supply chain
- single machine
- parallel machines
- scheduling problem
- release dates
- customer demand
- earliness tardiness
- sequence dependent setup times
- minimize total
- holding cost
- total tardiness
- lead time
- total weighted tardiness
- scheduling jobs
- maximum lateness
- planning horizon
- total cost
- setup times
- processing times
- precedence constraints
- makespan minimization
- customer orders
- flowshop
- single machine scheduling problem
- service level
- single server
- identical parallel machines
- lot sizing
- expected cost
- dynamic programming
- decision making
- arrival rate
- setup cost
- job shop scheduling problem
- shared memory
- production scheduling
- np hard
- single item
- asymptotically optimal
- infinite horizon
- job shop