Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?.
Vadim G. TimkovskyPublished in: Discret. Appl. Math. (1998)
Keyphrases
- job shop
- scheduling problem
- identical parallel machines
- job shop scheduling
- processing times
- single machine
- tabu search
- flowshop
- strongly np hard
- job shop scheduling problem
- precedence constraints
- setup times
- release dates
- production scheduling
- fixed number
- resource constrained
- np hard
- learning algorithm
- parallel machines
- competitive ratio
- memetic algorithm