Integrated pricing and production scheduling of multiple customized products with a common base product

Make-To-Order (MTO) is a popular production strategy commonly used by manufacturers selling customized products. Dynamic pricing is a popular tactical tool commonly used by sellers to match supply with demand when there is a limited capacity and high demand uncertainty over time. In this article, we...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IISE transactions Jg. 51; H. 12; S. 1383 - 1401
Hauptverfasser: Yue, Qing, Chen, Zhi-Long, Wan, Guohua
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis 02.12.2019
Schlagworte:
dynamic pricing
dynamic programming
fully polynomial time approximation scheme
make-to-order
Production scheduling
ISSN:2472-5854, 2472-5862
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Make-To-Order (MTO) is a popular production strategy commonly used by manufacturers selling customized products. Dynamic pricing is a popular tactical tool commonly used by sellers to match supply with demand when there is a limited capacity and high demand uncertainty over time. In this article, we consider joint pricing and production scheduling decisions faced by a manufacturer that uses an MTO strategy to sell a number of customized products made from a common base product. At the beginning of each period in a planning horizon, the manufacturer sets the price of the base product, which in turn sets the prices for the customized products accordingly. Given the prices, orders for the products arrive. In each period, together with the pricing decision, the manufacturer needs to make a production scheduling decision for processing accepted orders on a single production line. The manufacturer's objective is to maximize the total revenue of the processed orders minus a scheduling penalty over the planning horizon. Three specific problems with different order acceptance rules and objective functions are studied. In the first problem, the manufacturer has to accept all the incoming orders and treats the total weighted completion time of the orders as a part of the objective function. In the second problem, the manufacturer has to accept all incoming orders, but is allowed to complete some orders after their due dates with tardiness penalties. In the third problem, the manufacturer may reject some incoming orders, but must complete all the accepted orders by their due dates. We show that all these problems are NP-hard, propose optimal pseudo-polynomial-time dynamic programming algorithms and fully-polynomial-time approximation schemes for solving these problems, and conduct computational experiments to show the performance of the proposed algorithms. Furthermore, we derive several managerial insights through computational experiments.
AbstractList Make-To-Order (MTO) is a popular production strategy commonly used by manufacturers selling customized products. Dynamic pricing is a popular tactical tool commonly used by sellers to match supply with demand when there is a limited capacity and high demand uncertainty over time. In this article, we consider joint pricing and production scheduling decisions faced by a manufacturer that uses an MTO strategy to sell a number of customized products made from a common base product. At the beginning of each period in a planning horizon, the manufacturer sets the price of the base product, which in turn sets the prices for the customized products accordingly. Given the prices, orders for the products arrive. In each period, together with the pricing decision, the manufacturer needs to make a production scheduling decision for processing accepted orders on a single production line. The manufacturer's objective is to maximize the total revenue of the processed orders minus a scheduling penalty over the planning horizon. Three specific problems with different order acceptance rules and objective functions are studied. In the first problem, the manufacturer has to accept all the incoming orders and treats the total weighted completion time of the orders as a part of the objective function. In the second problem, the manufacturer has to accept all incoming orders, but is allowed to complete some orders after their due dates with tardiness penalties. In the third problem, the manufacturer may reject some incoming orders, but must complete all the accepted orders by their due dates. We show that all these problems are NP-hard, propose optimal pseudo-polynomial-time dynamic programming algorithms and fully-polynomial-time approximation schemes for solving these problems, and conduct computational experiments to show the performance of the proposed algorithms. Furthermore, we derive several managerial insights through computational experiments.
Author Yue, Qing
Wan, Guohua
Chen, Zhi-Long
Author_xml – sequence: 1
  givenname: Qing
  surname: Yue
  fullname: Yue, Qing
  organization: Management School, Shanghai University of International Business and Economics
– sequence: 2
  givenname: Zhi-Long
  orcidid: 0000-0002-9960-0465
  surname: Chen
  fullname: Chen, Zhi-Long
  email: zchen@rhsmith.umd.edu, ghwan@sjtu.edu.cn
  organization: Robert H. Smith School of Business, University of Maryland, College Park
– sequence: 3
  givenname: Guohua
  orcidid: 0000-0002-9298-1023
  surname: Wan
  fullname: Wan, Guohua
  organization: Antai College of Economics and Management, Shanghai Jiao Tong University
BookMark eNqFkM1qwzAQhEVJoWmaRyjoBZxKtqTY9NIS-geBXtqzWcvrRMWWgiQT0qdvTH4OPbSnHXb2G9i5JiPrLBJyy9mMs5zdpWKeylyKWcp4MeMyL5QsLsh42CcyV-norKW4ItMQvhhjfC4lU8WYrN5sxJWHiDXdeKONXVGwg3Z1r6Nxlga9xrpvB8c1tOvbaDYtUt2H6DrzjefjQLcmrilQ7bpuD1YQ8OTdkMsG2oDT45yQz-enj8Vrsnx_eVs8LhOdZXlMatYohogpCKwEqwGYgIrlmURWCCGx4EqlqkGmJQAHEDzNK9RqnmaVkDKbEHnI1d6F4LEp91914HclZ-VQWHkqrBwKK4-F7bn7X5w2EYb_owfT_ks_HGhjG-c72Drf1mWEXet848FqE8rs74gfHHSIyQ
CitedBy_id crossref_primary_10_1080_23302674_2024_2443148
crossref_primary_10_1016_j_ijpe_2019_07_021
crossref_primary_10_1016_j_cor_2025_107028
crossref_primary_10_1111_deci_12441
crossref_primary_10_1016_j_orl_2020_06_006
Cites_doi 10.1287/opre.1090.0731
10.1016/S0377-2217(98)00101-5
10.1007/s11134-012-9288-8
10.1007/s11134-011-9214-5
10.1287/mnsc.49.10.1287.17315
10.1007/b139000
10.1016/j.ejor.2004.02.011
10.1093/oxepap/os-2.1.12
10.1016/j.cor.2004.04.005
10.1016/j.ejor.2004.02.015
10.1080/00207543.2013.864053
10.1111/poms.12295
10.1287/mnsc.46.12.1602.12073
10.1287/opre.1030.0089
10.1287/opre.1120.1117
10.1287/opre.1110.0969
10.1016/j.ejor.2004.12.015
10.1287/msom.2013.0449
10.1287/opre.1080.0608
10.1057/palgrave.jors.2602425
10.1287/mnsc.1050.0491
10.1007/978-3-540-24777-7
10.1287/mnsc.44.3.285
10.1287/mnsc.1070.0836
10.1080/0740817X.2012.748993
10.1080/07408170701245346
10.1287/opre.1060.0305
10.1287/opre.1070.0411
10.1287/mnsc.46.9.1249.12238
10.1080/0740817X.2014.916459
10.1016/j.ejor.2012.03.020
10.1287/msom.1080.0251
10.1016/S0272-6963(02)00010-4
10.1016/j.ejor.2004.07.062
10.1080/0740817X.2011.649389
10.1002/nav.3800030106
ContentType Journal Article
Copyright 2019 "IISE" 2019
Copyright_xml – notice: 2019 "IISE" 2019
DBID AAYXX
CITATION
DOI 10.1080/24725854.2019.1589659
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2472-5862
EndPage 1401
ExternalDocumentID 10_1080_24725854_2019_1589659
1589659
Genre Article
GrantInformation_xml – fundername: Program of Shanghai Subject Chief Scientist
  grantid: 16XD1401700
– fundername: National Natural Science Foundation of China
  grantid: 71125003; 71421002
GroupedDBID 0R~
30N
AAGDL
AAHIA
AAJMT
AAPUL
AAQRR
ABDBF
ABJNI
ABPAQ
ABXUL
ABXYU
ACGFS
ACIWK
ACTIO
ACUHS
ADGTB
ADMLS
AEISY
AEMOZ
AEOZL
AEPSL
AEYOC
AFRVT
AGDLA
AHQJS
AIJEM
AIYEW
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AWYRJ
BLEHA
CCCUG
DGEBU
DKSSO
EAP
EAS
EBR
EBS
EBU
EJD
EMK
EPL
EST
ESX
GEVLZ
H13
I-F
IPNFZ
KYCEM
LJTGL
M4Z
MK~
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
SNACF
TDBHL
TEN
TFL
TFT
TFW
TH9
TTHFI
TUROJ
TUS
UT3
ZGOLN
AAYXX
CITATION
ID FETCH-LOGICAL-c338t-d0f60eee2a4eb40daa04ab0835e09445e916626fe0c5aa1aa4128bec6723b4553
IEDL.DBID TFW
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000469700600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2472-5854
IngestDate Sat Nov 29 06:20:26 EST 2025
Tue Nov 18 22:37:45 EST 2025
Mon Oct 20 23:48:51 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 12
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c338t-d0f60eee2a4eb40daa04ab0835e09445e916626fe0c5aa1aa4128bec6723b4553
ORCID 0000-0002-9298-1023
0000-0002-9960-0465
PageCount 19
ParticipantIDs informaworld_taylorfrancis_310_1080_24725854_2019_1589659
crossref_citationtrail_10_1080_24725854_2019_1589659
crossref_primary_10_1080_24725854_2019_1589659
PublicationCentury 2000
PublicationDate 2019-12-02
PublicationDateYYYYMMDD 2019-12-02
PublicationDate_xml – month: 12
  year: 2019
  text: 2019-12-02
  day: 02
PublicationDecade 2010
PublicationTitle IISE transactions
PublicationYear 2019
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0034
CIT0011
CIT0033
Simchi-Levi D. (CIT0038) 2008
Vazirani V.V (CIT0044) 2001
Yahalom T. (CIT0045) 2006
CIT0014
CIT0013
Cui T. (CIT0017) 2009
CIT0035
CIT0016
CIT0015
CIT0037
CIT0018
CIT0039
Pinedo M.L (CIT0036) 2002
CIT0019
Anderson E. (CIT0005) 2003; 81
CIT0041
CIT0040
CIT0043
CIT0020
CIT0042
CIT0001
CIT0023
CIT0022
Afèche P. (CIT0002) 2011
Eliashberg J. (CIT0021) 1993
Garey M.R. (CIT0024) 1979
CIT0003
CIT0025
CIT0027
CIT0004
CIT0026
Yano C.A. (CIT0046) 2004
CIT0007
CIT0029
CIT0006
CIT0028
CIT0009
CIT0008
References_xml – ident: CIT0010
  doi: 10.1287/opre.1090.0731
– ident: CIT0020
  doi: 10.1016/S0377-2217(98)00101-5
– ident: CIT0008
  doi: 10.1007/s11134-012-9288-8
– volume-title: Approximation Algorithms
  year: 2001
  ident: CIT0044
– ident: CIT0016
  doi: 10.1007/s11134-011-9214-5
– volume-title: Designing & Managing the Supply Chain: Concepts, Strategies and Case Studies
  year: 2008
  ident: CIT0038
– ident: CIT0022
  doi: 10.1287/mnsc.49.10.1287.17315
– ident: CIT0041
  doi: 10.1007/b139000
– ident: CIT0042
  doi: 10.1016/j.ejor.2004.02.011
– ident: CIT0026
  doi: 10.1093/oxepap/os-2.1.12
– start-page: 65
  year: 2004
  ident: CIT0046
  publication-title: Kluwer, Norwell, MA
– ident: CIT0012
  doi: 10.1016/j.cor.2004.04.005
– ident: CIT0006
  doi: 10.1016/j.ejor.2004.02.015
– ident: CIT0029
  doi: 10.1080/00207543.2013.864053
– ident: CIT0013
  doi: 10.1111/poms.12295
– ident: CIT0025
  doi: 10.1287/mnsc.46.12.1602.12073
– ident: CIT0037
  doi: 10.1287/opre.1030.0089
– ident: CIT0004
  doi: 10.1287/opre.1120.1117
– volume: 81
  start-page: 96
  issue: 9
  year: 2003
  ident: CIT0005
  publication-title: Harvard Business Review
– ident: CIT0023
  doi: 10.1287/opre.1110.0969
– volume-title: Optimal price-lead time menus for queues with customer choice: Priorities, pooling and strategic delay. Working paper
  year: 2011
  ident: CIT0002
– ident: CIT0034
  doi: 10.1016/j.ejor.2004.12.015
– ident: CIT0001
  doi: 10.1287/msom.2013.0449
– volume-title: Scheduling: Theory, Algorithms, and Systems
  year: 2002
  ident: CIT0036
– ident: CIT0007
  doi: 10.1287/opre.1080.0608
– ident: CIT0018
  doi: 10.1057/palgrave.jors.2602425
– ident: CIT0019
  doi: 10.1287/mnsc.1050.0491
– ident: CIT0028
  doi: 10.1007/978-3-540-24777-7
– ident: CIT0039
  doi: 10.1287/mnsc.44.3.285
– ident: CIT0009
  doi: 10.1287/mnsc.1070.0836
– ident: CIT0032
  doi: 10.1080/0740817X.2012.748993
– ident: CIT0035
  doi: 10.1080/07408170701245346
– start-page: 827
  volume-title: Handbooks in Operations Research and Management Science: Marketing
  year: 1993
  ident: CIT0021
– ident: CIT0033
  doi: 10.1287/opre.1060.0305
– ident: CIT0003
  doi: 10.1287/opre.1070.0411
– ident: CIT0043
  doi: 10.1287/mnsc.46.9.1249.12238
– volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman
  year: 1979
  ident: CIT0024
– ident: CIT0014
  doi: 10.1080/0740817X.2014.916459
– volume-title: Optimal pricing, scheduling, and admission control for queueing systems under information asymmetry. Working paper
  year: 2009
  ident: CIT0017
– ident: CIT0030
  doi: 10.1016/j.ejor.2012.03.020
– volume-title: Designing and pricing incentive compatible grades of service in queuing systems. Working paper
  year: 2006
  ident: CIT0045
– ident: CIT0015
  doi: 10.1287/msom.1080.0251
– ident: CIT0027
  doi: 10.1016/S0272-6963(02)00010-4
– ident: CIT0011
  doi: 10.1016/j.ejor.2004.07.062
– ident: CIT0031
  doi: 10.1080/0740817X.2011.649389
– ident: CIT0040
  doi: 10.1002/nav.3800030106
SSID ssj0001755069
Score 2.2837322
Snippet Make-To-Order (MTO) is a popular production strategy commonly used by manufacturers selling customized products. Dynamic pricing is a popular tactical tool...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 1383
SubjectTerms dynamic pricing
dynamic programming
fully polynomial time approximation scheme
make-to-order
Production scheduling
Title Integrated pricing and production scheduling of multiple customized products with a common base product
URI https://www.tandfonline.com/doi/abs/10.1080/24725854.2019.1589659
Volume 51
WOSCitedRecordID wos000469700600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 2472-5862
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001755069
  issn: 2472-5854
  databaseCode: TFW
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0R5yQOrSx5OHI8IUYGEKoYiukXnV1UJ2qpNGfj1nPMo7QAMMEbJl1jni-_h83eEXHFwQqZZzDIJwFBDUgaCpyyWKVeBEsaokjL_UfR62WAgn-pqwnldVuljaFcRRZRrtf-5Qc2birjriIsIvVyfEQllJ0wyT4qHqzB69r6or999-cqyCPTAy752HsQ8qjnG892L1gzUGn3piuHp7v7DkPfITu110ptKTfbJhh0fkO0VLsJDMnxoiCMMnc78fvuQ4ufotKKExemjGAijYfLn1-nE0aYUkeoFOpBvow-7fHhOfXqXAsVBoppTbyqbe0fkuXvXv71ndRcGpjF8LZgJXBpYayPgVvHAAAQclPfcLIaGPLHoYGJU5GygE4AQgKPJQ81IRRQrniTxMWmNJ2N7QqhxEJgslUIry12GyEQqk2kQEdrqULcJb0Sf65qi3HfKeM3Dmsm0kWPu5ZjXcmyTzhI2rTg6fgPI1XnNizI54qpOJnn8I_b0D9gzsuUvy2qY6Jy0itnCXpBN_V6M5rPLUnM_AVXr63w
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8JAEJ4omqgH30Z87sFrsY9ttz0aI4GInDBya3a3W0KiQKB48Nc70wfCQT3oefu1m9lp59GZbwBuuExFFISeFUZSWqghgSUFDywvCriylUgSlVPmd0S3G_b70XIvDJVVUgydFkQR-beaXm5KRlclcbcuFy66uZQScaKG44fEircOGzSdjgKwXvPlK88i0AfPJ9sRyiJY1cjz3Z1WTNQKgemS6Wnu_cem92G3dDzZXaEpB7BmRoews0RHeASDdsUdkbDJlH65Dxg-j00KVlg8QYaxMNomamFn45RV1YhMz9GHfBt-mMXFM0YZXiYZ7hI1nZG1rNaO4bn50LtvWeUgBktjBJtZiZ0GtjHGldwobidS2lwqct4MRofcN-hjYmCUGlv7UjpScrR6qByBcD3Ffd87gdpoPDKnwJJU2kkYREIrw9MQkX6kklBL4aK5dnQdeCX7WJcs5TQs4zV2SjLTSo4xyTEu5ViHxgI2KWg6fgNEywcbZ3l-JC2GmcTej9izP2CvYavVe-rEnXb38Ry2aSkvjnEvoJZN5-YSNvV7NpxNr3I1_gQyHO-f
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagIAQDb0R5emB1ycOJ4xEBERVV1aGIbpEd26gStFGbMvDrOedR2gEYYHa-xLIvue8u5-8QuqLCMB5GPom4EAQsJCSC0ZD4PKTSkUwpWUjmd1i3Gw0GvFdVE06rskobQ5tSKKL4VtuXO1Omroi79ijzgOXajIjLW24QWVG8VbQG1Dmwht2Pn7_SLAwoeNHYzqKIhdXneL6705KHWtIvXfA88c4_zHkXbVe0E9-UdrKHVvRoH20tiBEeoJd2rRyhcDaxP9xfMDwOZ6UmLOwfhkgYPJM9wI7HBte1iDidAYN8G37o-cVTbPO7WGCYJNg5tr6yHjtET_F9__aBVG0YSArxa06UY0JHa-0JqiV1lBAOFdJSNw2xIQ00MEwIi4x20kAIVwgKPg9MI2SeL2kQ-EeoMRqP9DHCyghHRSFnqdTURIAMuFRRKpgHztpNm4jWS5-klUa5bZXxmriVlGm9joldx6RaxyZqzWFZKdLxG4Av7muSF9kRU7YySfwfsSd_wF6ijd5dnHTa3cdTtGlHisoY7ww18slMn6P19D0fTicXhRF_AmtQ7lE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Integrated+pricing+and+production+scheduling+of+multiple+customized+products+with+a+common+base+product&rft.jtitle=IISE+transactions&rft.au=Yue%2C+Qing&rft.au=Chen%2C+Zhi-Long&rft.au=Wan%2C+Guohua&rft.date=2019-12-02&rft.pub=Taylor+%26+Francis&rft.issn=2472-5854&rft.eissn=2472-5862&rft.volume=51&rft.issue=12&rft.spage=1383&rft.epage=1401&rft_id=info:doi/10.1080%2F24725854.2019.1589659&rft.externalDocID=1589659
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2472-5854&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2472-5854&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2472-5854&client=summon