Time-cost tradeoff in a three-dimensional assignment problem
The paper discusses the three-dimensional assignment problem with two objective functions. The prototype problem is that there are n jobs, n machines, and n workers. The decision variable \(x_{ijk}\) has a value of 1 if the j-th job is assigned to the i-th worker to be performed on the k-th machine, otherwise the value is 0. Both cost and throughput time are to be minimized. These objectives are usually conflicting, therefore a multiobjective approach is necessary. The authors define a tradeoff ratio which helps evaluating a sequence of solutions with increasing cost and decreasing time. A pair with minimum ratio is accepted as optimal solution of the problem. Some heuristic arguments are also given.
- Time–cost trade-off in a multi-choice assignment problem
- An algorithm for the optimum time-cost trade-off in three dimensional transportation problem
- scientific article; zbMATH DE number 93515
- Time-Cost Trade-Off Analysis in Some Constrained Assignment Problems
- The three dimensional bottleneck assignment problem and its variants
- An Algorithm for the Traveling Salesman Problem
- scientific article; zbMATH DE number 4131951 (Why is no real title available?)
- scientific article; zbMATH DE number 4010209 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3231693 (Why is no real title available?)
- Letter to the Editor—The Multidimensional Assignment Problem
- The three dimensional bottleneck assignment problem and its variants
- Un algoritmo misto per il problema dell'assegnazione pluridimensionale
- Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- scientific article; zbMATH DE number 4131951 (Why is no real title available?)
- The three dimensional bottleneck assignment problem and its variants
- Bicriteria bottleneck linear programming problem
- Optimization analysis of the three‐level time schemes
- Cost-time trade-off in three-axial sums' transportation problem
- On lexicographic optimal solutions in transportation problems
- Time-cost Trade-off Relations in Bulk Transportation Problem
- Time–cost trade-off in a multi-choice assignment problem
This page was built for publication: Time-cost tradeoff in a three-dimensional assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123126)