Dynamic order acceptance and scheduling problem with sequence-dependent setup time

This paper studies the order acceptance and scheduling problem under a single machine environment when the orders come stochastically during the planning horizon and a sequence-dependent setup time is required between the processing of different types of orders. The objective is to maximise the expe...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 53; no. 19; pp. 5797 - 5808
Main Authors Xu, Lei, Wang, Qian, Huang, Simin
Format Journal Article
LanguageEnglish
Published London Taylor & Francis 02.10.2015
Taylor & Francis LLC
Subjects
Online AccessGet full text
ISSN0020-7543
1366-588X
DOI10.1080/00207543.2015.1005768

Cover

Abstract This paper studies the order acceptance and scheduling problem under a single machine environment when the orders come stochastically during the planning horizon and a sequence-dependent setup time is required between the processing of different types of orders. The objective is to maximise the expected revenue subject to the due date constraints. The problem is formulated as a stochastic dynamic programming model. A rule based on the opportunity cost of the remaining system capacity for the current system state is proposed to make the order acceptance decisions. The remaining system capacity is estimated by a heuristic which generates a good schedule for the accepted orders. Its opportunity cost is estimated by both mathematical programme and greedy heuristic. Computational experiments show that the profit generated by the integrated dynamic programming decision model is much higher than the widely used first-come-first-accept policy in industries and the benefit increases with the length of planning horizon, the arrival rate and the length of lead time. Acceptance decision based on mathematical programming outperforms greedy heuristic by about 7% and its computational time is short. It also shows that the quality of the solutions generated by the opportunity cost based order acceptance rule is satisfactory.
AbstractList This paper studies the order acceptance and scheduling problem under a single machine environment when the orders come stochastically during the planning horizon and a sequence-dependent setup time is required between the processing of different types of orders. The objective is to maximise the expected revenue subject to the due date constraints. The problem is formulated as a stochastic dynamic programming model. A rule based on the opportunity cost of the remaining system capacity for the current system state is proposed to make the order acceptance decisions. The remaining system capacity is estimated by a heuristic which generates a good schedule for the accepted orders. Its opportunity cost is estimated by both mathematical programme and greedy heuristic. Computational experiments show that the profit generated by the integrated dynamic programming decision model is much higher than the widely used first-come-first-accept policy in industries and the benefit increases with the length of planning horizon, the arrival rate and the length of lead time. Acceptance decision based on mathematical programming outperforms greedy heuristic by about 7% and its computational time is short. It also shows that the quality of the solutions generated by the opportunity cost based order acceptance rule is satisfactory.
Author Xu, Lei
Wang, Qian
Huang, Simin
Author_xml – sequence: 1
  givenname: Lei
  surname: Xu
  fullname: Xu, Lei
  organization: Department of Industrial Engineering, Tsinghua University
– sequence: 2
  givenname: Qian
  surname: Wang
  fullname: Wang, Qian
  email: wangqian@ucas.ac.cn
  organization: Management School, University of Chinese Academy of Sciences
– sequence: 3
  givenname: Simin
  surname: Huang
  fullname: Huang, Simin
  organization: Department of Industrial Engineering, Tsinghua University
BookMark eNqFkUtLJTEQhYMoeH38BKFhNrNpJ-lXunGjqDMjCIIouAvVSbVGupM2SSP331uX62xcjLWoguI7xeHUAdt13iFjJ4KfCt7yX5wXXNZVeVpwUdOK17Jpd9hKlE2T1237tMtWGybfQPvsIMZXTlW31YrdX60dTFZnPhgMGWiNcwKnMQNnsqhf0Cyjdc_ZHHw_4pS92_SSRXxbkKDc4IzOoEu0SsucJTvhEdsbYIx4_DkP2ePv64fLv_nt3Z-by4vbXFeySLmmAabvelGYturLSpM7OXBDtlFzwMYgoKDe9YUE3cJQQNlV3SClMfVQHrKf27tkjezEpCYbNY4jOPRLVEKWXBQl7xpCf3xBX_0SHLkjiheS0qg4UfWW0sHHGHBQc7AThLUSXG2SVv-SVpuk1WfSpDv7otM2QbLepQB2_FZ9vlVbN_gwwbsPo1EJ1qMPQ6BX2KjK_5_4APbHmbg
CitedBy_id crossref_primary_10_1007_s10696_025_09602_z
crossref_primary_10_3390_pr10112273
crossref_primary_10_3390_math10142431
crossref_primary_10_1155_2020_3849561
crossref_primary_10_31590_ejosat_1017475
crossref_primary_10_1016_j_jmsy_2020_02_012
crossref_primary_10_1016_j_ijpe_2023_108977
crossref_primary_10_1016_j_omega_2021_102499
crossref_primary_10_2139_ssrn_4128061
crossref_primary_10_1080_00207543_2023_2179342
crossref_primary_10_1080_00207543_2024_2424973
crossref_primary_10_1287_trsc_2024_0644
crossref_primary_10_1007_s12063_023_00364_1
crossref_primary_10_1016_j_ejor_2019_06_034
crossref_primary_10_1007_s40314_016_0415_8
crossref_primary_10_1115_1_4038074
crossref_primary_10_1007_s12351_023_00789_3
crossref_primary_10_1016_j_cor_2020_105017
crossref_primary_10_2139_ssrn_4140716
crossref_primary_10_1016_j_eswa_2022_118711
crossref_primary_10_1007_s11590_019_01450_9
crossref_primary_10_1007_s13198_025_02714_7
crossref_primary_10_1080_00207543_2023_2245918
crossref_primary_10_1080_0305215X_2021_1919098
crossref_primary_10_1007_s12351_021_00629_2
Cites_doi 10.1016/S0305-0548(00)00105-2
10.1080/00207543.2010.496797
10.1007/s00291-004-0171-9
10.1287/mnsc.44.11.1577
10.1287/trsc.37.3.257.16047
10.1016/S0167-6377(02)00160-8
10.1016/j.cor.2010.09.018
10.1080/0305215X.2013.800056
10.1016/j.cie.2009.08.005
10.1016/j.ejor.2006.06.060
10.1596/1813-9450-7054
10.1016/j.omega.2011.08.007
10.1016/j.ejor.2010.09.042
10.1016/j.ijpe.2010.02.002
10.1007/PL00011432
10.1287/opre.46.3.330
10.1080/00207543.2012.693638
10.1016/S1568-4946(03)00009-7
10.1016/0925-5273(94)90014-0
10.1007/s00170-006-0904-9
10.1007/s10951-008-0090-8
10.1080/00207540802448882
10.1080/00207549208942959
ContentType Journal Article
Copyright 2015 Taylor & Francis 2015
Copyright Taylor & Francis Group 2015
Copyright_xml – notice: 2015 Taylor & Francis 2015
– notice: Copyright Taylor & Francis Group 2015
DBID AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
DOI 10.1080/00207543.2015.1005768
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
Technology Research Database

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1366-588X
EndPage 5808
ExternalDocumentID 3773025481
10_1080_00207543_2015_1005768
1005768
Genre Article
Feature
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 71371178, 71210002, 71390331
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29J
2DF
30N
4.4
5GY
5VS
8VB
A8Z
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFO
ACGFS
ACGOD
ACIWK
ACNCT
ACTIO
ADCVX
ADGTB
ADXPE
AEGXH
AEISY
AEMOZ
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AHQJS
AIAGR
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBD
EBE
EBO
EBR
EBS
EBU
EJD
EMK
EPL
ESTFP
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~9
H~P
I-F
IPNFZ
J.P
K1G
KYCEM
M4Z
ML~
NA5
NX~
O9-
P2P
PQQKQ
QWB
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TH9
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
ZL0
~S~
AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c472t-cc47adb9b12d84b34c5437f0d136ec0ae6deae16de9b27ac8af2a3949f77dd5f3
ISSN 0020-7543
IngestDate Thu Oct 02 10:20:17 EDT 2025
Wed Aug 13 09:50:28 EDT 2025
Thu Apr 24 22:57:19 EDT 2025
Wed Oct 01 04:10:59 EDT 2025
Mon Oct 20 23:44:19 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 19
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c472t-cc47adb9b12d84b34c5437f0d136ec0ae6deae16de9b27ac8af2a3949f77dd5f3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
PQID 1702700040
PQPubID 30924
PageCount 12
ParticipantIDs crossref_citationtrail_10_1080_00207543_2015_1005768
proquest_journals_1702700040
crossref_primary_10_1080_00207543_2015_1005768
informaworld_taylorfrancis_310_1080_00207543_2015_1005768
proquest_miscellaneous_1730123096
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2015-10-02
PublicationDateYYYYMMDD 2015-10-02
PublicationDate_xml – month: 10
  year: 2015
  text: 2015-10-02
  day: 02
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle International journal of production research
PublicationYear 2015
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References Allahverdi A. (CIT0001) 1999; 27
CIT0010
CIT0012
CIT0011
Guerrero H. H. (CIT0014) 1988; 29
CIT0013
CIT0016
CIT0015
CIT0018
CIT0017
CIT0019
CIT0021
CIT0020
CIT0023
CIT0022
CIT0003
CIT0025
CIT0002
CIT0024
CIT0005
CIT0004
CIT0007
CIT0006
CIT0009
CIT0008
References_xml – ident: CIT0016
  doi: 10.1016/S0305-0548(00)00105-2
– ident: CIT0015
  doi: 10.1080/00207543.2010.496797
– ident: CIT0009
  doi: 10.1007/s00291-004-0171-9
– ident: CIT0021
  doi: 10.1287/mnsc.44.11.1577
– ident: CIT0005
  doi: 10.1287/trsc.37.3.257.16047
– ident: CIT0010
  doi: 10.1016/S0167-6377(02)00160-8
– ident: CIT0006
  doi: 10.1016/j.cor.2010.09.018
– ident: CIT0025
  doi: 10.1080/0305215X.2013.800056
– ident: CIT0003
  doi: 10.1016/j.cie.2009.08.005
– ident: CIT0002
  doi: 10.1016/j.ejor.2006.06.060
– ident: CIT0024
  doi: 10.1596/1813-9450-7054
– ident: CIT0017
  doi: 10.1016/j.omega.2011.08.007
– ident: CIT0020
  doi: 10.1016/j.ejor.2010.09.042
– ident: CIT0018
  doi: 10.1016/j.ijpe.2010.02.002
– ident: CIT0004
  doi: 10.1007/PL00011432
– ident: CIT0012
  doi: 10.1287/opre.46.3.330
– ident: CIT0013
  doi: 10.1080/00207543.2012.693638
– ident: CIT0007
  doi: 10.1016/S1568-4946(03)00009-7
– volume: 27
  start-page: 219
  year: 1999
  ident: CIT0001
  publication-title: International Journal of Management Science
– volume: 29
  start-page: 59
  year: 1988
  ident: CIT0014
  publication-title: Production and Inventory Management
– ident: CIT0022
  doi: 10.1016/0925-5273(94)90014-0
– ident: CIT0008
  doi: 10.1007/s00170-006-0904-9
– ident: CIT0019
  doi: 10.1007/s10951-008-0090-8
– ident: CIT0011
  doi: 10.1080/00207540802448882
– ident: CIT0023
  doi: 10.1080/00207549208942959
SSID ssj0000584
Score 2.2927053
Snippet This paper studies the order acceptance and scheduling problem under a single machine environment when the orders come stochastically during the planning...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 5797
SubjectTerms Acceptance
Decision making models
Decisions
Dynamic programming
Dynamical systems
Dynamics
Heuristic
Mathematical models
Mathematical programming
Opportunity costs
order acceptance
Production scheduling
Scheduling
sequence-dependent setup
Setup times
stochastic demand
Stochastic models
Studies
Title Dynamic order acceptance and scheduling problem with sequence-dependent setup time
URI https://www.tandfonline.com/doi/abs/10.1080/00207543.2015.1005768
https://www.proquest.com/docview/1702700040
https://www.proquest.com/docview/1730123096
Volume 53
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVEBS
  databaseName: EBSCOhost Food Science Source
  customDbUrl:
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: A8Z
  dateStart: 19611101
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/login.aspx?authtype=ip,uid&profile=ehost&defaultdb=fsr
  providerName: EBSCOhost
– providerCode: PRVLSH
  databaseName: aylor and Francis Online
  customDbUrl:
  mediaType: online
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: AHDZW
  dateStart: 19970101
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVAWR
  databaseName: Taylor & Francis Science and Technology Library-DRAA
  customDbUrl:
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: 30N
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.tandfonline.com/page/title-lists
  providerName: Taylor & Francis
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lj9MwELZK9wIHxFMUFmQk9rRy5SR2HB9XdKsKLYtAqai4RE7sSCuhboHkwk_h1zJ-5FF1xQIXN3Jqt_F8mfHY428QehOzKslK0H5gCyRhSkRElrwkmikutEnr1OU6fH-Zrtbs3YZvJpNfo6iltinn1c8bz5X8j1ShDuRqT8n-g2T7TqECrkG-UIKEofwrGS98OvlTx595qiobotIfAQC3FcxIOG3ussaEePQQPE26_LcNVDXtzqWZH89V9xcLRxQTO88Sa4ETuIL6NeVN6xx9czUs1Htl8nEEw1XbLVLblGLjdYfI8ZXSwUvND1KA9GmOu2MClAjuOZjmxmvXJE0Jz1wu4V79eq7gDmZypEy58KG7B1q-C4uMqf0BG5_HbbSHdZ0Gs9Zt5V9-KJbri4siP9_k-3e9FReg48BLzqKTZLn7Rmw-Mrtvf5IsPGDuoKMYLAadoqOz1eLL58HO8yxwfPsH7c6HWeb2m_7a3sxnjxf3YB7gJjf5A3Q_eCX4zEPsIZqY7SN0b8RV-Rh9CmDDDmx4ABsGsOEBbDiADVuw4UOwYQc2bMH2BK2X5_nbFQkJOUjFRNyQCj6ULmUZxTpjZcIqeEZRUw2CNRVVJtVGmQhKWcZCVZmqY5VIJmshtOZ18hRNt9db8wxhnYKfITWXqmZMgp6gmmc19M5oBldqhlg3WEUV2Opt0pSvRdST2voxLuwYF2GMZ2jeN9t5upbbGsixJIrGwbr2iC6SW9oed2Irwkv4o4gEtbEcYBtn6HV_G3S23YhTW3Pd2u8k1pWhMn3-5y5eoLvDq3eMps331ryESXBTvgpo_A0t-q4T
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB4VegAOLZQitlAwEteskthO4iOCrha67AGBxM3y81K0iyB76a_vTB7bhariwCWJ4vgRP2bG9vj7AE5z4XhlUfqhLlCJMGWWKCtt4oWRpQ9FLBquw-tpMb4TV_fyfuUsDLlV0hw6tkARjaymwU2L0b1LHB3hRk0nOHlmSdrnJ6N5DT5KNPaJxYCn07_SWFYdEnOaUJz-FM__knmhn16gl_4jrRsVNPoMri9863nya7io7dD9foXr-L6_24ZPnYXKztoutQMfwuwLbK3gFu7CzUXLY88a4E5mHPnGUPdhmCvD-TLqLzrmzjq6Gkarvaz32k564t0aX9WLR0b89l_hbvTj9nycdOQMiRNlXicOb8ZbZbPcV8Jy4bDIZUx9xovgUhMKH0zI8KpsXhpXmZgbroSKZem9jHwP1mfzWdgH5gu0OZWXykQhFPaZ1MsqYuoirfDJDED0TaJdh1xOBBoPOlsCnLZVpqnKdFdlAxguoz220B1vRVCr7a3rZs0ktgQnmr8R97DvHLqTAs86K1Pa10c5OYCTZTCOX9qUMbMwX9A3nMxanEl-e0f2x7Axvr2e6Mnl9OcBbFJQ43GYH8J6_bQI39Fyqu1RMzT-ACFDCTc
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JSsRAEC1cQPTgLo5rC14zZOksfRR1GLdBRMFb0-tFGQfNXPx6q7KMoyIevCQhnV7SS1V1V9UrgOOYm6TQSP2QF4iAqzwKhE51YLlKc-syn1WxDm8GWf-BXz6mrTXhW2NWSXtoXwNFVLSaFvfI-tYijjy4kdHxhAyzUlLzk8w8C_MZacXIiyMcfBLjtGiAmMOA8rROPL8V84U9fQEv_UGsKw7UWwHdtr02PHnqjkvdNe_fYB3_9XOrsNzIp-yknlBrMOOG67A0hVq4AXdndRR7VsF2MmXIMoYmD8NKGe6WkXuRkztrgtUwOutlrc120IbdLfFVOR4xim6_CQ-98_vTftCEZggMz-MyMHhTVgsdxbbgOuEGm5z70EZJ5kyoXGadchFehY5zZQrlY5UILnyeW5v6ZAvmhi9Dtw3MZihxCpsK5TkXOGNCmxYeS-dhgU-qA7wdEWka3HIKn_Esowm8ad1lkrpMNl3Wge4k26gG7vgrg5gebllWJya-Dm8ikz_y7rVzQzY04E1GeUhafaSSHTiaJOPqJZWMGrqXMX2TkFCL-8idf1R_CAu3Zz15fTG42oVFSqnMDeM9mCtfx24fxaZSH1QL4wPKDgfb
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=Dynamic+order+acceptance+and+scheduling+problem+with+sequence-dependent+setup+time&rft.jtitle=International+journal+of+production+research&rft.au=Xu%2C+Lei&rft.au=Wang%2C+Qian&rft.au=Huang%2C+Simin&rft.date=2015-10-02&rft.pub=Taylor+%26+Francis+LLC&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=53&rft.issue=19&rft.spage=5797&rft_id=info:doi/10.1080%2F00207543.2015.1005768&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3773025481
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon