Openshop Scheduling with Machine Dependent Processing Times.
Moshe DrorPublished in: Discret. Appl. Math. (1992)
Keyphrases
- processing times
- identical machines
- scheduling problem
- scheduling jobs
- flowshop
- scheduling decisions
- single machine
- release dates
- job processing times
- sequence dependent setup times
- manufacturing cell
- completion times
- precedence relations
- setup times
- parallel machines
- identical parallel machines
- number of tardy jobs
- makespan minimization
- assembly line
- release times
- total weighted tardiness
- polynomially solvable
- communication delays
- single machine scheduling problem
- resource consumption
- precedence constraints
- earliness tardiness
- worst case performance ratio
- np hard
- batch processing
- tabu search
- shortest processing time
- strongly np hard
- job shop
- competitive ratio
- production scheduling
- special case