A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date.
Shih-Wei LinShuo-Yan ChouKuo-Ching YingPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- tardiness penalties
- scheduling problem
- completion times
- sequence dependent setup times
- precedence constraints
- single machine
- single machine scheduling problem
- processing times
- weighted number of tardy jobs
- deteriorating jobs
- flowshop
- branch and bound algorithm
- release dates
- setup times
- bicriteria
- parallel machines
- np hard
- tabu search
- tardiness cost
- approximation algorithms
- minimizing makespan
- global constraints
- partial order
- lower bound
- branch and bound
- response time