A single-machine bi-criterion scheduling problem with two agents.
Wen-Chiung LeeYu-Hsiang ChungZong-Ren HuangPublished in: Appl. Math. Comput. (2013)
Keyphrases
- single machine
- scheduling problem
- earliness tardiness
- total weighted tardiness
- processing times
- total tardiness
- maximum lateness
- release times
- multiple agents
- setup times
- flowshop
- minimize total
- release dates
- scheduling jobs
- np hard
- sequence dependent setup times
- production scheduling
- learning effect
- single machine scheduling problem
- precedence constraints
- tabu search
- weighted tardiness
- deteriorating jobs
- weighted number of tardy jobs
- minimizing makespan
- competitive ratio
- job shop
- identical parallel machines
- makespan minimization
- identical machines
- search space
- resource allocation
- upper bound
- dynamic programming
- number of late jobs