ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM

ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM

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 nu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Tikrit Journal of Pure Science 2023-01, Vol.27 (6), p.88-91
Hauptverfasser: Rzgar F. Mahmood, Ayad Mohammed Ramadan, Mediya B. Mrakhan, Nasyar Hussein Qader4
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 91
container_issue 6
container_start_page 88
container_title Tikrit Journal of Pure Science
container_volume 27
creator Rzgar F. Mahmood
Ayad Mohammed Ramadan
Mediya B. Mrakhan
Nasyar Hussein Qader4
description 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.
doi_str_mv 10.25130/tjps.v27i6.764
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_25130_tjps_v27i6_764</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_25130_tjps_v27i6_764</sourcerecordid><originalsourceid>FETCH-crossref_primary_10_25130_tjps_v27i6_7643</originalsourceid><addsrcrecordid>eNqVzt0KgjAYxvERBUl13Ol7A-reWdMOl80cmMa041GhYBSFi6C774NuoKMH_vDAj5ApUo_NMaD-_XSz3oOFLfdCPusRh81w7mLIeJ84GGHgIudsSCbWtgeKjEYLHjGHiCKHrdCyKqCUFSSFBgFL5cZaVVIrAaXK15mEjYhTlUso41Sudtk7wlYXy0xuxmTQ7M-2nvx2RPxEVnHqHrurtV3dmFvXXvbd0yA1X6z5YM0Xa97Y4P_HC5l1QvM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Rzgar F. Mahmood ; Ayad Mohammed Ramadan ; Mediya B. Mrakhan ; Nasyar Hussein Qader4</creator><creatorcontrib>Rzgar F. Mahmood ; Ayad Mohammed Ramadan ; Mediya B. Mrakhan ; Nasyar Hussein Qader4</creatorcontrib><description>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.</description><identifier>ISSN: 1813-1662</identifier><identifier>EISSN: 2415-1726</identifier><identifier>DOI: 10.25130/tjps.v27i6.764</identifier><language>eng</language><ispartof>Tikrit Journal of Pure Science, 2023-01, Vol.27 (6), p.88-91</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Rzgar F. Mahmood</creatorcontrib><creatorcontrib>Ayad Mohammed Ramadan</creatorcontrib><creatorcontrib>Mediya B. Mrakhan</creatorcontrib><creatorcontrib>Nasyar Hussein Qader4</creatorcontrib><title>ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM</title><title>Tikrit Journal of Pure Science</title><description>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.</description><issn>1813-1662</issn><issn>2415-1726</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNqVzt0KgjAYxvERBUl13Ol7A-reWdMOl80cmMa041GhYBSFi6C774NuoKMH_vDAj5ApUo_NMaD-_XSz3oOFLfdCPusRh81w7mLIeJ84GGHgIudsSCbWtgeKjEYLHjGHiCKHrdCyKqCUFSSFBgFL5cZaVVIrAaXK15mEjYhTlUso41Sudtk7wlYXy0xuxmTQ7M-2nvx2RPxEVnHqHrurtV3dmFvXXvbd0yA1X6z5YM0Xa97Y4P_HC5l1QvM</recordid><startdate>20230129</startdate><enddate>20230129</enddate><creator>Rzgar F. Mahmood</creator><creator>Ayad Mohammed Ramadan</creator><creator>Mediya B. Mrakhan</creator><creator>Nasyar Hussein Qader4</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20230129</creationdate><title>ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM</title><author>Rzgar F. Mahmood ; Ayad Mohammed Ramadan ; Mediya B. Mrakhan ; Nasyar Hussein Qader4</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-crossref_primary_10_25130_tjps_v27i6_7643</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Rzgar F. Mahmood</creatorcontrib><creatorcontrib>Ayad Mohammed Ramadan</creatorcontrib><creatorcontrib>Mediya B. Mrakhan</creatorcontrib><creatorcontrib>Nasyar Hussein Qader4</creatorcontrib><collection>CrossRef</collection><jtitle>Tikrit Journal of Pure Science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rzgar F. Mahmood</au><au>Ayad Mohammed Ramadan</au><au>Mediya B. Mrakhan</au><au>Nasyar Hussein Qader4</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM</atitle><jtitle>Tikrit Journal of Pure Science</jtitle><date>2023-01-29</date><risdate>2023</risdate><volume>27</volume><issue>6</issue><spage>88</spage><epage>91</epage><pages>88-91</pages><issn>1813-1662</issn><eissn>2415-1726</eissn><abstract>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.</abstract><doi>10.25130/tjps.v27i6.764</doi></addata></record>
fulltext fulltext
identifier ISSN: 1813-1662
ispartof Tikrit Journal of Pure Science, 2023-01, Vol.27 (6), p.88-91
issn 1813-1662
2415-1726
language eng
recordid cdi_crossref_primary_10_25130_tjps_v27i6_764
source EZB-FREE-00999 freely available EZB journals
title ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T19%3A49%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=ON%20PARETO%20SET%20FOR%20A%20BI-CRITERIA%20SINGLE%20MACHINE%20SCHEDULING%20PROBLEM&rft.jtitle=Tikrit%20Journal%20of%20Pure%20Science&rft.au=Rzgar%20F.%20Mahmood&rft.date=2023-01-29&rft.volume=27&rft.issue=6&rft.spage=88&rft.epage=91&rft.pages=88-91&rft.issn=1813-1662&rft.eissn=2415-1726&rft_id=info:doi/10.25130/tjps.v27i6.764&rft_dat=%3Ccrossref%3E10_25130_tjps_v27i6_764%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true