A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines.
Philippe ChrétienneAlain QuilliotPublished in: Discret. Appl. Math. (2018)
Keyphrases
- scheduling problem
- identical parallel machines
- strongly np hard
- np hard
- competitive ratio
- processing times
- parallel machines
- dynamic programming
- single machine
- flowshop
- computational complexity
- learning algorithm
- scheduling jobs
- release dates
- setup times
- convergence rate
- monte carlo
- worst case
- single machine scheduling problem
- ant colony optimization
- simulated annealing
- special case
- search space