Single machine lot scheduling to minimize the total weighted (discounted) completion time.
E. ZhangMing LiuFeifeng ZhengYinfeng XuPublished in: Inf. Process. Lett. (2019)
Keyphrases
- single machine
- scheduling problem
- completion times
- minimize total
- release dates
- release times
- scheduling jobs
- maximum lateness
- sequence dependent setup times
- weighted tardiness
- dynamic programming
- processing times
- shortest processing time
- deteriorating jobs
- earliness tardiness
- number of late jobs
- total weighted tardiness
- setup times
- identical machines
- rolling horizon
- single machine scheduling problem
- total tardiness
- production scheduling
- learning effect
- flowshop
- np hard
- weighted number of tardy jobs
- precedence constraints
- markov decision processes
- parallel machines
- identical parallel machines
- job shop
- job shop scheduling
- competitive ratio
- job shop scheduling problem
- weighted sum
- tabu search
- optimal policy
- branch and bound algorithm
- graph model