Multiproduct batching and scheduling with buffered rework: The case of a car paint shop
We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are...
Gespeichert in:
Veröffentlicht in: | Naval research logistics 2014-09, Vol.61 (6), p.458-471 |
---|---|
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 | 471 |
---|---|
container_issue | 6 |
container_start_page | 458 |
container_title | Naval research logistics |
container_volume | 61 |
creator | Jaehn, Florian Kovalev, Sergey Kovalyov, Mikhail Y. Pesch, Erwin |
description | We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014 |
doi_str_mv | 10.1002/nav.21596 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1642330327</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3398322641</sourcerecordid><originalsourceid>FETCH-LOGICAL-c5256-1e4df843f0f5907174dede01bfc247df25d81fcba49da2efc9645e6831f9da383</originalsourceid><addsrcrecordid>eNqF0c1u1DAUBWALgcRQWPAGltjAIu31b2J2VWkL0jBshhaxsTz2NUmbJoOdMPTtcRnoAqliZfvqO5auDiEvGRwyAH40uB-HnCmjH5EFUxwqXSt4TBbQGFmBNl-ekmc5XwGAlqAW5PLj3E_dNo1h9hPduMm33fCNuiHQ7FsMc3_33HVTSzdzjJgw0IS7MV2_pesWqXcZ6RipK7dEt64bJprbcfucPImuz_jiz3lAPp-drk_eV8tP5x9OjpeVV1zpiqEMsZEiQlQGalbLgAGBbaLnsg6Rq9Cw6DdOmuA4Rm-0VKgbwWIZiEYckNf7f8sK32fMk73psse-dwOOc7ZMSy4ECF7_nyoNjBvDdKGv_qFX45yGskhRigvTaMGKerNXPo05J4x2m7obl24tA3vXhi1t2N9tFHu0t7uux9uHoV0dX_xNVPtElyf8eZ9w6drqWtTKXq7OrTZf1xfL1TvLxC-Inpod</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1552398631</pqid></control><display><type>article</type><title>Multiproduct batching and scheduling with buffered rework: The case of a car paint shop</title><source>EBSCOhost Business Source Complete</source><source>Access via Wiley Online Library</source><creator>Jaehn, Florian ; Kovalev, Sergey ; Kovalyov, Mikhail Y. ; Pesch, Erwin</creator><creatorcontrib>Jaehn, Florian ; Kovalev, Sergey ; Kovalyov, Mikhail Y. ; Pesch, Erwin</creatorcontrib><description>We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014</description><identifier>ISSN: 0894-069X</identifier><identifier>EISSN: 1520-6750</identifier><identifier>DOI: 10.1002/nav.21596</identifier><identifier>CODEN: NRLOEP</identifier><language>eng</language><publisher>New York: Blackwell Publishing Ltd</publisher><subject>batching ; Buffers ; car painting ; Due dates ; Group technology ; Lateness ; Logistics ; Naval ; production ; rework ; Scheduling</subject><ispartof>Naval research logistics, 2014-09, Vol.61 (6), p.458-471</ispartof><rights>2014 Wiley Periodicals, Inc.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c5256-1e4df843f0f5907174dede01bfc247df25d81fcba49da2efc9645e6831f9da383</citedby><cites>FETCH-LOGICAL-c5256-1e4df843f0f5907174dede01bfc247df25d81fcba49da2efc9645e6831f9da383</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnav.21596$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnav.21596$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Jaehn, Florian</creatorcontrib><creatorcontrib>Kovalev, Sergey</creatorcontrib><creatorcontrib>Kovalyov, Mikhail Y.</creatorcontrib><creatorcontrib>Pesch, Erwin</creatorcontrib><title>Multiproduct batching and scheduling with buffered rework: The case of a car paint shop</title><title>Naval research logistics</title><addtitle>Naval Research Logistics</addtitle><description>We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014</description><subject>batching</subject><subject>Buffers</subject><subject>car painting</subject><subject>Due dates</subject><subject>Group technology</subject><subject>Lateness</subject><subject>Logistics</subject><subject>Naval</subject><subject>production</subject><subject>rework</subject><subject>Scheduling</subject><issn>0894-069X</issn><issn>1520-6750</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNqF0c1u1DAUBWALgcRQWPAGltjAIu31b2J2VWkL0jBshhaxsTz2NUmbJoOdMPTtcRnoAqliZfvqO5auDiEvGRwyAH40uB-HnCmjH5EFUxwqXSt4TBbQGFmBNl-ekmc5XwGAlqAW5PLj3E_dNo1h9hPduMm33fCNuiHQ7FsMc3_33HVTSzdzjJgw0IS7MV2_pesWqXcZ6RipK7dEt64bJprbcfucPImuz_jiz3lAPp-drk_eV8tP5x9OjpeVV1zpiqEMsZEiQlQGalbLgAGBbaLnsg6Rq9Cw6DdOmuA4Rm-0VKgbwWIZiEYckNf7f8sK32fMk73psse-dwOOc7ZMSy4ECF7_nyoNjBvDdKGv_qFX45yGskhRigvTaMGKerNXPo05J4x2m7obl24tA3vXhi1t2N9tFHu0t7uux9uHoV0dX_xNVPtElyf8eZ9w6drqWtTKXq7OrTZf1xfL1TvLxC-Inpod</recordid><startdate>201409</startdate><enddate>201409</enddate><creator>Jaehn, Florian</creator><creator>Kovalev, Sergey</creator><creator>Kovalyov, Mikhail Y.</creator><creator>Pesch, Erwin</creator><general>Blackwell Publishing Ltd</general><general>Wiley Subscription Services, Inc</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>7TN</scope><scope>8FD</scope><scope>F1W</scope><scope>FR3</scope><scope>H96</scope><scope>JQ2</scope><scope>KR7</scope><scope>L.G</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201409</creationdate><title>Multiproduct batching and scheduling with buffered rework: The case of a car paint shop</title><author>Jaehn, Florian ; Kovalev, Sergey ; Kovalyov, Mikhail Y. ; Pesch, Erwin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c5256-1e4df843f0f5907174dede01bfc247df25d81fcba49da2efc9645e6831f9da383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>batching</topic><topic>Buffers</topic><topic>car painting</topic><topic>Due dates</topic><topic>Group technology</topic><topic>Lateness</topic><topic>Logistics</topic><topic>Naval</topic><topic>production</topic><topic>rework</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jaehn, Florian</creatorcontrib><creatorcontrib>Kovalev, Sergey</creatorcontrib><creatorcontrib>Kovalyov, Mikhail Y.</creatorcontrib><creatorcontrib>Pesch, Erwin</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Oceanic Abstracts</collection><collection>Technology Research Database</collection><collection>ASFA: Aquatic Sciences and Fisheries Abstracts</collection><collection>Engineering Research Database</collection><collection>Aquatic Science & Fisheries Abstracts (ASFA) 2: Ocean Technology, Policy & Non-Living Resources</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Aquatic Science & Fisheries Abstracts (ASFA) Professional</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>Naval research logistics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jaehn, Florian</au><au>Kovalev, Sergey</au><au>Kovalyov, Mikhail Y.</au><au>Pesch, Erwin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiproduct batching and scheduling with buffered rework: The case of a car paint shop</atitle><jtitle>Naval research logistics</jtitle><addtitle>Naval Research Logistics</addtitle><date>2014-09</date><risdate>2014</risdate><volume>61</volume><issue>6</issue><spage>458</spage><epage>471</epage><pages>458-471</pages><issn>0894-069X</issn><eissn>1520-6750</eissn><coden>NRLOEP</coden><abstract>We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014</abstract><cop>New York</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1002/nav.21596</doi><tpages>14</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0894-069X |
ispartof | Naval research logistics, 2014-09, Vol.61 (6), p.458-471 |
issn | 0894-069X 1520-6750 |
language | eng |
recordid | cdi_proquest_miscellaneous_1642330327 |
source | EBSCOhost Business Source Complete; Access via Wiley Online Library |
subjects | batching Buffers car painting Due dates Group technology Lateness Logistics Naval production rework Scheduling |
title | Multiproduct batching and scheduling with buffered rework: The case of a car paint shop |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T21%3A32%3A53IST&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=Multiproduct%20batching%20and%20scheduling%20with%20buffered%20rework:%20The%20case%20of%20a%20car%20paint%20shop&rft.jtitle=Naval%20research%20logistics&rft.au=Jaehn,%20Florian&rft.date=2014-09&rft.volume=61&rft.issue=6&rft.spage=458&rft.epage=471&rft.pages=458-471&rft.issn=0894-069X&rft.eissn=1520-6750&rft.coden=NRLOEP&rft_id=info:doi/10.1002/nav.21596&rft_dat=%3Cproquest_cross%3E3398322641%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=1552398631&rft_id=info:pmid/&rfr_iscdi=true |