A Single-Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs

We consider a single-machine scheduling problem with an outsourcing option in an environment where the processing time and outsourcing cost are uncertain. The performance measure is the total cost of processing some jobs in-house and outsourcing the rest. The cost of processing in-house jobs is meas...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2017-01, Vol.2017 (2017), p.1-8
Main Authors: Park, Myoung-Ju, Choi, Byung-Cheon
Format: Article
Language:English
Subjects:
Completion time
Cost analysis
Costs
Deviation
Job shops
Operating costs
Optimization
Outsourcing
Production scheduling
Scheduling
Time measurement
Uncertainty
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c393t-c8ef914d05240dc5f2e26900d54e3fd1faec5aaf66e898ef01717f9ff991578d3
cites cdi_FETCH-LOGICAL-c393t-c8ef914d05240dc5f2e26900d54e3fd1faec5aaf66e898ef01717f9ff991578d3
container_end_page 8
container_issue 2017
container_start_page 1
container_title Mathematical problems in engineering
container_volume 2017
creator Park, Myoung-Ju
Choi, Byung-Cheon
description We consider a single-machine scheduling problem with an outsourcing option in an environment where the processing time and outsourcing cost are uncertain. The performance measure is the total cost of processing some jobs in-house and outsourcing the rest. The cost of processing in-house jobs is measured as the total weighted completion time, which can be considered the operating cost. The uncertainty is described through either an interval or a discrete scenario. The objective is to minimize the maximum deviation from the optimal cost of each scenario. Since the deterministic version is known to be NP-hard, we focus on two special cases, one in which all jobs have identical weights and the other in which all jobs have identical processing times. We analyze the computational complexity of each case and present the conditions that make them polynomially solvable.
doi_str_mv 10.1155/2017/5791796
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1904220138</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4321056041</sourcerecordid><originalsourceid>FETCH-LOGICAL-c393t-c8ef914d05240dc5f2e26900d54e3fd1faec5aaf66e898ef01717f9ff991578d3</originalsourceid><addsrcrecordid>eNqF0M9LwzAUB_AgCs7pzbMUvAhal5c2bXMcw18wmbANPBli-uIyunY2LWP_vSkdCF48Jbx8CN_3JeQS6D0A5yNGIR3xVEAqkiMyAJ5EIYc4PfZ3yuIQWPR-Ss6cW1PKgEM2IB_jYG7LrwLDV6VXtsRgrleYt4UfBm919VngJtjZZhUsS411o2zZ7ANbdm8anevYwm7QBarMg1nbuKqtdTedVK5x5-TEqMLhxeEckuXjw2LyHE5nTy-T8TTUkYiaUGdoBMQ55SymueaGIUsEpTmPMTI5GIWaK2WSBDPhrd8TUiOMEQJ4muXRkNz0_27r6rtF18iNdRqLQpVYtU6CoDHz9USZp9d_6NpHLn06CZkvjjKWcK_ueqXryrkajdzWdqPqvQQqu7JlV7Y8lO35bc99hbna2f_0Va_RGzTqV_ucqUijH8f2iGk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1879602265</pqid></control><display><type>article</type><title>A Single-Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs</title><source>Publicly Available Content (ProQuest)</source><source>Wiley Open Access</source><creator>Park, Myoung-Ju ; Choi, Byung-Cheon</creator><contributor>Arik, Sabri</contributor><creatorcontrib>Park, Myoung-Ju ; Choi, Byung-Cheon ; Arik, Sabri</creatorcontrib><description>We consider a single-machine scheduling problem with an outsourcing option in an environment where the processing time and outsourcing cost are uncertain. The performance measure is the total cost of processing some jobs in-house and outsourcing the rest. The cost of processing in-house jobs is measured as the total weighted completion time, which can be considered the operating cost. The uncertainty is described through either an interval or a discrete scenario. The objective is to minimize the maximum deviation from the optimal cost of each scenario. Since the deterministic version is known to be NP-hard, we focus on two special cases, one in which all jobs have identical weights and the other in which all jobs have identical processing times. We analyze the computational complexity of each case and present the conditions that make them polynomially solvable.</description><identifier>ISSN: 1024-123X</identifier><identifier>EISSN: 1563-5147</identifier><identifier>DOI: 10.1155/2017/5791796</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Publishing Corporation</publisher><subject>Completion time ; Cost analysis ; Costs ; Deviation ; Job shops ; Operating costs ; Optimization ; Outsourcing ; Production scheduling ; Scheduling ; Time measurement ; Uncertainty</subject><ispartof>Mathematical problems in engineering, 2017-01, Vol.2017 (2017), p.1-8</ispartof><rights>Copyright © 2017 Myoung-Ju Park and Byung-Cheon Choi.</rights><rights>Copyright © 2017 Myoung-Ju Park and Byung-Cheon Choi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c393t-c8ef914d05240dc5f2e26900d54e3fd1faec5aaf66e898ef01717f9ff991578d3</citedby><cites>FETCH-LOGICAL-c393t-c8ef914d05240dc5f2e26900d54e3fd1faec5aaf66e898ef01717f9ff991578d3</cites><orcidid>0000-0002-0663-3445 ; 0000-0002-7479-6473</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1879602265/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1879602265?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,777,781,25734,27905,27906,36993,36994,44571,74875</link.rule.ids></links><search><contributor>Arik, Sabri</contributor><creatorcontrib>Park, Myoung-Ju</creatorcontrib><creatorcontrib>Choi, Byung-Cheon</creatorcontrib><title>A Single-Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs</title><title>Mathematical problems in engineering</title><description>We consider a single-machine scheduling problem with an outsourcing option in an environment where the processing time and outsourcing cost are uncertain. The performance measure is the total cost of processing some jobs in-house and outsourcing the rest. The cost of processing in-house jobs is measured as the total weighted completion time, which can be considered the operating cost. The uncertainty is described through either an interval or a discrete scenario. The objective is to minimize the maximum deviation from the optimal cost of each scenario. Since the deterministic version is known to be NP-hard, we focus on two special cases, one in which all jobs have identical weights and the other in which all jobs have identical processing times. We analyze the computational complexity of each case and present the conditions that make them polynomially solvable.</description><subject>Completion time</subject><subject>Cost analysis</subject><subject>Costs</subject><subject>Deviation</subject><subject>Job shops</subject><subject>Operating costs</subject><subject>Optimization</subject><subject>Outsourcing</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>Time measurement</subject><subject>Uncertainty</subject><issn>1024-123X</issn><issn>1563-5147</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqF0M9LwzAUB_AgCs7pzbMUvAhal5c2bXMcw18wmbANPBli-uIyunY2LWP_vSkdCF48Jbx8CN_3JeQS6D0A5yNGIR3xVEAqkiMyAJ5EIYc4PfZ3yuIQWPR-Ss6cW1PKgEM2IB_jYG7LrwLDV6VXtsRgrleYt4UfBm919VngJtjZZhUsS411o2zZ7ANbdm8anevYwm7QBarMg1nbuKqtdTedVK5x5-TEqMLhxeEckuXjw2LyHE5nTy-T8TTUkYiaUGdoBMQ55SymueaGIUsEpTmPMTI5GIWaK2WSBDPhrd8TUiOMEQJ4muXRkNz0_27r6rtF18iNdRqLQpVYtU6CoDHz9USZp9d_6NpHLn06CZkvjjKWcK_ueqXryrkajdzWdqPqvQQqu7JlV7Y8lO35bc99hbna2f_0Va_RGzTqV_ucqUijH8f2iGk</recordid><startdate>20170101</startdate><enddate>20170101</enddate><creator>Park, Myoung-Ju</creator><creator>Choi, Byung-Cheon</creator><general>Hindawi Publishing Corporation</general><general>Hindawi</general><general>Hindawi Limited</general><scope>ADJCN</scope><scope>AHFXO</scope><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CWDGH</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><orcidid>https://orcid.org/0000-0002-0663-3445</orcidid><orcidid>https://orcid.org/0000-0002-7479-6473</orcidid></search><sort><creationdate>20170101</creationdate><title>A Single-Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs</title><author>Park, Myoung-Ju ; Choi, Byung-Cheon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c393t-c8ef914d05240dc5f2e26900d54e3fd1faec5aaf66e898ef01717f9ff991578d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Completion time</topic><topic>Cost analysis</topic><topic>Costs</topic><topic>Deviation</topic><topic>Job shops</topic><topic>Operating costs</topic><topic>Optimization</topic><topic>Outsourcing</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>Time measurement</topic><topic>Uncertainty</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Park, Myoung-Ju</creatorcontrib><creatorcontrib>Choi, Byung-Cheon</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Databases</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Middle East &amp; Africa Database</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Mathematical problems in engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Park, Myoung-Ju</au><au>Choi, Byung-Cheon</au><au>Arik, Sabri</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Single-Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs</atitle><jtitle>Mathematical problems in engineering</jtitle><date>2017-01-01</date><risdate>2017</risdate><volume>2017</volume><issue>2017</issue><spage>1</spage><epage>8</epage><pages>1-8</pages><issn>1024-123X</issn><eissn>1563-5147</eissn><abstract>We consider a single-machine scheduling problem with an outsourcing option in an environment where the processing time and outsourcing cost are uncertain. The performance measure is the total cost of processing some jobs in-house and outsourcing the rest. The cost of processing in-house jobs is measured as the total weighted completion time, which can be considered the operating cost. The uncertainty is described through either an interval or a discrete scenario. The objective is to minimize the maximum deviation from the optimal cost of each scenario. Since the deterministic version is known to be NP-hard, we focus on two special cases, one in which all jobs have identical weights and the other in which all jobs have identical processing times. We analyze the computational complexity of each case and present the conditions that make them polynomially solvable.</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Publishing Corporation</pub><doi>10.1155/2017/5791796</doi><tpages>8</tpages><orcidid>https://orcid.org/0000-0002-0663-3445</orcidid><orcidid>https://orcid.org/0000-0002-7479-6473</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1024-123X
ispartof Mathematical problems in engineering, 2017-01, Vol.2017 (2017), p.1-8
issn 1024-123X
1563-5147
language eng
recordid cdi_proquest_miscellaneous_1904220138
source Publicly Available Content (ProQuest); Wiley Open Access
subjects Completion time
Cost analysis
Costs
Deviation
Job shops
Operating costs
Optimization
Outsourcing
Production scheduling
Scheduling
Time measurement
Uncertainty
title A Single-Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T00%3A22%3A44IST&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=A%20Single-Machine%20Scheduling%20Problem%20with%20Uncertainty%20in%20Processing%20Times%20and%20Outsourcing%20Costs&rft.jtitle=Mathematical%20problems%20in%20engineering&rft.au=Park,%20Myoung-Ju&rft.date=2017-01-01&rft.volume=2017&rft.issue=2017&rft.spage=1&rft.epage=8&rft.pages=1-8&rft.issn=1024-123X&rft.eissn=1563-5147&rft_id=info:doi/10.1155/2017/5791796&rft_dat=%3Cproquest_cross%3E4321056041%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c393t-c8ef914d05240dc5f2e26900d54e3fd1faec5aaf66e898ef01717f9ff991578d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1879602265&rft_id=info:pmid/&rfr_iscdi=true