Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert.
Reza Tavakkoli-MoghaddamGhasem MoslehiM. VaseiAmir AzaronPublished in: Appl. Math. Comput. (2005)
Keyphrases
- optimal scheduling
- single machine to minimize
- scheduling problem
- total tardiness
- number of late jobs
- single machine
- flowshop
- scheduling algorithm
- completion times
- preemptive scheduling
- release times
- absolute difference
- setup times
- tabu search
- response time
- np hard
- processing times
- parallel machines
- sequence dependent setup times
- genetic algorithm
- scheduling jobs
- objective function