Optimal due date determination and sequencing of n jobs on a single machine using the SLK method
The problem of scheduling n jobs with deterministic processing times on a single machine is considered. An algorithm, by means of which the set of all optimal sequences is obtained using the SLK due date assignment method, is provided. The optimization criteria used is the minimization of the total...
Gespeichert in:
| Veröffentlicht in: | Computers in industry 1993-04, Vol.21 (3), p.335-339 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 339 |
|---|---|
| container_issue | 3 |
| container_start_page | 335 |
| container_title | Computers in industry |
| container_volume | 21 |
| creator | KARACAPILIDIS, N. I PAPPIS, C. P |
| description | The problem of scheduling n jobs with deterministic processing times on a single machine is considered. An algorithm, by means of which the set of all optimal sequences is obtained using the SLK due date assignment method, is provided. The optimization criteria used is the minimization of the total earliness and tardiness penalty. It is proven that this set can be determined without making use of the Complementary Pair and Exchange Principle concepts. |
| doi_str_mv | 10.1016/0166-3615(93)90030-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_journals_235766112</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1019241</sourcerecordid><originalsourceid>FETCH-LOGICAL-p209t-9ca167d79f78c0e2a1d2b30e7cd0d471cfdf8c912cf0eafdd41c6fee12d757b43</originalsourceid><addsrcrecordid>eNo9UE1PwzAMjRBIjME_4GAhDnAo5KNNliNCfIlJOwDnkiUO69SmpUkP_HsyMWHJtmw_PduPkHNGbxhl8ja7LIRk1ZUW15pSQYvqgMzYQvFCMl0ektk_5JicxLil2ZSSM_K5GlLTmRbchOBMygETjl0TTGr6ACY4iPg9YbBN-ILeQ4Btv46wm0HMvRahM3bTBIRpV0PaILwtX6HDtOndKTnypo14ts9z8vH48H7_XCxXTy_3d8ti4FSnQlvDpHJKe7WwFLlhjq8FRWUddaVi1ju_sJpx6yka71zJrPSIjDtVqXUp5uTij3cY-3xuTPW2n8aQV9ZcVEpKxngGXe5BJlrT-tHkt2I9jFmC8acuFd-pJ34BNgRkSw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>235766112</pqid></control><display><type>article</type><title>Optimal due date determination and sequencing of n jobs on a single machine using the SLK method</title><source>Elsevier ScienceDirect Journals Complete - AutoHoldings</source><creator>KARACAPILIDIS, N. I ; PAPPIS, C. P</creator><creatorcontrib>KARACAPILIDIS, N. I ; PAPPIS, C. P</creatorcontrib><description>The problem of scheduling n jobs with deterministic processing times on a single machine is considered. An algorithm, by means of which the set of all optimal sequences is obtained using the SLK due date assignment method, is provided. The optimization criteria used is the minimization of the total earliness and tardiness penalty. It is proven that this set can be determined without making use of the Complementary Pair and Exchange Principle concepts.</description><identifier>ISSN: 0166-3615</identifier><identifier>EISSN: 1872-6194</identifier><identifier>DOI: 10.1016/0166-3615(93)90030-5</identifier><identifier>CODEN: CINUD4</identifier><language>eng</language><publisher>Amsterdam: Elsevier</publisher><subject>Algorithms ; Applied sciences ; Exact sciences and technology ; Job shops ; Operational research and scientific management ; Operational research. Management science ; Production scheduling ; Scheduling, sequencing ; Sequential scheduling</subject><ispartof>Computers in industry, 1993-04, Vol.21 (3), p.335-339</ispartof><rights>1993 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Apr 1993</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27922,27923</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4729003$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>KARACAPILIDIS, N. I</creatorcontrib><creatorcontrib>PAPPIS, C. P</creatorcontrib><title>Optimal due date determination and sequencing of n jobs on a single machine using the SLK method</title><title>Computers in industry</title><description>The problem of scheduling n jobs with deterministic processing times on a single machine is considered. An algorithm, by means of which the set of all optimal sequences is obtained using the SLK due date assignment method, is provided. The optimization criteria used is the minimization of the total earliness and tardiness penalty. It is proven that this set can be determined without making use of the Complementary Pair and Exchange Principle concepts.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Job shops</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Production scheduling</subject><subject>Scheduling, sequencing</subject><subject>Sequential scheduling</subject><issn>0166-3615</issn><issn>1872-6194</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1993</creationdate><recordtype>article</recordtype><recordid>eNo9UE1PwzAMjRBIjME_4GAhDnAo5KNNliNCfIlJOwDnkiUO69SmpUkP_HsyMWHJtmw_PduPkHNGbxhl8ja7LIRk1ZUW15pSQYvqgMzYQvFCMl0ektk_5JicxLil2ZSSM_K5GlLTmRbchOBMygETjl0TTGr6ACY4iPg9YbBN-ILeQ4Btv46wm0HMvRahM3bTBIRpV0PaILwtX6HDtOndKTnypo14ts9z8vH48H7_XCxXTy_3d8ti4FSnQlvDpHJKe7WwFLlhjq8FRWUddaVi1ju_sJpx6yka71zJrPSIjDtVqXUp5uTij3cY-3xuTPW2n8aQV9ZcVEpKxngGXe5BJlrT-tHkt2I9jFmC8acuFd-pJ34BNgRkSw</recordid><startdate>19930401</startdate><enddate>19930401</enddate><creator>KARACAPILIDIS, N. I</creator><creator>PAPPIS, C. P</creator><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19930401</creationdate><title>Optimal due date determination and sequencing of n jobs on a single machine using the SLK method</title><author>KARACAPILIDIS, N. I ; PAPPIS, C. P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p209t-9ca167d79f78c0e2a1d2b30e7cd0d471cfdf8c912cf0eafdd41c6fee12d757b43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Job shops</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Production scheduling</topic><topic>Scheduling, sequencing</topic><topic>Sequential scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>KARACAPILIDIS, N. I</creatorcontrib><creatorcontrib>PAPPIS, C. P</creatorcontrib><collection>Pascal-Francis</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers in industry</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>KARACAPILIDIS, N. I</au><au>PAPPIS, C. P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal due date determination and sequencing of n jobs on a single machine using the SLK method</atitle><jtitle>Computers in industry</jtitle><date>1993-04-01</date><risdate>1993</risdate><volume>21</volume><issue>3</issue><spage>335</spage><epage>339</epage><pages>335-339</pages><issn>0166-3615</issn><eissn>1872-6194</eissn><coden>CINUD4</coden><abstract>The problem of scheduling n jobs with deterministic processing times on a single machine is considered. An algorithm, by means of which the set of all optimal sequences is obtained using the SLK due date assignment method, is provided. The optimization criteria used is the minimization of the total earliness and tardiness penalty. It is proven that this set can be determined without making use of the Complementary Pair and Exchange Principle concepts.</abstract><cop>Amsterdam</cop><pub>Elsevier</pub><doi>10.1016/0166-3615(93)90030-5</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0166-3615 |
| ispartof | Computers in industry, 1993-04, Vol.21 (3), p.335-339 |
| issn | 0166-3615 1872-6194 |
| language | eng |
| recordid | cdi_proquest_journals_235766112 |
| source | Elsevier ScienceDirect Journals Complete - AutoHoldings |
| subjects | Algorithms Applied sciences Exact sciences and technology Job shops Operational research and scientific management Operational research. Management science Production scheduling Scheduling, sequencing Sequential scheduling |
| title | Optimal due date determination and sequencing of n jobs on a single machine using the SLK method |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T16%3A19%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20due%20date%20determination%20and%20sequencing%20of%20n%20jobs%20on%20a%20single%20machine%20using%20the%20SLK%20method&rft.jtitle=Computers%20in%20industry&rft.au=KARACAPILIDIS,%20N.%20I&rft.date=1993-04-01&rft.volume=21&rft.issue=3&rft.spage=335&rft.epage=339&rft.pages=335-339&rft.issn=0166-3615&rft.eissn=1872-6194&rft.coden=CINUD4&rft_id=info:doi/10.1016/0166-3615(93)90030-5&rft_dat=%3Cproquest_pasca%3E1019241%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=235766112&rft_id=info:pmid/&rfr_iscdi=true |