A three-agent scheduling problem for minimizing the makespan on a single machine.
Wen-Chiung LeeJen-Ya WangPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- single machine
- scheduling problem
- earliness tardiness
- processing times
- maximum lateness
- total weighted tardiness
- release dates
- minimize total
- total tardiness
- sequence dependent setup times
- weighted tardiness
- setup times
- single machine scheduling problem
- flowshop
- competitive ratio
- learning effect
- precedence constraints
- job shop scheduling problem
- scheduling jobs
- tabu search
- np hard
- rolling horizon
- production scheduling
- release times
- dynamic programming
- weighted number of tardy jobs
- minimizing makespan
- deteriorating jobs
- parallel machines
- completion times
- number of late jobs