Minmax scheduling and due-window assignment with position-dependent processing times and job rejection.
Gur MosheiovAssaf SarigVitaly A. StrusevichPublished in: 4OR (2020)
Keyphrases
- processing times
- scheduling problem
- identical machines
- identical parallel machines
- scheduling jobs
- release dates
- assembly line
- single machine
- scheduling decisions
- release times
- precedence relations
- flowshop
- setup times
- number of tardy jobs
- single machine scheduling problem
- job processing times
- completion times
- makespan minimization
- sequence dependent setup times
- total weighted tardiness
- earliness tardiness
- resource consumption
- polynomially solvable
- manufacturing cell
- worst case performance ratio
- communication delays
- job shop scheduling
- scheduling algorithm
- competitive ratio
- np hard
- precedence constraints
- job shop
- manufacturing systems
- job shop scheduling problem
- resource allocation
- strongly np hard
- search algorithm