Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments.
Dvir ShabtayGeorge SteinerLiron YedidsionPublished in: Discret. Appl. Math. (2010)
Keyphrases
- bicriteria
- efficient solutions
- maximum tardiness
- integer linear programming
- completion times
- scheduling problem
- weighted sum
- single machine
- shortest path problem
- minimizing makespan
- optimization problems
- knapsack problem
- processing times
- resource allocation
- objective function
- cutting plane
- multiple objectives
- column generation
- optimal solution