A bicriterion machine-assignment problem
From MaRDI portal
An assignment problem involving any number of machines with two objectives - one primary and another secondary - is studied. The primary objective is to minimize the duration of completing work and the secondary objective is to minimize the total processing cost. An algorithm is developed to obtain its solution.
Recommendations
Cited in
(8)- A priority based assignment problem
- scientific article; zbMATH DE number 32539 (Why is no real title available?)
- scientific article; zbMATH DE number 32542 (Why is no real title available?)
- scientific article; zbMATH DE number 93515 (Why is no real title available?)
- scientific article; zbMATH DE number 3997544 (Why is no real title available?)
- A Class of Single Machine Central Tendency-Dispersion Bicriteria Problems
- Time–cost trade-off in a multi-choice assignment problem
- On a pair of job-machine assignment problems with two stages
This page was built for publication: A bicriterion machine-assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581218)