Two-agent scheduling problems on a single-machine to minimize the total weighted late work.
Zhang XingongWang YongPublished in: J. Comb. Optim. (2017)
Keyphrases
- single machine
- scheduling problem
- processing times
- earliness tardiness
- completion times
- total weighted tardiness
- maximum lateness
- total tardiness
- minimize total
- sequence dependent setup times
- setup times
- release dates
- flowshop
- number of late jobs
- shortest processing time
- precedence constraints
- np hard
- weighted tardiness
- learning effect
- release times
- parallel machines
- scheduling jobs
- tabu search
- job shop scheduling
- production scheduling
- multiple agents
- makespan minimization
- rolling horizon
- weighted number of tardy jobs
- competitive ratio
- strongly np hard
- deteriorating jobs
- reinforcement learning
- special case