ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM
DOI:
https://doi.org/10.25130/tjps.v27i6.764Abstract
This paper considers a bi-criteria planning problems on a single machine, with the goal of minimizing total square time duration and maximizing earliness. To solve this problem we have to find the Pareto set. We introduced a strong relation between lower bound, upper bound of the problem and the number of efficient solutions via a theorem which shows also that the lower bound is near to optimal solution if the number of efficient solutions is small.
Downloads
Published
How to Cite
License
Copyright (c) 2023 Tikrit Journal of Pure Science
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
