Scheduling two agents with sum-of-processing-times-based deterioration on a single machine.
Peng LiuNa YiXiaoye ZhouHua GongPublished in: Appl. Math. Comput. (2013)
Keyphrases
- single machine
- processing times
- scheduling problem
- completion times
- release dates
- scheduling jobs
- deteriorating jobs
- minimize total
- release times
- identical machines
- maximum lateness
- earliness tardiness
- setup times
- total weighted tardiness
- sequence dependent setup times
- identical parallel machines
- number of tardy jobs
- single machine scheduling problem
- flowshop
- makespan minimization
- job processing times
- production scheduling
- resource consumption
- parallel machines
- resource allocation
- polynomially solvable
- learning effect
- competitive ratio
- precedence constraints
- objective function
- np hard
- dynamic programming
- weighted sum
- tabu search
- job shop scheduling
- job shop