Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration.
Chinyao LowChou-Jung HsuChwen-Tzeng SuPublished in: Comput. Math. Appl. (2008)
Keyphrases
- single machine
- simple linear
- scheduling problem
- deteriorating jobs
- total weighted tardiness
- maximum lateness
- processing times
- earliness tardiness
- total tardiness
- scheduling jobs
- release dates
- minimize total
- learning effect
- release times
- weighted number of tardy jobs
- pairwise
- sequence dependent setup times
- setup times
- multi class
- dynamic programming
- database systems
- number of late jobs
- identical machines
- global constraints
- np hard
- optimal solution