Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs
This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of each batch, where a batch is a maximal set of jobs in...
Gespeichert in:
| Veröffentlicht in: | Journal of scheduling 2005-04, Vol.8 (2), p.161-177 |
|---|---|
| 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 | 177 |
|---|---|
| container_issue | 2 |
| container_start_page | 161 |
| container_title | Journal of scheduling |
| container_volume | 8 |
| creator | Crauwels, H. A. J. Potts, C. N. Oudheusden, D. Van Van Wassenhove, L. N. |
| description | This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of each batch, where a batch is a maximal set of jobs in the same family that are processed consecutively. We design branch and bound algorithms that have several alternative features. Lower bounds can be derived by relaxing either the set-up times or the due dates. A first branching scheme uses a forward branching rule with a depth-first search strategy. Dominance criteria, which determine the order of the early jobs within each family and the order of the batches containing early jobs, can be fully exploited in this scheme. A second scheme uses a ternary branching rule in which the next job is fixed to be early and starting a batch, to be early and not starting a batch, or to be late. The different features are compared on a large set of test problems, where the number of jobs ranges from 30 to 50 and the number of families ranges from 4 to 10. [PUBLICATION ABSTRACT] |
| doi_str_mv | 10.1007/s10951-005-6365-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28921886</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28921886</sourcerecordid><originalsourceid>FETCH-LOGICAL-c303t-dde89ffdedb81db192f1e951ffe963b3132e83c5cf5b39aa9be69dafbb75f2913</originalsourceid><addsrcrecordid>eNpdkEtPwzAMgCsEEmPwA7hFHLgV8mi75MgQT21wGJyjPJy1o20gaYXg15MxTlxsy_5k2V-WnRJ8QTCeXUaCRUlyjMu8YlWZF3vZJLVETgpa7v_WRV4RVh1mRzFuMMZ8Rskke5sH1Zsaqd6iuR9TvGrXPjRD3UXkfECrpl-3gJbK1E0PaGVqsGObmugzQWiuhu1gjQaPlk3fdM03oKEG9DR2GgLyDi3UAOjR63icHTjVRjj5y9Ps9fbm5fo-XzzfPVxfLXLDMBtya4EL5yxYzYnVRFBHID3nHIiKaUYYBc5MaVypmVBKaKiEVU7rWemoIGyane_2vgf_MUIcZNdEA22revBjlJQLSjivEnj2D9z4MfTpNkkZLWjBOEsQ2UEm-BgDOPkemk6FL0mw3LqXO_cyuZdb97JgP2K1eAE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>232424383</pqid></control><display><type>article</type><title>Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs</title><source>SpringerNature Journals</source><creator>Crauwels, H. A. J. ; Potts, C. N. ; Oudheusden, D. Van ; Van Wassenhove, L. N.</creator><creatorcontrib>Crauwels, H. A. J. ; Potts, C. N. ; Oudheusden, D. Van ; Van Wassenhove, L. N.</creatorcontrib><description>This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of each batch, where a batch is a maximal set of jobs in the same family that are processed consecutively. We design branch and bound algorithms that have several alternative features. Lower bounds can be derived by relaxing either the set-up times or the due dates. A first branching scheme uses a forward branching rule with a depth-first search strategy. Dominance criteria, which determine the order of the early jobs within each family and the order of the batches containing early jobs, can be fully exploited in this scheme. A second scheme uses a ternary branching rule in which the next job is fixed to be early and starting a batch, to be early and not starting a batch, or to be late. The different features are compared on a large set of test problems, where the number of jobs ranges from 30 to 50 and the number of families ranges from 4 to 10. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 1094-6136</identifier><identifier>EISSN: 1099-1425</identifier><identifier>DOI: 10.1007/s10951-005-6365-4</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Algorithms ; Branch & bound algorithms ; Careers ; Group technology ; Operations research ; Schedules ; Scheduling ; Scheduling algorithms ; Studies</subject><ispartof>Journal of scheduling, 2005-04, Vol.8 (2), p.161-177</ispartof><rights>Springer Science + Business Media, Inc. 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c303t-dde89ffdedb81db192f1e951ffe963b3132e83c5cf5b39aa9be69dafbb75f2913</citedby><cites>FETCH-LOGICAL-c303t-dde89ffdedb81db192f1e951ffe963b3132e83c5cf5b39aa9be69dafbb75f2913</cites></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>Crauwels, H. A. J.</creatorcontrib><creatorcontrib>Potts, C. N.</creatorcontrib><creatorcontrib>Oudheusden, D. Van</creatorcontrib><creatorcontrib>Van Wassenhove, L. N.</creatorcontrib><title>Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs</title><title>Journal of scheduling</title><description>This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of each batch, where a batch is a maximal set of jobs in the same family that are processed consecutively. We design branch and bound algorithms that have several alternative features. Lower bounds can be derived by relaxing either the set-up times or the due dates. A first branching scheme uses a forward branching rule with a depth-first search strategy. Dominance criteria, which determine the order of the early jobs within each family and the order of the batches containing early jobs, can be fully exploited in this scheme. A second scheme uses a ternary branching rule in which the next job is fixed to be early and starting a batch, to be early and not starting a batch, or to be late. The different features are compared on a large set of test problems, where the number of jobs ranges from 30 to 50 and the number of families ranges from 4 to 10. [PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Branch & bound algorithms</subject><subject>Careers</subject><subject>Group technology</subject><subject>Operations research</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Scheduling algorithms</subject><subject>Studies</subject><issn>1094-6136</issn><issn>1099-1425</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpdkEtPwzAMgCsEEmPwA7hFHLgV8mi75MgQT21wGJyjPJy1o20gaYXg15MxTlxsy_5k2V-WnRJ8QTCeXUaCRUlyjMu8YlWZF3vZJLVETgpa7v_WRV4RVh1mRzFuMMZ8Rskke5sH1Zsaqd6iuR9TvGrXPjRD3UXkfECrpl-3gJbK1E0PaGVqsGObmugzQWiuhu1gjQaPlk3fdM03oKEG9DR2GgLyDi3UAOjR63icHTjVRjj5y9Ps9fbm5fo-XzzfPVxfLXLDMBtya4EL5yxYzYnVRFBHID3nHIiKaUYYBc5MaVypmVBKaKiEVU7rWemoIGyane_2vgf_MUIcZNdEA22revBjlJQLSjivEnj2D9z4MfTpNkkZLWjBOEsQ2UEm-BgDOPkemk6FL0mw3LqXO_cyuZdb97JgP2K1eAE</recordid><startdate>20050401</startdate><enddate>20050401</enddate><creator>Crauwels, H. A. J.</creator><creator>Potts, C. N.</creator><creator>Oudheusden, D. Van</creator><creator>Van Wassenhove, L. N.</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88C</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M0T</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20050401</creationdate><title>Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs</title><author>Crauwels, H. A. J. ; Potts, C. N. ; Oudheusden, D. Van ; Van Wassenhove, L. N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c303t-dde89ffdedb81db192f1e951ffe963b3132e83c5cf5b39aa9be69dafbb75f2913</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithms</topic><topic>Branch & bound algorithms</topic><topic>Careers</topic><topic>Group technology</topic><topic>Operations research</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Scheduling algorithms</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Crauwels, H. A. J.</creatorcontrib><creatorcontrib>Potts, C. N.</creatorcontrib><creatorcontrib>Oudheusden, D. Van</creatorcontrib><creatorcontrib>Van Wassenhove, L. N.</creatorcontrib><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Healthcare Administration Database (Alumni)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Healthcare Administration Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of scheduling</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Crauwels, H. A. J.</au><au>Potts, C. N.</au><au>Oudheusden, D. Van</au><au>Van Wassenhove, L. N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs</atitle><jtitle>Journal of scheduling</jtitle><date>2005-04-01</date><risdate>2005</risdate><volume>8</volume><issue>2</issue><spage>161</spage><epage>177</epage><pages>161-177</pages><issn>1094-6136</issn><eissn>1099-1425</eissn><abstract>This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of each batch, where a batch is a maximal set of jobs in the same family that are processed consecutively. We design branch and bound algorithms that have several alternative features. Lower bounds can be derived by relaxing either the set-up times or the due dates. A first branching scheme uses a forward branching rule with a depth-first search strategy. Dominance criteria, which determine the order of the early jobs within each family and the order of the batches containing early jobs, can be fully exploited in this scheme. A second scheme uses a ternary branching rule in which the next job is fixed to be early and starting a batch, to be early and not starting a batch, or to be late. The different features are compared on a large set of test problems, where the number of jobs ranges from 30 to 50 and the number of families ranges from 4 to 10. [PUBLICATION ABSTRACT]</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1007/s10951-005-6365-4</doi><tpages>17</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1094-6136 |
| ispartof | Journal of scheduling, 2005-04, Vol.8 (2), p.161-177 |
| issn | 1094-6136 1099-1425 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28921886 |
| source | SpringerNature Journals |
| subjects | Algorithms Branch & bound algorithms Careers Group technology Operations research Schedules Scheduling Scheduling algorithms Studies |
| title | Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T15%3A28%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Branch%20and%20Bound%20Algorithms%20for%20Single%20Machine%20Scheduling%20with%20Batching%20to%20Minimize%20the%20Number%20of%20Late%20Jobs&rft.jtitle=Journal%20of%20scheduling&rft.au=Crauwels,%20H.%20A.%20J.&rft.date=2005-04-01&rft.volume=8&rft.issue=2&rft.spage=161&rft.epage=177&rft.pages=161-177&rft.issn=1094-6136&rft.eissn=1099-1425&rft_id=info:doi/10.1007/s10951-005-6365-4&rft_dat=%3Cproquest_cross%3E28921886%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=232424383&rft_id=info:pmid/&rfr_iscdi=true |