Single-machine rework rescheduling to minimize maximum waiting-times with fixed sequence of jobs and ready times.
Yandong GuoMin HuangQing WangV. Jorge LeonPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- waiting times
- single machine
- setup times
- minimize total
- scheduling problem
- completion times
- processing times
- job processing times
- total weighted tardiness
- release dates
- weighted tardiness
- release times
- total tardiness
- earliness tardiness
- scheduling jobs
- sequence dependent setup times
- single machine scheduling problem
- maximum lateness
- job shop
- flowshop
- identical machines
- weighted number of tardy jobs
- parallel machines
- number of late jobs
- dynamic programming
- tardiness cost
- deteriorating jobs
- single server
- identical parallel machines
- multi item
- precedence constraints
- fixed number
- shortest processing time