Single-Machine Rework Rescheduling to Minimize Total Waiting Time With Fixed Sequence of Jobs and Release Times.
Yandong GuoMin HuangQing WangV. Jorge LeonPublished in: IEEE Access (2021)
Keyphrases
- single machine
- release times
- minimize total
- release dates
- scheduling problem
- weighted tardiness
- number of late jobs
- processing times
- maximum lateness
- scheduling jobs
- single machine scheduling problem
- learning effect
- sequence dependent setup times
- setup times
- dynamic programming
- competitive ratio
- precedence constraints
- deteriorating jobs
- fixed number
- parallel machines
- lower bound
- completion times
- identical machines
- branch and bound
- np hard