An approximation scheme for rejection-allowed single-machine rescheduling.
Wenchang LuoMiaomiao JinBing SuGuohui LinPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- single machine
- scheduling problem
- total weighted tardiness
- earliness tardiness
- polynomial time approximation
- processing times
- total tardiness
- release dates
- minimize total
- release times
- maximum lateness
- dynamic programming
- competitive ratio
- number of late jobs
- weighted tardiness
- production scheduling
- scheduling jobs
- approximation algorithms
- np hard
- sequence dependent setup times
- job shop
- single machine scheduling problem
- rolling horizon
- setup times
- weighted number of tardy jobs
- learning effect
- error bounds
- tabu search
- special case