On the equivalence of single machine earliness/tardiness problems with job rejection.
Christos KoulamasS. S. PanwalkarPublished in: Comput. Ind. Eng. (2015)
Keyphrases
- single machine
- earliness tardiness
- processing times
- scheduling problem
- maximum lateness
- single machine scheduling problem
- release dates
- scheduling jobs
- release times
- total weighted tardiness
- parallel machines
- weighted number of tardy jobs
- flowshop
- dynamic programming
- sequence dependent setup times
- identical machines
- completion times
- optimization problems
- deteriorating jobs
- job shop
- search space
- identical parallel machines
- parallel computing
- simulated annealing
- evolutionary algorithm