Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems.
Janina A. BrennerGuido SchäferPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- scheduling problem
- flowshop
- processing times
- single machine
- np hard
- permutation flowshop
- tabu search
- minimizing makespan
- setup times
- precedence constraints
- job shop scheduling
- job shop scheduling problem
- parallel machines
- release dates
- sequence dependent setup times
- earliness tardiness
- job shop
- unrelated parallel machines
- deteriorating jobs
- scheduling jobs
- group members
- lower bound
- limited capacity
- greedy heuristics