Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time.
Jun PeiXinbao LiuPanos M. PardalosKai LiWenjuan FanAthanasios MigdalasPublished in: Optim. Lett. (2017)
Keyphrases
- single machine
- scheduling problem
- scheduling jobs
- release dates
- sequence dependent setup times
- flowshop
- minimize total
- maximum lateness
- weighted tardiness
- processing times
- release times
- identical machines
- setup times
- single machine scheduling problem
- parallel machines
- earliness tardiness
- rolling horizon
- production scheduling
- precedence constraints
- total weighted tardiness
- completion times
- total tardiness
- learning effect
- shortest processing time
- np hard
- batch processing
- job shop
- competitive ratio
- dynamic programming
- job processing times
- number of late jobs
- strongly np hard
- partially ordered
- production system
- upper bound
- deteriorating jobs
- weighted number of tardy jobs
- search algorithm