Scheduling with batching: A review
There is an extensive literature on models that integrate scheduling with batching decisions. Jobs may be batched if they share the same setup on a machine. Another reason for batching occurs when a machine can process several jobs simultaneously. This paper reviews the literature on scheduling with...
Gespeichert in:
| Veröffentlicht in: | European Journal of Operational Research 2000-01, Vol.120 (2), p.228-249 |
|---|---|
| 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 | 249 |
|---|---|
| container_issue | 2 |
| container_start_page | 228 |
| container_title | European Journal of Operational Research |
| container_volume | 120 |
| creator | Potts, Chris N. Kovalyov, Mikhail Y. |
| description | There is an extensive literature on models that integrate scheduling with batching decisions. Jobs may be batched if they share the same setup on a machine. Another reason for batching occurs when a machine can process several jobs simultaneously. This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results. Special attention is given to the design of efficient dynamic programming algorithms for solving these types of problems. |
| doi_str_mv | 10.1016/S0377-2217(99)00153-8 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204149355</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221799001538</els_id><sourcerecordid>50962307</sourcerecordid><originalsourceid>FETCH-LOGICAL-c454t-7540791dfefe3c3f1e9e3bb9e0886afaa766df69cefa8ddd5a6479bb8403719e3</originalsourceid><addsrcrecordid>eNqFkF9PwyAUxYnRxDn9CCbNnvShCi1Q8MUsi__iEh-mz4TCrWXZ1grdln176Wb2KsnlQHLu4fJD6JrgO4IJv5_hvCjSLCPFjZS3GBOWp-IEDYgospQLjk_R4Gg5RxchzHHvImyARjNTg10v3Oo72bquTkrdmTreHpJx4mHjYHuJziq9CHD1p0P09fz0OXlNpx8vb5PxNDWU0S4tGMWFJLaCCnKTVwQk5GUpAQvBdaV1wbmtuDRQaWGtZZrTQpaloHE2Er1DNDrktr75WUPo1LxZ-1V8UmWYEipzxqKJHUzGNyF4qFTr3VL7nSJY9TTUnobqv6qkVHsaSsS-90OfhxbMsQnimjcegtqoXJMMx30XK4uAorj-GKvtNRMqo1LV3TKmPR7SIPKIjLwKxsHKgHUeTKds4_6Z5xchy37J</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204149355</pqid></control><display><type>article</type><title>Scheduling with batching: A review</title><source>RePEc</source><source>Elsevier ScienceDirect Journals Complete</source><creator>Potts, Chris N. ; Kovalyov, Mikhail Y.</creator><creatorcontrib>Potts, Chris N. ; Kovalyov, Mikhail Y.</creatorcontrib><description>There is an extensive literature on models that integrate scheduling with batching decisions. Jobs may be batched if they share the same setup on a machine. Another reason for batching occurs when a machine can process several jobs simultaneously. This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results. Special attention is given to the design of efficient dynamic programming algorithms for solving these types of problems.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(99)00153-8</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithm ; Algorithms ; Approximation ; Batching ; Complexity ; Dynamic programming ; Families ; Production scheduling ; Review ; Scheduling ; Studies</subject><ispartof>European Journal of Operational Research, 2000-01, Vol.120 (2), p.228-249</ispartof><rights>2000 Elsevier Science B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Jan 16, 2000</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c454t-7540791dfefe3c3f1e9e3bb9e0886afaa766df69cefa8ddd5a6479bb8403719e3</citedby><cites>FETCH-LOGICAL-c454t-7540791dfefe3c3f1e9e3bb9e0886afaa766df69cefa8ddd5a6479bb8403719e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0377-2217(99)00153-8$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>313,314,780,784,792,3550,4008,27922,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a120_3ay_3a2000_3ai_3a2_3ap_3a228-249.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Potts, Chris N.</creatorcontrib><creatorcontrib>Kovalyov, Mikhail Y.</creatorcontrib><title>Scheduling with batching: A review</title><title>European Journal of Operational Research</title><description>There is an extensive literature on models that integrate scheduling with batching decisions. Jobs may be batched if they share the same setup on a machine. Another reason for batching occurs when a machine can process several jobs simultaneously. This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results. Special attention is given to the design of efficient dynamic programming algorithms for solving these types of problems.</description><subject>Algorithm</subject><subject>Algorithms</subject><subject>Approximation</subject><subject>Batching</subject><subject>Complexity</subject><subject>Dynamic programming</subject><subject>Families</subject><subject>Production scheduling</subject><subject>Review</subject><subject>Scheduling</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFkF9PwyAUxYnRxDn9CCbNnvShCi1Q8MUsi__iEh-mz4TCrWXZ1grdln176Wb2KsnlQHLu4fJD6JrgO4IJv5_hvCjSLCPFjZS3GBOWp-IEDYgospQLjk_R4Gg5RxchzHHvImyARjNTg10v3Oo72bquTkrdmTreHpJx4mHjYHuJziq9CHD1p0P09fz0OXlNpx8vb5PxNDWU0S4tGMWFJLaCCnKTVwQk5GUpAQvBdaV1wbmtuDRQaWGtZZrTQpaloHE2Er1DNDrktr75WUPo1LxZ-1V8UmWYEipzxqKJHUzGNyF4qFTr3VL7nSJY9TTUnobqv6qkVHsaSsS-90OfhxbMsQnimjcegtqoXJMMx30XK4uAorj-GKvtNRMqo1LV3TKmPR7SIPKIjLwKxsHKgHUeTKds4_6Z5xchy37J</recordid><startdate>20000116</startdate><enddate>20000116</enddate><creator>Potts, Chris N.</creator><creator>Kovalyov, Mikhail Y.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20000116</creationdate><title>Scheduling with batching: A review</title><author>Potts, Chris N. ; Kovalyov, Mikhail Y.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c454t-7540791dfefe3c3f1e9e3bb9e0886afaa766df69cefa8ddd5a6479bb8403719e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Algorithm</topic><topic>Algorithms</topic><topic>Approximation</topic><topic>Batching</topic><topic>Complexity</topic><topic>Dynamic programming</topic><topic>Families</topic><topic>Production scheduling</topic><topic>Review</topic><topic>Scheduling</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Potts, Chris N.</creatorcontrib><creatorcontrib>Kovalyov, Mikhail Y.</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering 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>European Journal of Operational Research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Potts, Chris N.</au><au>Kovalyov, Mikhail Y.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scheduling with batching: A review</atitle><jtitle>European Journal of Operational Research</jtitle><date>2000-01-16</date><risdate>2000</risdate><volume>120</volume><issue>2</issue><spage>228</spage><epage>249</epage><pages>228-249</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>There is an extensive literature on models that integrate scheduling with batching decisions. Jobs may be batched if they share the same setup on a machine. Another reason for batching occurs when a machine can process several jobs simultaneously. This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results. Special attention is given to the design of efficient dynamic programming algorithms for solving these types of problems.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(99)00153-8</doi><tpages>22</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European Journal of Operational Research, 2000-01, Vol.120 (2), p.228-249 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204149355 |
| source | RePEc; Elsevier ScienceDirect Journals Complete |
| subjects | Algorithm Algorithms Approximation Batching Complexity Dynamic programming Families Production scheduling Review Scheduling Studies |
| title | Scheduling with batching: A review |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T06%3A20%3A03IST&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=Scheduling%20with%20batching:%20A%20review&rft.jtitle=European%20Journal%20of%20Operational%20Research&rft.au=Potts,%20Chris%20N.&rft.date=2000-01-16&rft.volume=120&rft.issue=2&rft.spage=228&rft.epage=249&rft.pages=228-249&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(99)00153-8&rft_dat=%3Cproquest_cross%3E50962307%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=204149355&rft_id=info:pmid/&rft_els_id=S0377221799001538&rfr_iscdi=true |