A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines.
Akiyoshi ShiouraNatalia V. ShakhlevichVitaly A. StrusevichPublished in: SIAM J. Discret. Math. (2013)
Keyphrases
- scheduling problem
- parallel machines
- bicriteria
- flowshop
- single machine
- total tardiness
- sequence dependent setup times
- unrelated parallel machines
- processing times
- completion times
- setup times
- precedence constraints
- np hard
- special case
- minimizing makespan
- efficient solutions
- single server
- integer linear programming
- tabu search
- optimization problems
- single machine scheduling problem
- job shop scheduling problem
- shortest path problem
- probabilistic model
- greedy algorithm
- multistage
- probability distribution
- job shop
- lower bound