Asymmetric Earliness and Tardiness Scheduling with Exponential Processing Times on an Unreliable Machine.
Xiaoqiang CaiXian ZhouPublished in: Ann. Oper. Res. (2000)
Keyphrases
- processing times
- identical machines
- scheduling problem
- scheduling jobs
- flowshop
- scheduling decisions
- single machine
- job processing times
- release dates
- setup times
- manufacturing cell
- sequence dependent setup times
- completion times
- identical parallel machines
- makespan minimization
- parallel machines
- number of tardy jobs
- precedence relations
- total weighted tardiness
- polynomially solvable
- tabu search
- shortest processing time
- batch processing
- release times
- communication delays
- strongly np hard
- single machine scheduling problem
- resource consumption
- precedence constraints
- worst case performance ratio
- np hard
- job shop scheduling problem
- job shop
- search algorithm
- production scheduling
- scheduling algorithm
- earliness tardiness
- particle swarm optimization
- dynamic programming