Batching and Scheduling Jobs on Batch and Discrete Processors
We consider a situation in which the manufacturing system is equipped with batch and discrete processors. Each batch processor can process a batch (limited number) of jobs simultaneously. Once the process begins, no job can be released from the batch processor until the entire batch is processed. In...
Gespeichert in:
| Veröffentlicht in: | Operations research 1992-07, Vol.40 (4), p.750-763 |
|---|---|
| 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 | 763 |
|---|---|
| container_issue | 4 |
| container_start_page | 750 |
| container_title | Operations research |
| container_volume | 40 |
| creator | Ahmadi, Javad H Ahmadi, Reza H Dasu, Sriram Tang, Christopher S |
| description | We consider a situation in which the manufacturing system is equipped with batch and discrete processors. Each batch processor can process a batch (limited number) of jobs simultaneously. Once the process begins, no job can be released from the batch processor until the entire batch is processed. In this paper, we analyze a class of two-machine batching and scheduling problems in which the batch processor plays an important role. Specifically, we consider two performance measures: the makespan and the sum of job completion times. We analyze the complexity of this class of problems, present polynomial procedures for some problems, propose a heuristic, and establish an upper bound on the worst case performance ratio of the heuristic for the NP-complete problem. In addition, we extend our analysis to the case of multiple families and to the case of three-machine batching. |
| doi_str_mv | 10.1287/opre.40.4.750 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_1303081230</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>171005</jstor_id><sourcerecordid>171005</sourcerecordid><originalsourceid>FETCH-LOGICAL-c339t-28e5e30a11ddc4222a6c1e3892f911d49180312f6ad86407d5cdcc4878eed49b3</originalsourceid><addsrcrecordid>eNqFkD1PwzAQhi0EEqUwMrFEgJhIOH8lzsAA5VuVQAIkNst1nDZViYudCvHvcZpCJ8R0sp_n7nQvQvsYEkxEdmbnziQMEpZkHDZQD3OSxpyldBP1ACjENGVv22jH-ykA5DzlPXR-qRo9qepxpOoietYTUyxm7fPBjnxk62jJl_Cq8tqZxkRPzmrjvXV-F22VaubN3qr20evN9cvgLh4-3t4PLoaxpjRvYiIMNxQUxkWhGSFEpRobKnJS5uGP5VgAxaRMVSFSBlnBdaE1E5kwJtAR7aPDbu7c2Y-F8Y2c2oWrw0pJcI4pIZgG6egvCdNwvsAklD6KO0s7670zpZy76l25L4lBtjHKNkbJQDIZYgz-8Wqq8lrNSqdqXfnfJs6BYyqCdtBpU99Yt56ZYQAe6GlHq7q07t3_u_Ok0yfVePJZBfTT13p-LX4DwqaVtQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>219132213</pqid></control><display><type>article</type><title>Batching and Scheduling Jobs on Batch and Discrete Processors</title><source>Informs PubsOnline</source><source>JSTOR</source><source>Periodicals Index Online</source><source>EBSCOhost Business Source Complete</source><creator>Ahmadi, Javad H ; Ahmadi, Reza H ; Dasu, Sriram ; Tang, Christopher S</creator><creatorcontrib>Ahmadi, Javad H ; Ahmadi, Reza H ; Dasu, Sriram ; Tang, Christopher S</creatorcontrib><description>We consider a situation in which the manufacturing system is equipped with batch and discrete processors. Each batch processor can process a batch (limited number) of jobs simultaneously. Once the process begins, no job can be released from the batch processor until the entire batch is processed. In this paper, we analyze a class of two-machine batching and scheduling problems in which the batch processor plays an important role. Specifically, we consider two performance measures: the makespan and the sum of job completion times. We analyze the complexity of this class of problems, present polynomial procedures for some problems, propose a heuristic, and establish an upper bound on the worst case performance ratio of the heuristic for the NP-complete problem. In addition, we extend our analysis to the case of multiple families and to the case of three-machine batching.</description><identifier>ISSN: 0030-364X</identifier><identifier>EISSN: 1526-5463</identifier><identifier>DOI: 10.1287/opre.40.4.750</identifier><identifier>CODEN: OPREAI</identifier><language>eng</language><publisher>Linthicum, MD: INFORMS</publisher><subject>Algorithms ; Applied sciences ; Batch processing ; Dispatching ; Dynamic programming ; Exact sciences and technology ; Heuristic ; Heuristics ; Integers ; Lagrangian function ; Manufacturing processes ; manufacturing: automated systems ; Mathematical analysis ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Polynomials ; production/scheduling: algorithms and heuristics ; Scheduling ; Scheduling, sequencing ; Semiconductor wafers ; Workloads</subject><ispartof>Operations research, 1992-07, Vol.40 (4), p.750-763</ispartof><rights>Copyright 1992 The Operations Research Society of America</rights><rights>1992 INIST-CNRS</rights><rights>Copyright Institute for Operations Research and the Management Sciences Jul/Aug 1992</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c339t-28e5e30a11ddc4222a6c1e3892f911d49180312f6ad86407d5cdcc4878eed49b3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/171005$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/opre.40.4.750$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,776,780,799,3679,27848,27903,27904,57995,58228,62592</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5505138$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Ahmadi, Javad H</creatorcontrib><creatorcontrib>Ahmadi, Reza H</creatorcontrib><creatorcontrib>Dasu, Sriram</creatorcontrib><creatorcontrib>Tang, Christopher S</creatorcontrib><title>Batching and Scheduling Jobs on Batch and Discrete Processors</title><title>Operations research</title><description>We consider a situation in which the manufacturing system is equipped with batch and discrete processors. Each batch processor can process a batch (limited number) of jobs simultaneously. Once the process begins, no job can be released from the batch processor until the entire batch is processed. In this paper, we analyze a class of two-machine batching and scheduling problems in which the batch processor plays an important role. Specifically, we consider two performance measures: the makespan and the sum of job completion times. We analyze the complexity of this class of problems, present polynomial procedures for some problems, propose a heuristic, and establish an upper bound on the worst case performance ratio of the heuristic for the NP-complete problem. In addition, we extend our analysis to the case of multiple families and to the case of three-machine batching.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Batch processing</subject><subject>Dispatching</subject><subject>Dynamic programming</subject><subject>Exact sciences and technology</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Integers</subject><subject>Lagrangian function</subject><subject>Manufacturing processes</subject><subject>manufacturing: automated systems</subject><subject>Mathematical analysis</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Polynomials</subject><subject>production/scheduling: algorithms and heuristics</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Semiconductor wafers</subject><subject>Workloads</subject><issn>0030-364X</issn><issn>1526-5463</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><sourceid>K30</sourceid><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqFkD1PwzAQhi0EEqUwMrFEgJhIOH8lzsAA5VuVQAIkNst1nDZViYudCvHvcZpCJ8R0sp_n7nQvQvsYEkxEdmbnziQMEpZkHDZQD3OSxpyldBP1ACjENGVv22jH-ykA5DzlPXR-qRo9qepxpOoietYTUyxm7fPBjnxk62jJl_Cq8tqZxkRPzmrjvXV-F22VaubN3qr20evN9cvgLh4-3t4PLoaxpjRvYiIMNxQUxkWhGSFEpRobKnJS5uGP5VgAxaRMVSFSBlnBdaE1E5kwJtAR7aPDbu7c2Y-F8Y2c2oWrw0pJcI4pIZgG6egvCdNwvsAklD6KO0s7670zpZy76l25L4lBtjHKNkbJQDIZYgz-8Wqq8lrNSqdqXfnfJs6BYyqCdtBpU99Yt56ZYQAe6GlHq7q07t3_u_Ok0yfVePJZBfTT13p-LX4DwqaVtQ</recordid><startdate>19920701</startdate><enddate>19920701</enddate><creator>Ahmadi, Javad H</creator><creator>Ahmadi, Reza H</creator><creator>Dasu, Sriram</creator><creator>Tang, Christopher S</creator><general>INFORMS</general><general>Operations Research Society of America</general><general>Institute for Operations Research and the Management Sciences</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>HJHVS</scope><scope>IBDFT</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>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>88F</scope><scope>8AL</scope><scope>8AO</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</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>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M1Q</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>19920701</creationdate><title>Batching and Scheduling Jobs on Batch and Discrete Processors</title><author>Ahmadi, Javad H ; Ahmadi, Reza H ; Dasu, Sriram ; Tang, Christopher S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c339t-28e5e30a11ddc4222a6c1e3892f911d49180312f6ad86407d5cdcc4878eed49b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Batch processing</topic><topic>Dispatching</topic><topic>Dynamic programming</topic><topic>Exact sciences and technology</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Integers</topic><topic>Lagrangian function</topic><topic>Manufacturing processes</topic><topic>manufacturing: automated systems</topic><topic>Mathematical analysis</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Polynomials</topic><topic>production/scheduling: algorithms and heuristics</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Semiconductor wafers</topic><topic>Workloads</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ahmadi, Javad H</creatorcontrib><creatorcontrib>Ahmadi, Reza H</creatorcontrib><creatorcontrib>Dasu, Sriram</creatorcontrib><creatorcontrib>Tang, Christopher S</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Periodicals Index Online Segment 19</collection><collection>Periodicals Index Online Segment 27</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 & 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 & 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 & 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 & Build (Plan A) - APAC</collection><collection>Primary Sources Access & Build (Plan A) - Canada</collection><collection>Primary Sources Access & Build (Plan A) - West</collection><collection>Primary Sources Access & Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - Midwest</collection><collection>Primary Sources Access & Build (Plan A) - North Central</collection><collection>Primary Sources Access & Build (Plan A) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - South Central</collection><collection>Primary Sources Access & 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 Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Medical Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</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>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</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>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>Research Library Prep</collection><collection>SciTech Premium Collection</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>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>PML(ProQuest Medical Library)</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>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>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ahmadi, Javad H</au><au>Ahmadi, Reza H</au><au>Dasu, Sriram</au><au>Tang, Christopher S</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Batching and Scheduling Jobs on Batch and Discrete Processors</atitle><jtitle>Operations research</jtitle><date>1992-07-01</date><risdate>1992</risdate><volume>40</volume><issue>4</issue><spage>750</spage><epage>763</epage><pages>750-763</pages><issn>0030-364X</issn><eissn>1526-5463</eissn><coden>OPREAI</coden><abstract>We consider a situation in which the manufacturing system is equipped with batch and discrete processors. Each batch processor can process a batch (limited number) of jobs simultaneously. Once the process begins, no job can be released from the batch processor until the entire batch is processed. In this paper, we analyze a class of two-machine batching and scheduling problems in which the batch processor plays an important role. Specifically, we consider two performance measures: the makespan and the sum of job completion times. We analyze the complexity of this class of problems, present polynomial procedures for some problems, propose a heuristic, and establish an upper bound on the worst case performance ratio of the heuristic for the NP-complete problem. In addition, we extend our analysis to the case of multiple families and to the case of three-machine batching.</abstract><cop>Linthicum, MD</cop><pub>INFORMS</pub><doi>10.1287/opre.40.4.750</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0030-364X |
| ispartof | Operations research, 1992-07, Vol.40 (4), p.750-763 |
| issn | 0030-364X 1526-5463 |
| language | eng |
| recordid | cdi_proquest_journals_1303081230 |
| source | Informs PubsOnline; JSTOR; Periodicals Index Online; EBSCOhost Business Source Complete |
| subjects | Algorithms Applied sciences Batch processing Dispatching Dynamic programming Exact sciences and technology Heuristic Heuristics Integers Lagrangian function Manufacturing processes manufacturing: automated systems Mathematical analysis Operational research and scientific management Operational research. Management science Operations research Polynomials production/scheduling: algorithms and heuristics Scheduling Scheduling, sequencing Semiconductor wafers Workloads |
| title | Batching and Scheduling Jobs on Batch and Discrete Processors |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T20%3A15%3A08IST&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=Batching%20and%20Scheduling%20Jobs%20on%20Batch%20and%20Discrete%20Processors&rft.jtitle=Operations%20research&rft.au=Ahmadi,%20Javad%20H&rft.date=1992-07-01&rft.volume=40&rft.issue=4&rft.spage=750&rft.epage=763&rft.pages=750-763&rft.issn=0030-364X&rft.eissn=1526-5463&rft.coden=OPREAI&rft_id=info:doi/10.1287/opre.40.4.750&rft_dat=%3Cjstor_proqu%3E171005%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=219132213&rft_id=info:pmid/&rft_jstor_id=171005&rfr_iscdi=true |