Abstract
<abstract><p>This paper studies the Pareto scheduling problem of minimizing total weighted completion time and maximum cost on a single machine. It is known that the problem is strongly NP-hard. Algorithms with running time $ O(n^3) $ are presented for the following cases: arbitrary processing times, equal release dates and equal weights; equal processing times, arbitrary release dates and equal weights; equal processing times, equal release dates and arbitrary weights.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computational Mathematics,General Agricultural and Biological Sciences,Modeling and Simulation,General Medicine
Reference21 articles.
1. H. Hoogeveen, Multicriteria scheduling, Eur. J. Oper. Res., 167 (2005), 592–623. https://doi.org/10.1016/j.ejor.2004.07.011
2. D. Jones, S. Firouzy, A. Labib, A. V. Argyriou, Multiple criteria model for allocating new medical robotic devices to treatment centres, Eur. J. Oper. Res., 297 (2022), 652–664. https://doi.org/10.1016/j.ejor.2021.06.003
3. F. F. Ostermeier, On the trade-offs between scheduling objectives for unpaced mixed-model assembly lines, Int. J. Prod. Res., 60 (2022), 866–893. https://doi.org/10.1080/00207543.2020.1845914
4. P. M. Kumar, G. C. Babu, A. Selvaraj, M. Raza, A. K. Luhach, V. G. Daaz, Multi-criteria-based approach for job scheduling in industry 4.0 in smart cities using fuzzy logic, Soft Comput., 25 (2021), 12059–12074.
5. V. T'Kindt, J. C. Billaut, Multicriteria scheduling: theory, models and algorithms, second edition, Springer Verlag, Berlin, 2006.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献