Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines.
Peter BruckerNatalia V. ShakhlevichPublished in: J. Sched. (2016)
Keyphrases
- identical parallel machines
- optimality conditions
- scheduling problem
- fixed number
- processing times
- scheduling jobs
- release dates
- nonlinear programming
- parallel machines
- competitive ratio
- single server
- lower level
- single machine
- strongly np hard
- flowshop
- sample size
- precedence constraints
- machine learning
- semidefinite programming
- tabu search
- search algorithm