Scheduling problems with two competing agents to minimize minmax and minsum earliness measures.
Baruch MorGur MosheiovPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- scheduling problem
- min sum
- np hard
- single machine
- lower bound
- processing times
- completion times
- flowshop
- tardiness penalties
- tardiness cost
- parallel machines
- branch and bound algorithm
- approximation algorithms
- integer programming
- goal programming
- precedence constraints
- setup times
- linear programming
- job shop scheduling problem
- special case
- optimal solution
- computational complexity
- tabu search
- knapsack problem
- single machine scheduling problem
- min cut
- pareto optimal
- sequence dependent setup times