Scheduling chains with identical jobs and constant delays on a single machine.
Peter BruckerSigrid KnustCeyda OguzPublished in: Math. Methods Oper. Res. (2006)
Keyphrases
- single machine
- release dates
- release times
- scheduling problem
- minimize total
- maximum lateness
- scheduling jobs
- processing times
- weighted tardiness
- sequence dependent setup times
- identical machines
- total weighted tardiness
- identical parallel machines
- deteriorating jobs
- earliness tardiness
- job processing times
- total tardiness
- completion times
- number of tardy jobs
- single machine scheduling problem
- parallel machines
- flowshop
- number of late jobs
- weighted number of tardy jobs
- precedence constraints
- setup times
- dominance rules
- learning effect
- production scheduling
- rolling horizon
- dynamic programming
- np hard
- competitive ratio
- makespan minimization
- tabu search
- strongly np hard
- job shop scheduling
- upper bound
- lower bound
- dispatching rule