A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times.
Alejandro López-OrtizClaude-Guy QuimperPublished in: STACS (2011)
Keyphrases
- processing times
- flowshop
- scheduling problem
- identical machines
- scheduling jobs
- single machine
- setup times
- sequence dependent setup times
- parallel machine scheduling problem
- parallel machines
- completion times
- minimizing makespan
- makespan minimization
- scheduling decisions
- total weighted tardiness
- release dates
- strongly np hard
- polynomially solvable
- job processing times
- maximum lateness
- number of tardy jobs
- tabu search
- worst case performance ratio
- identical parallel machines
- single machine scheduling problem
- release times
- special case
- earliness tardiness
- np hard
- job shop
- precedence relations
- manufacturing cell
- assembly line
- competitive ratio
- resource consumption
- job shop scheduling problem
- simulated annealing
- upper bound