Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode

When a make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the shipping cost. Without loss of generality, we consider that transportation is done by a third-party logistics company, such as FedEx or UPS, wh...

Full description

Saved in:
Bibliographic Details
Published in:Manufacturing & service operations management Vol. 9; no. 2; pp. 206 - 224
Main Authors: Stecke, Kathryn E, Zhao, Xuying
Format: Journal Article
Language:English
Published: Linthicum INFORMS 01.04.2007
Institute for Operations Research and the Management Sciences
Series:Manufacturing & Service Operations Management
Subjects:
ISSN:1523-4614, 1526-5498
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract When a make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the shipping cost. Without loss of generality, we consider that transportation is done by a third-party logistics company, such as FedEx or UPS, which provides multiple shipping modes such as overnight, one-day, two-day delivery, and more. When the transportation time has to be short, clearly, shipping cost is more expensive than it could have been. How should a company schedule production for accepted orders so that the company can leave enough transportation time for orders to take slow shipping modes to reduce the shipping cost? We study this problem of integrating the production and transportation functions for a manufacturing company producing a variety of customized products in a make-to-order environment with a commit-to-delivery mode of business. Various realistic scenarios are investigated in increasing order of complexity. When partial delivery is allowed by customers, we provide both a mixed-integer programming (MIP) model and a minimum cost flow model. We show that nonpreemptive earliest due date (NEDD) production schedules are optimal when partial delivery is allowed and shipping cost is a decreasing convex function with transportation time. When partial delivery is not allowed, we develop an MIP model and prove that the problem is NP-hard. An efficient heuristic algorithm with polynomial computation time is provided for the NP-hard problem. It gives near-optimal production schedules, as shown via thousands of numerical experiments. We also provide models and analysis for other scenarios where shipping cost accounts for customer locations and quantity discounts.
AbstractList When a make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the shipping cost. Without loss of generality, we consider that transportation is done by a third-party logistics company, such as FedEx or UPS, which provides multiple shipping modes such as overnight, one-day, two-day delivery, and more. When the transportation time has to be short, clearly, shipping cost is more expensive than it could have been. How should a company schedule production for accepted orders so that the company can leave enough transportation time for orders to take slow shipping modes to reduce the shipping cost? We study this problem of integrating the production and transportation functions for a manufacturing company producing a variety of customized products in a make-to-order environment with a commit-to-delivery mode of business. Various realistic scenarios are investigated in increasing order of complexity. When partial delivery is allowed by customers, we provide both a mixed-integer programming (MIP) model and a minimum cost flow model. We show that nonpreemptive earliest due date (NEDD) production schedules are optimal when partial delivery is allowed and shipping cost is a decreasing convex function with transportation time. When partial delivery is not allowed, we develop an MIP model and prove that the problem is NP-hard. An efficient heuristic algorithm with polynomial computation time is provided for the NP-hard problem. It gives near-optimal production schedules, as shown via thousands of numerical experiments. We also provide models and analysis for other scenarios where shipping cost accounts for customer locations and quantity discounts.
When a make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the shipping cost. Without loss of generality, we consider that transportation is done by a third-party logistics company, such as FedEx or UPS, which provides multiple shipping modes such as overnight, one-day, two-day delivery, and more. When the transportation time has to be short, clearly, shipping cost is more expensive than it could have been. How should a company schedule production for accepted orders so that the company can leave enough transportation time for orders to take slow shipping modes to reduce the shipping cost? We study this problem of integrating the production and transportation functions for a manufacturing company producing a variety of customized products in a make-to-order environment with a commit-to-delivery mode of business. Various realistic scenarios are investigated in increasing order of complexity. When partial delivery is allowed by customers, we provide both a mixed-integer programming (MIP) model and a minimum cost flow model. We show that nonpreemptive earliest due date (NEDD) production schedules are optimal when partial delivery is allowed and shipping cost is a decreasing convex function with transportation time. When partial delivery is not allowed, we develop an MIP model and prove that the problem is NP-hard. An efficient heuristic algorithm with polynomial computation time is provided for the NP-hard problem. It gives near-optimal production schedules, as shown via thousands of numerical experiments. We also provide models and analysis for other scenarios where shipping cost accounts for customer locations and quantity discounts.
When a make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the shipping cost. Without loss of generality, we consider that transportation is done by a third-party logistics company, such as FedEx or UPS, which provides multiple shipping modes such as overnight, one-day, two-day delivery, and more. When the transportation time has to be short, clearly, shipping cost is more expensive than it could have been. How should a company schedule production for accepted orders so that the company can leave enough transportation time for orders to take slow shipping modes to reduce the shipping cost? We study this problem of integrating the production and transportation functions for a manufacturing company producing a variety of customized products in a make-to-order environment with a commit-to-delivery mode of business. Various realistic scenarios are investigated in increasing order of complexity. When partial delivery is allowed by customers, we provide both a mixed-integer programming (MIP) model and a minimum cost flow model. We show that nonpreemptive earliest due date (NEDD) production schedules are optimal when partial delivery is allowed and shipping cost is a decreasing convex function with transportation time. When partial delivery is not allowed, we develop an MIP model and prove that the problem is NP-hard. An efficient heuristic algorithm with polynomial computation time is provided for the NP-hard problem. It gives near-optimal production schedules, as shown via thousands of numerical experiments. We also provide models and analysis for other scenarios where shipping cost accounts for customer locations and quantity discounts. [PUBLICATION ABSTRACT]
When a make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the shipping cost. Without loss of generality, we consider that transportation is done by a third-party logistics company, such as FedEx or UPS, which provides multiple shipping modes such as overnight, one-day, two-day delivery, and more. When the transportation time has to be short, clearly, shipping cost is more expensive than it could have been. How should a company schedule production for accepted orders so that the company can leave enough transportation time for orders to take slow shipping modes to reduce the shipping cost? We study this problem of integrating the production and transportation functions for a manufacturing company producing a variety of customized products in a make-to-order environment with a commit-to-delivery mode of business. Various realistic scenarios are investigated in increasing order of complexity. When partial delivery is allowed by customers, we provide both a mixed-integer programming (MIP) model and a minimum cost flow model. We show that nonpreemptive earliest due date (NEDD) production schedules are optimal when partial delivery is allowed and shipping cost is a decreasing convex function with transportation time. When partial delivery is not allowed, we develop an MIP model and prove that the problem is NP-hard. An efficient heuristic algorithm with polynomial computation time is provided for the NP-hard problem. It gives near-optimal production schedules, as shown via thousands of numerical experiments. We also provide models and analysis for other scenarios where shipping cost accounts for customer locations and quantity discounts.
Audience Trade
Academic
Author Stecke, Kathryn E
Zhao, Xuying
Author_xml – sequence: 1
  fullname: Stecke, Kathryn E
– sequence: 2
  fullname: Zhao, Xuying
BackLink http://econpapers.repec.org/article/inmormsom/v_3a9_3ay_3a2007_3ai_3a2_3ap_3a206-224.htm$$DView record in RePEc
BookMark eNqFUk1v1DAQjVCRaBeunCPENYu_4iTHsnyt1KocytnyxnbWJbGD7bRa8eeZJBVIqAhZI8-M3psZP89Fdua801n2GqMtJnX1boh-2GLE0RZhWj_LznFJeFGypj5bfFowjtmL7CLGO4QQrhE5z35-DV5NbbLe5dKp_DZIF0cfklxSe5d0F1bf-JDL_Fp-10XyxU1QOkDkJiPbNAXrunznh1G6U_5g0xGgEA42zeAPurf3Opzy91O0TseYX3ulX2bPjeyjfvV4b7Jvnz7e7r4UVzef97vLq6ItUZUKhiQhnCjEK4oJNvhQtqXCvGTY1EwaxUgjDwQRVCuNDrLiipkDYpWsKdONppvszVp3DP7HpGMSd34KDloKghCnGEQDULGCOtlrYZ3xKci2004H2YPQxkL6EnNKqxqDwJts-wQejtKDbZ8k7FdC0KNuxRjsIMMJmIMP89eJe0FlA3YCg7kquOzsgo1LigtCmDim4U_zNvgYgza_y2Ek5mUQS8V5GcS8DEBgfxFau34xTG37f9MeRZnfB1P-v83bFX-03fHBhlWYmbgAG0FAcU5_AclO1yk
CitedBy_id crossref_primary_10_1016_j_asoc_2016_12_038
crossref_primary_10_1057_jors_2016_12
crossref_primary_10_1080_0305215X_2019_1613388
crossref_primary_10_1016_j_ejor_2024_02_005
crossref_primary_10_3390_sym11020160
crossref_primary_10_1080_13675567_2017_1353597
crossref_primary_10_1016_j_ejor_2015_06_004
crossref_primary_10_1016_j_ejor_2023_08_030
crossref_primary_10_1016_j_ijpe_2023_109126
crossref_primary_10_1016_j_orl_2009_11_007
crossref_primary_10_1287_msom_2020_0346
crossref_primary_10_1016_j_cie_2025_111086
crossref_primary_10_1080_00207543_2012_718452
crossref_primary_10_1080_23302674_2016_1157221
crossref_primary_10_3390_su151813731
crossref_primary_10_1002_nav_22037
crossref_primary_10_1016_j_ejor_2012_09_007
crossref_primary_10_1016_j_ejor_2022_07_030
crossref_primary_10_1080_24725854_2023_2272261
crossref_primary_10_1007_s10479_017_2498_z
crossref_primary_10_1016_j_ejor_2014_03_039
crossref_primary_10_1287_ijoc_2016_0726
crossref_primary_10_1007_s10479_012_1197_z
crossref_primary_10_1108_NBRI_02_2018_0018
crossref_primary_10_1111_j_1937_5956_2009_01029_x
crossref_primary_10_1016_j_ejor_2021_04_020
crossref_primary_10_1007_s12063_023_00364_1
crossref_primary_10_1016_j_cie_2019_106108
crossref_primary_10_1080_00207543_2019_1588480
crossref_primary_10_1109_TASE_2010_2059701
crossref_primary_10_1088_1757_899X_114_1_012079
crossref_primary_10_1016_j_trb_2011_02_005
crossref_primary_10_3390_su9112071
crossref_primary_10_1016_j_rcim_2021_102236
crossref_primary_10_1016_j_cor_2021_105477
crossref_primary_10_1016_j_ejor_2014_12_002
crossref_primary_10_1155_2018_3418580
crossref_primary_10_1287_ijoc_2018_0842
crossref_primary_10_1287_ijoc_2019_0935
crossref_primary_10_1080_17517575_2018_1428770
crossref_primary_10_1007_s10951_017_0540_2
crossref_primary_10_1007_s10951_017_0542_0
crossref_primary_10_1016_j_ifacol_2016_07_581
crossref_primary_10_1155_2015_804968
crossref_primary_10_1016_j_ijpe_2019_05_017
crossref_primary_10_1016_j_cie_2021_107486
crossref_primary_10_1016_j_orl_2012_11_002
crossref_primary_10_1080_00207543_2017_1355118
crossref_primary_10_1016_j_cie_2022_108698
crossref_primary_10_1016_j_ejor_2012_11_049
crossref_primary_10_1080_00207543_2017_1378955
crossref_primary_10_1016_j_ejor_2009_09_011
crossref_primary_10_1155_2022_3458116
crossref_primary_10_1186_1029_242X_2014_409
crossref_primary_10_3390_asi5040059
crossref_primary_10_1016_j_cirpj_2010_03_003
crossref_primary_10_1016_j_trb_2013_07_011
crossref_primary_10_1016_j_tre_2019_03_014
crossref_primary_10_1080_00207543_2013_774506
crossref_primary_10_1287_msom_1080_0251
crossref_primary_10_1016_j_tre_2015_04_002
crossref_primary_10_1016_j_tre_2018_04_002
crossref_primary_10_1016_j_cor_2018_07_026
crossref_primary_10_1016_j_epsr_2024_110629
crossref_primary_10_1016_j_cor_2013_01_011
crossref_primary_10_1016_j_ejor_2018_09_007
crossref_primary_10_1016_j_omega_2015_10_012
crossref_primary_10_1016_j_ejor_2020_03_033
crossref_primary_10_1016_j_swevo_2024_101498
crossref_primary_10_1057_jors_2012_184
crossref_primary_10_1016_j_ejor_2015_06_051
crossref_primary_10_1016_j_asoc_2016_01_052
crossref_primary_10_1016_j_ifacol_2015_06_302
crossref_primary_10_1080_00207543_2014_994075
crossref_primary_10_1080_00207543_2016_1213916
crossref_primary_10_1007_s11590_014_0755_5
crossref_primary_10_1287_opre_1080_0688
crossref_primary_10_1016_j_cie_2019_106050
crossref_primary_10_1016_j_omega_2012_09_004
crossref_primary_10_1016_j_ejor_2008_03_026
crossref_primary_10_2478_mspe_2024_0037
Cites_doi 10.1007/978-1-4020-7953-5_17
10.1016/0377-2217(96)00098-7
10.1287/trsc.33.3.330
10.1016/0377-2217(95)00133-6
10.1016/0377-2217(96)00127-0
10.1287/opre.51.4.566.16106
10.1287/mnsc.26.9.871
10.1287/opre.36.2.216
10.1287/opre.1060.0280
10.1002/nav.20100
10.1287/opre.49.6.854.10014
10.1287/opre.26.1.3
10.1287/opre.49.1.134.11192
10.1080/07408179908969907
10.1016/0377-2217(93)90058-U
10.1287/mnsc.1040.0325
10.1016/0377-2217(94)90419-7
10.1016/S0377-2217(03)00358-8
10.1287/opre.28.6.1436
10.1002/1099-1425(200101/02)4:1<3::AID-JOS57>3.0.CO;2-D
ContentType Journal Article
Copyright COPYRIGHT 2007 Institute for Operations Research and the Management Sciences
Copyright Institute for Operations Research and the Management Sciences Spring 2007
Copyright_xml – notice: COPYRIGHT 2007 Institute for Operations Research and the Management Sciences
– notice: Copyright Institute for Operations Research and the Management Sciences Spring 2007
DBID AAYXX
CITATION
DKI
X2L
3V.
7WY
7WZ
7XB
87Z
8AO
8FK
8FL
ABUWG
AFKRA
BENPR
BEZIV
CCPQU
DWQXO
FRNLG
F~G
K60
K6~
L.-
M0C
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQQKQ
PQUKI
PYYUZ
Q9U
DOI 10.1287/msom.1060.0138
DatabaseName CrossRef
RePEc IDEAS
RePEc
ProQuest Central (Corporate)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Global (Alumni Edition)
ProQuest Pharma Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
ProQuest Central
Business Premium Collection
ProQuest One Community College
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
ABI/INFORM Professional Advanced
ABI/INFORM Global
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ABI/INFORM Collection China
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Pharma Collection
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Central Korea
ProQuest Central (New)
ABI/INFORM Complete (Alumni Edition)
Business Premium Collection
ABI/INFORM Global
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest One Academic Eastern Edition
ABI/INFORM China
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
ProQuest One Academic (New)
DatabaseTitleList

CrossRef
ABI/INFORM Global (Corporate)

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Business
EISSN 1526-5498
EndPage 224
ExternalDocumentID 1266415781
A163378101
inmormsom_v_3a9_3ay_3a2007_3ai_3a2_3ap_3a206_224_htm
10_1287_msom_1060_0138
msom.1060.0138
msom_9_2_206
Genre Research Article
Feature
GeographicLocations United States
GeographicLocations_xml – name: United States
GroupedDBID 29M
3V.
4
4.4
5GY
7WY
8AO
8FL
8VB
AAPBV
ABUWG
ACNCT
AFFNX
AFKRA
AKVCP
ALMA_UNASSIGNED_HOLDINGS
BENPR
BEZIV
BPHCQ
CS3
DWQXO
EBA
EBO
EBR
EBS
EBU
EHE
EJD
EMK
EPL
FRNLG
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
IAO
IEA
IL9
IOF
ITC
K6
K60
M0C
MV1
N95
NIEAY
P2P
PQEST
PQQKQ
PQUKI
PRINS
PROAC
QWB
RPU
TH9
WH7
XI7
XXP
YNT
ZL0
.-4
18M
AADHG
AAYXX
AEGXH
AEMOZ
AFFHD
BAAKF
CCPQU
CITATION
K1G
K6~
PHGZM
PHGZT
PQBIZ
PQBZA
DKI
X2L
7XB
8FK
L.-
PKEHL
PUEGO
Q9U
ID FETCH-LOGICAL-c507t-40a2262d0673121f1b5c5d16541f84afd429ab20208de0ba76d4fb047a834e9e3
IEDL.DBID M0C
ISICitedReferencesCount 99
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000248659200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1523-4614
IngestDate Sat Aug 23 12:44:33 EDT 2025
Sat Nov 29 12:15:01 EST 2025
Tue Nov 04 18:40:41 EST 2025
Wed Aug 18 03:51:57 EDT 2021
Sat Nov 29 04:53:58 EST 2025
Tue Nov 18 22:10:55 EST 2025
Tue Jan 05 23:24:50 EST 2021
Fri Jan 15 03:35:06 EST 2021
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c507t-40a2262d0673121f1b5c5d16541f84afd429ab20208de0ba76d4fb047a834e9e3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 200631106
PQPubID 46391
PageCount 19
ParticipantIDs crossref_primary_10_1287_msom_1060_0138
informs_primary_10_1287_msom_1060_0138
crossref_citationtrail_10_1287_msom_1060_0138
proquest_journals_200631106
repec_primary_inmormsom_v_3a9_3ay_3a2007_3ai_3a2_3ap_3a206_224_htm
highwire_informs_msom_9_2_206
gale_infotracacademiconefile_A163378101
gale_infotracgeneralonefile_A163378101
ProviderPackageCode RPU
NIEAY
PublicationCentury 2000
PublicationDate 20070401
PublicationDateYYYYMMDD 2007-04-01
PublicationDate_xml – month: 04
  year: 2007
  text: 20070401
  day: 01
PublicationDecade 2000
PublicationPlace Linthicum
PublicationPlace_xml – name: Linthicum
PublicationSeriesTitle Manufacturing & Service Operations Management
PublicationTitle Manufacturing & service operations management
PublicationYear 2007
Publisher INFORMS
Institute for Operations Research and the Management Sciences
Publisher_xml – name: INFORMS
– name: Institute for Operations Research and the Management Sciences
References B20
B21
B22
B23
B24
B25
B10
B11
B12
B13
B14
B15
B16
B17
B18
B19
B1
B2
B3
B4
B5
B6
B7
B8
B9
Zhao X. (B25) 2005
Winston W. L. (B24) 1994
Ahuja R. K. (B1) 1993
Pinedo M. (B19) 2002
Geismar H. N. (B13) 2007
References_xml – ident: B12
– ident: B9
– ident: B14
– ident: B10
– ident: B3
– ident: B20
– ident: B1
– ident: B7
– ident: B5
– ident: B25
– ident: B23
– ident: B21
– ident: B18
– ident: B16
– ident: B8
– ident: B11
– ident: B13
– ident: B2
– ident: B4
– ident: B6
– ident: B24
– ident: B22
– ident: B17
– ident: B15
– ident: B19
– ident: B5
  doi: 10.1007/978-1-4020-7953-5_17
– ident: B23
  doi: 10.1016/0377-2217(96)00098-7
– ident: B11
  doi: 10.1287/trsc.33.3.330
– ident: B4
  doi: 10.1016/0377-2217(95)00133-6
– ident: B8
  doi: 10.1016/0377-2217(96)00127-0
– ident: B15
  doi: 10.1287/opre.51.4.566.16106
– ident: B17
  doi: 10.1287/mnsc.26.9.871
– ident: B9
  doi: 10.1287/opre.36.2.216
– volume-title: Scheduling Theory, Algorithms, and Systems
  year: 2002
  ident: B19
– volume-title: Network Flows
  year: 1993
  ident: B1
– ident: B6
  doi: 10.1287/opre.1060.0280
– volume-title: Operations Research Applications and Algorithms
  year: 1994
  ident: B24
– ident: B21
  doi: 10.1002/nav.20100
– ident: B14
  doi: 10.1287/opre.49.6.854.10014
– year: 2007
  ident: B13
  publication-title: INFORMS J. Comput.
– start-page: 489
  volume-title: Proc. Portland Internat. Conf. Management Engrg. Tech.
  year: 2005
  ident: B25
– ident: B12
  doi: 10.1287/opre.26.1.3
– ident: B16
  doi: 10.1287/opre.49.1.134.11192
– ident: B22
  doi: 10.1080/07408179908969907
– ident: B2
  doi: 10.1016/0377-2217(93)90058-U
– ident: B7
  doi: 10.1287/mnsc.1040.0325
– ident: B3
  doi: 10.1016/0377-2217(94)90419-7
– ident: B10
  doi: 10.1016/S0377-2217(03)00358-8
– ident: B20
  doi: 10.1287/opre.28.6.1436
– ident: B18
  doi: 10.1002/1099-1425(200101/02)4:1<3::AID-JOS57>3.0.CO;2-D
SSID ssj0001802
Score 2.129297
Snippet When a make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the...
SourceID proquest
gale
repec
crossref
informs
highwire
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 206
SubjectTerms Analysis
Business models
commit to delivery
Integer programming
Integration
Job shops
make to order
Manufacturers
Manufacturing
Manufacturing industry
Order processing
Production management
Production scheduling
scheduling
Scheduling (Management)
Studies
Transportation
Title Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode
URI http://msom.journal.informs.org/cgi/content/abstract/9/2/206
http://econpapers.repec.org/article/inmormsom/v_3a9_3ay_3a2007_3ai_3a2_3ap_3a206-224.htm
https://www.proquest.com/docview/200631106
Volume 9
WOSCitedRecordID wos000248659200005&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: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1526-5498
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0001802
  issn: 1523-4614
  databaseCode: 7WY
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1526-5498
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0001802
  issn: 1523-4614
  databaseCode: M0C
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1526-5498
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0001802
  issn: 1523-4614
  databaseCode: BENPR
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED-xFaG9MD61sq3yA4KnsCR2kuYJ7VMgsVIhEOPJchwHKta0NNmkiX-eO8eOVomPBx6iJtHJdnWX-7DvfgfwHL1iPc6EDqo4UYFIcvykeIqhSpFpUaLFCJUtFH6XTSbji4t86nJzGpdW6XWiVdTlQtMe-QGFvhxtVfp6-SOgplF0uOo6aGzAgBwbyug7D497RUzgZhYuNeaBQDPkMBsxRjiYN4s5Bq5p-IpO6tZsktfMHi7YljmRA9msOaGDlVkafcsWnW3_5794APedE8oOO6l5CHdM_Qju-Rz4x_Bz2uHAIs-YqkvWI6BbNrK3DmKC7nHJTLFz9d0E7SJ4T0Ce-FRfUcGErYBkTuMw2vFFUqpImbVEfGIuKSnkhvmJGTVmewKfzk4_Hr8JXJeGQKMv2WIAqtCFi0vqeBPFURUViU5KKpKKqrFQVYkWTxUxNQMtTVioLC1FVYQiU2MuTG74U9isF7XZARaZUCiBGq9MU5FXpkh4wqsMQxod0wHjEALPJ6kdhDl10riUFMogXyXxVRJfJfF1CC97-mUH3vFnSmK7JE7jiFq54gRcF-FjyUN0W3lGYGhDeLFG-bVDB_8d4b4XIekEqJs0l7GMwxQH8q__tbZdL0vSKZhG9oI0hCMrif0gs3pOg-II15KrHK8bvGhLGn9mdIvX0r5KJTpw8ls7f_bXKXZhq9vRpnylPdhsV1dmH-7q63bWrEawkX3-MoLB0elk-mFkv8BfQ3w12Q
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFH8aGwIufA5RxsAHPk5mieMkzQGhsTGtWld2GNJuxnGcUbGmpcmGqv1N-x95L4kjKvFx2oGD1TR6stP05_dh-_0ewEv0ik0_lobnItRchglOqSDCUCWNjczQYni6ThQexqNR_-QkOVqBK5cLQ8cqnU6sFXU2NbRGvkWhb4C2Kno_-86paBRtrroKGg0qDuziB0Zs5bvBLv69r4TY-3i8s8_bogLcoOtTYbyk0eMQGRVo8YWf-2lowoxyevy8L3WeoYLWqaDalZn1Uh1HmcxTT8a6H0ib2AD7vQFrUuLsoJOC3k6n-IlMraZnFQGXaPZajkiMSbYm5XSCgXLkvaWdwSUb6CyBoyeu06rIYS2XnN61uZ1Z84vt27v3n721-3C3dbLZdjMrHsCKLR7CLXfG_xFcHjU8t4hJpouMdQzvNUzZoKXQoGt8RUyzQ_3N8mrKPxFRKX4rzikhpM7wZK1GZbSijaKUcTOuSHjXntGhlwVzAzMqPLcOn6_lpz-G1WJa2CfAfOtJLVGjZ1Ekk9ymYRAGeYwhmxG0gdoD7nChTEvRTpVCzhSFaogjRThShCNFOOrBm05-1pCT_FmSYKYIWdij0W3yBT4X8X-pbXTLg5jI3nrweknytGE__53gpoOsagHbDJoooYQXYUfu9r-ebcNhV7UKtFQdcHvwoUZ-18m4mFCn2MOFCnSCbYGNltzxY0yX2Gb1rUihg6q-VpOnfx3iBdzePz4cquFgdLABd5rVezqb9QxWq_m53YSb5qIal_Pn9Xxn8OW6p8pPjISOUg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lj9MwEB4tu2jFhfeKsiz4wOMUmjhO0hwQWrZUVLuUHkDam3EcByq2aWmyiyp-Gf-OmcSOqMTjtAcOVtNoZKfpZ8-MPfMNwGO0ivUgEdoreKQ8EaU4pcIYXZUs0SJHjeGrJlH4JJlMBqen6XQLfrhcGAqrdGtis1DnC0175H1yfUPUVXG_sFER0-Ho5fKrRwWk6KDVVdNoEXJs1t_Qe6tejIf4Vz_hfPT6_dEbzxYY8DSaQTX6TgqtD55TsZaAB0WQRTrKKb8nKAZCFTku1irjVMcyN36mkjgXReaLRA1CYVITYr9XYCcRqDUpatA_6pQAEas1VK089ASqQMsXif5Jf14t5ug0x_5zOiXc0IdOKziq4ibFiozXasMA3lmZpdG_6MHRjf_4Dd6E69b4ZoftbLkFW6a8Dbsu9v8OfJ-2_LeIVabKnHXM7w182dhSa9A1vi6m2Fv1xXj1wntHBKb4rTynRJEm85PZlZbRTjeKUibOrCbhoTmjYJg1cwMzKkh3Fz5cyk_fg-1yUZp7wALjCyVwpc_jWKSFyaIwCosEXTnN6WC1B57DiNSWup0qiJxJcuEQU5IwJQlTkjDVg2ed_LIlLfmzJEFOEsqwR61sUgY-F_GCyUM018OESOB68HRD8lPLiv47wQMHX2nB2w6aSi65H2NH7va_nm3f4VjahbWSHYh78KqZBV0ns3JOnWIPFzJUKbY1NtqKx48ZXWJbNrdiiYar_FzP7_91iEewizNEnownx_twrd3Up5CtB7Bdr87NAVzVF_WsWj1spj6Dj5c9U34C9x-XGA
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=Production+and+Transportation+Integration+for+a+Make-to-Order+Manufacturing+Company+with+a+Commit-to-Delivery+Business+Mode&rft.jtitle=Manufacturing+%26+service+operations+management&rft.au=Stecke%2C+Kathryn+E.&rft.au=Zhao%2C+Xuying&rft.date=2007-04-01&rft.issn=1523-4614&rft.eissn=1526-5498&rft.volume=9&rft.issue=2&rft.spage=206&rft.epage=224&rft_id=info:doi/10.1287%2Fmsom.1060.0138&rft.externalDBID=n%2Fa&rft.externalDocID=10_1287_msom_1060_0138
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1523-4614&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1523-4614&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1523-4614&client=summon