On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

A branch-and-bound algorithm for a two-machine scheduling problem by Grabowski is generalized to the case of an arbitrary number of machines. The lower bounds are obtained by the relaxation of the capacity constraints on the machines. An approach to strengthen these lower bounds is developed. Comput...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of the Operational Research Society 1983-07, Vol.34 (7), p.615-620
Hauptverfasser: Grabowski, Józef, Skubalska, Ewa, Smutnicki, Czesław
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
branch and bound method
Business and Management
Descendants
Integers
Job shops
machinery
Machines
Management
Operations research
Operations Research/Decision Theory
Production scheduling
Scheduling
Technical Note
Technical Notes
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 620
container_issue 7
container_start_page 615
container_title The Journal of the Operational Research Society
container_volume 34
creator Grabowski, Józef
Skubalska, Ewa
Smutnicki, Czesław
description A branch-and-bound algorithm for a two-machine scheduling problem by Grabowski is generalized to the case of an arbitrary number of machines. The lower bounds are obtained by the relaxation of the capacity constraints on the machines. An approach to strengthen these lower bounds is developed. Computational experience with 6-, 10-, 15-, 20-, 30-, 40-, 50-job problems is presented.
doi_str_mv 10.1057/jors.1983.142
format Article
fullrecord <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_231366056</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>2581775</jstor_id><sourcerecordid>2581775</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3482-36a629f9b1a98abc2309cb8fda4ec23aabfa05d69186be2a619efe01b00bab383</originalsourceid><addsrcrecordid>eNqN0U1v1DAQBmALgcRSOHK3AMEpiz8SfxxRSwFpq5UonK1J4nS9SuzFTrSUX49DOFRVW_VkWX5m7PGL0GtK1pRU8uM-xLSmWvE1LdkTtKKlFIXmgjxFK0IFKSqh2HP0IqU9IUQTqldou_X4vA9HfLkLB3zZ7Gw79c5f4aMbd_i77S0ki8G3-Gyy-AxGm_AY8IXzbnB_LL6A326YBrzJJ96m9BI966BP9tX_9QT9PP_84_Rrsdl--Xb6aVM0vFSs4AIE052uKWgFdcM40U2tuhZKmzcAdQekaoWmStSWgaDadpbQmpAaaq74Cfqw9D3E8GuyaTSDS43te_A2TMnIsqyqSmqW5fsHJeNMUEn4IyCVSjKd4ZtbcB-m6PO4s-FCkEpk9PY-RPOwjBFezo8rFtXEkFK0nTlEN0C8NpSYOVQzh2rmUA3959eLT9n5KxtvdL2n4N1SsE9jiDe75y-XhlWKSlllphbmfBfiAMcQ-9aMcN2H2EXwjUuG333DX0EYwUg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1309220342</pqid></control><display><type>article</type><title>On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness</title><source>Jstor Complete Legacy</source><source>Periodicals Index Online</source><creator>Grabowski, Józef ; Skubalska, Ewa ; Smutnicki, Czesław</creator><creatorcontrib>Grabowski, Józef ; Skubalska, Ewa ; Smutnicki, Czesław</creatorcontrib><description>A branch-and-bound algorithm for a two-machine scheduling problem by Grabowski is generalized to the case of an arbitrary number of machines. The lower bounds are obtained by the relaxation of the capacity constraints on the machines. An approach to strengthen these lower bounds is developed. Computational experience with 6-, 10-, 15-, 20-, 30-, 40-, 50-job problems is presented.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/jors.1983.142</identifier><identifier>CODEN: OPRQAK</identifier><language>eng</language><publisher>London: Taylor &amp; Francis</publisher><subject>Algorithms ; branch and bound method ; Business and Management ; Descendants ; Integers ; Job shops ; machinery ; Machines ; Management ; Operations research ; Operations Research/Decision Theory ; Production scheduling ; Scheduling ; Technical Note ; Technical Notes</subject><ispartof>The Journal of the Operational Research Society, 1983-07, Vol.34 (7), p.615-620</ispartof><rights>Copyright © 1983, Operational Research Society 1983</rights><rights>Copyright 1983 Operational Research Society Limited</rights><rights>Operational Research Society 1983</rights><rights>Copyright Palgrave Macmillan Limited Jul 1983</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3482-36a629f9b1a98abc2309cb8fda4ec23aabfa05d69186be2a619efe01b00bab383</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/2581775$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/2581775$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,776,780,799,27846,27901,27902,57992,58225</link.rule.ids></links><search><creatorcontrib>Grabowski, Józef</creatorcontrib><creatorcontrib>Skubalska, Ewa</creatorcontrib><creatorcontrib>Smutnicki, Czesław</creatorcontrib><title>On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>A branch-and-bound algorithm for a two-machine scheduling problem by Grabowski is generalized to the case of an arbitrary number of machines. The lower bounds are obtained by the relaxation of the capacity constraints on the machines. An approach to strengthen these lower bounds is developed. Computational experience with 6-, 10-, 15-, 20-, 30-, 40-, 50-job problems is presented.</description><subject>Algorithms</subject><subject>branch and bound method</subject><subject>Business and Management</subject><subject>Descendants</subject><subject>Integers</subject><subject>Job shops</subject><subject>machinery</subject><subject>Machines</subject><subject>Management</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>Technical Note</subject><subject>Technical Notes</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1983</creationdate><recordtype>article</recordtype><sourceid>K30</sourceid><recordid>eNqN0U1v1DAQBmALgcRSOHK3AMEpiz8SfxxRSwFpq5UonK1J4nS9SuzFTrSUX49DOFRVW_VkWX5m7PGL0GtK1pRU8uM-xLSmWvE1LdkTtKKlFIXmgjxFK0IFKSqh2HP0IqU9IUQTqldou_X4vA9HfLkLB3zZ7Gw79c5f4aMbd_i77S0ki8G3-Gyy-AxGm_AY8IXzbnB_LL6A326YBrzJJ96m9BI966BP9tX_9QT9PP_84_Rrsdl--Xb6aVM0vFSs4AIE052uKWgFdcM40U2tuhZKmzcAdQekaoWmStSWgaDadpbQmpAaaq74Cfqw9D3E8GuyaTSDS43te_A2TMnIsqyqSmqW5fsHJeNMUEn4IyCVSjKd4ZtbcB-m6PO4s-FCkEpk9PY-RPOwjBFezo8rFtXEkFK0nTlEN0C8NpSYOVQzh2rmUA3959eLT9n5KxtvdL2n4N1SsE9jiDe75y-XhlWKSlllphbmfBfiAMcQ-9aMcN2H2EXwjUuG333DX0EYwUg</recordid><startdate>19830701</startdate><enddate>19830701</enddate><creator>Grabowski, Józef</creator><creator>Skubalska, Ewa</creator><creator>Smutnicki, Czesław</creator><general>Taylor &amp; Francis</general><general>Pergamon Press</general><general>Palgrave Macmillan UK</general><general>Taylor &amp; Francis Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JXBYG</scope><scope>K30</scope><scope>PAAUG</scope><scope>PAWHS</scope><scope>PAWZZ</scope><scope>PAXOH</scope><scope>PBHAV</scope><scope>PBQSW</scope><scope>PBYQZ</scope><scope>PCIWU</scope><scope>PCMID</scope><scope>PCZJX</scope><scope>PDGRG</scope><scope>PDWWI</scope><scope>PETMR</scope><scope>PFVGT</scope><scope>PGXDX</scope><scope>PIHIL</scope><scope>PISVA</scope><scope>PJCTQ</scope><scope>PJTMS</scope><scope>PLCHJ</scope><scope>PMHAD</scope><scope>PNQDJ</scope><scope>POUND</scope><scope>PPLAD</scope><scope>PQAPC</scope><scope>PQCAN</scope><scope>PQCMW</scope><scope>PQEME</scope><scope>PQHKH</scope><scope>PQMID</scope><scope>PQNCT</scope><scope>PQNET</scope><scope>PQSCT</scope><scope>PQSET</scope><scope>PSVJG</scope><scope>PVMQY</scope><scope>PZGFC</scope><scope>JQ2</scope><scope>K9.</scope><scope>U9A</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope><scope>7TC</scope></search><sort><creationdate>19830701</creationdate><title>On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness</title><author>Grabowski, Józef ; Skubalska, Ewa ; Smutnicki, Czesław</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3482-36a629f9b1a98abc2309cb8fda4ec23aabfa05d69186be2a619efe01b00bab383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1983</creationdate><topic>Algorithms</topic><topic>branch and bound method</topic><topic>Business and Management</topic><topic>Descendants</topic><topic>Integers</topic><topic>Job shops</topic><topic>machinery</topic><topic>Machines</topic><topic>Management</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>Technical Note</topic><topic>Technical Notes</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Grabowski, Józef</creatorcontrib><creatorcontrib>Skubalska, Ewa</creatorcontrib><creatorcontrib>Smutnicki, Czesław</creatorcontrib><collection>CrossRef</collection><collection>Periodicals Index Online Segment 40</collection><collection>Periodicals Index Online</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - West</collection><collection>Primary Sources Access (Plan D) - International</collection><collection>Primary Sources Access &amp; Build (Plan A) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Midwest</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Northeast</collection><collection>Primary Sources Access (Plan D) - Southeast</collection><collection>Primary Sources Access (Plan D) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Southeast</collection><collection>Primary Sources Access (Plan D) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - UK / I</collection><collection>Primary Sources Access (Plan D) - Canada</collection><collection>Primary Sources Access (Plan D) - EMEALA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - International</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - International</collection><collection>Primary Sources Access (Plan D) - West</collection><collection>Periodicals Index Online Segments 1-50</collection><collection>Primary Sources Access (Plan D) - APAC</collection><collection>Primary Sources Access (Plan D) - Midwest</collection><collection>Primary Sources Access (Plan D) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Canada</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - EMEALA</collection><collection>Primary Sources Access &amp; Build (Plan A) - APAC</collection><collection>Primary Sources Access &amp; Build (Plan A) - Canada</collection><collection>Primary Sources Access &amp; Build (Plan A) - West</collection><collection>Primary Sources Access &amp; Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access &amp; Build (Plan A) - Midwest</collection><collection>Primary Sources Access &amp; Build (Plan A) - North Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - Northeast</collection><collection>Primary Sources Access &amp; Build (Plan A) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - Southeast</collection><collection>Primary Sources Access (Plan D) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - APAC</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - MEA</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><collection>Mechanical Engineering Abstracts</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Grabowski, Józef</au><au>Skubalska, Ewa</au><au>Smutnicki, Czesław</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>1983-07-01</date><risdate>1983</risdate><volume>34</volume><issue>7</issue><spage>615</spage><epage>620</epage><pages>615-620</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>OPRQAK</coden><abstract>A branch-and-bound algorithm for a two-machine scheduling problem by Grabowski is generalized to the case of an arbitrary number of machines. The lower bounds are obtained by the relaxation of the capacity constraints on the machines. An approach to strengthen these lower bounds is developed. Computational experience with 6-, 10-, 15-, 20-, 30-, 40-, 50-job problems is presented.</abstract><cop>London</cop><pub>Taylor &amp; Francis</pub><doi>10.1057/jors.1983.142</doi><tpages>6</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0160-5682
ispartof The Journal of the Operational Research Society, 1983-07, Vol.34 (7), p.615-620
issn 0160-5682
1476-9360
language eng
recordid cdi_proquest_journals_231366056
source Jstor Complete Legacy; Periodicals Index Online
subjects Algorithms
branch and bound method
Business and Management
Descendants
Integers
Job shops
machinery
Machines
Management
Operations research
Operations Research/Decision Theory
Production scheduling
Scheduling
Technical Note
Technical Notes
title On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T22%3A18%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Flow%20Shop%20Scheduling%20with%20Release%20and%20Due%20Dates%20to%20Minimize%20Maximum%20Lateness&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Grabowski,%20J%C3%B3zef&rft.date=1983-07-01&rft.volume=34&rft.issue=7&rft.spage=615&rft.epage=620&rft.pages=615-620&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=OPRQAK&rft_id=info:doi/10.1057/jors.1983.142&rft_dat=%3Cjstor_proqu%3E2581775%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1309220342&rft_id=info:pmid/&rft_jstor_id=2581775&rfr_iscdi=true