Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation

In this article, the common due-window (CON DW) assignment and scheduling problem on a single machine is studied. The minmax CON DW problem is extended by considering convex resource allocation. In extended problems, the scheduler needs to find, in addition to the optimal job sequence, the start tim...

Full description

Saved in:
Bibliographic Details
Published inEngineering optimization Vol. 51; no. 7; pp. 1251 - 1267
Main Author Mor, Baruch
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 03.07.2019
Taylor & Francis Ltd
Subjects
common due-window
convex resource allocation
Job shops
minmax
position-dependent workloads
Production scheduling
Resource allocation
Scheduling
Single-machine scheduling
Upper bounds
Windows (intervals)
Online AccessGet full text

Cover

Abstract In this article, the common due-window (CON DW) assignment and scheduling problem on a single machine is studied. The minmax CON DW problem is extended by considering convex resource allocation. In extended problems, the scheduler needs to find, in addition to the optimal job sequence, the start time and size of the due window, as well as the actual processing time of each job that optimizes a cost function. First, the focus is on minimizing the maximum scheduling criteria subject to maximal resource consumption. Next, the complementary problem of minimizing resource consumption subject to an upper bound on the scheduling measure is solved. For these problems, a closed form solution is provided, with computational complexity of , where is the number of jobs. An extension to the first problem is offered by assuming general position-dependent workloads, proving that the problem remains polynomially solvable.
AbstractList In this article, the common due-window (CON DW) assignment and scheduling problem on a single machine is studied. The minmax CON DW problem is extended by considering convex resource allocation. In extended problems, the scheduler needs to find, in addition to the optimal job sequence, the start time and size of the due window, as well as the actual processing time of each job that optimizes a cost function. First, the focus is on minimizing the maximum scheduling criteria subject to maximal resource consumption. Next, the complementary problem of minimizing resource consumption subject to an upper bound on the scheduling measure is solved. For these problems, a closed form solution is provided, with computational complexity of [Formula omitted.] , where [Formula omitted.] is the number of jobs. An extension to the first problem is offered by assuming general position-dependent workloads, proving that the problem remains polynomially solvable.
In this article, the common due-window (CON DW) assignment and scheduling problem on a single machine is studied. The minmax CON DW problem is extended by considering convex resource allocation. In extended problems, the scheduler needs to find, in addition to the optimal job sequence, the start time and size of the due window, as well as the actual processing time of each job that optimizes a cost function. First, the focus is on minimizing the maximum scheduling criteria subject to maximal resource consumption. Next, the complementary problem of minimizing resource consumption subject to an upper bound on the scheduling measure is solved. For these problems, a closed form solution is provided, with computational complexity of , where is the number of jobs. An extension to the first problem is offered by assuming general position-dependent workloads, proving that the problem remains polynomially solvable.
Author Mor, Baruch
Author_xml – sequence: 1
  givenname: Baruch
  orcidid: 0000-0002-6909-8160
  surname: Mor
  fullname: Mor, Baruch
  email: baruchm@ariel.ac.il
  organization: Department of Economics and Business Administration, Ariel University
BookMark eNqFkE9vEzEQxS1UJNLCR0CyxHnDeL278YoLqGpppUocAImbNfWOG0f-09ob0n57nKa99EDnMpf3e_PmHbOjmCIx9lHAUoCCzyChb0X_Z9mCUEvRi7HvV2_YQkA7NtCu5BFb7DXNXvSOHZeyARASQC3Y5qeLN56agGbtIvHgYsB7blIIKfJpS83OxSntOJbibmKgOHOMEy9mTdPWV5jf5nTtKRS-c_O6kvEv3fNMJW2zIY7eJ4OzS_E9e2vRF_rwtE_Y7_OzX6cXzdWP75en364aI6Wam9YaaAcyOI5j1wqjBFkcpgFQgFVqkMpKYc1IK5qu0ZDqRafQ1n_UMHamkyfs08G3BrvbUpn1pkaJ9aRu66yg7zqoqi8HlcmplExWGzc_5pwzOq8F6H25-rlcvS9XP5Vb6f4FfZtdwPzwKvf1wLloUw64S9lPesYHn7LNGI0rWv7f4h_VWJUt
CitedBy_id crossref_primary_10_1007_s42452_020_1946_6
crossref_primary_10_1051_ro_2024228
crossref_primary_10_1109_ACCESS_2019_2946032
crossref_primary_10_1007_s10479_025_06471_5
crossref_primary_10_1007_s10878_018_0365_8
crossref_primary_10_1007_s10878_021_00746_w
crossref_primary_10_1007_s11518_022_5534_8
crossref_primary_10_1080_0305215X_2021_1961761
crossref_primary_10_1016_j_dam_2021_01_013
Cites_doi 10.1016/j.cor.2008.06.001
10.1016/j.ejor.2014.09.043
10.1007/s10479-012-1098-1
10.1016/j.cor.2017.02.010
10.1016/j.dam.2007.02.003
10.1007/s10479-018-2779-1
10.1016/j.ijpe.2013.12.021
10.1016/j.dam.2011.04.001
10.1057/s41274-017-0253-0
10.1007/s11590-016-1059-8
10.1287/opre.30.2.391
10.1016/j.cie.2011.12.013
10.1093/comjnl/bxx007
10.1007/s10479-013-1481-6
10.1057/jors.1996.155
10.1080/0305215X.2016.1248180
10.1016/j.cor.2014.11.016
10.1080/00207548108956667
10.1016/j.ijpe.2015.12.014
10.1080/00207543.2015.1067379
10.1007/978-3-540-69446-5_5
10.1007/s10479-017-2481-8
10.1016/S0167-5060(08)70356-X
10.1007/978-3-642-41880-8
10.1016/j.jmsy.2017.01.002
10.1080/00207543.2015.1056323
ContentType Journal Article
Copyright 2018 Informa UK Limited, trading as Taylor & Francis Group 2018
2018 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2018 Informa UK Limited, trading as Taylor & Francis Group 2018
– notice: 2018 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
DOI 10.1080/0305215X.2018.1519557
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Civil Engineering Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-0273
EndPage 1267
ExternalDocumentID 10_1080_0305215X_2018_1519557
1519557
Genre Article
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29G
2DF
30N
4.4
5GY
5VS
AAENE
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACGOD
ACIWK
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AGDLA
AGMYJ
AHDZW
AIJEM
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
EBS
EJD
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
NX~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
AAGDL
AAHIA
AAYXX
ADYSH
AFRVT
AIYEW
AMPGV
CITATION
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
TASJS
ID FETCH-LOGICAL-c338t-2fc026eca999421c81efa6d60a10f88638f31fc9e7edbace85148af1308694c43
ISSN 0305-215X
IngestDate Wed Aug 13 06:59:58 EDT 2025
Tue Jul 01 04:11:35 EDT 2025
Thu Apr 24 22:58:28 EDT 2025
Wed Dec 25 09:08:06 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 7
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c338t-2fc026eca999421c81efa6d60a10f88638f31fc9e7edbace85148af1308694c43
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-6909-8160
PQID 2222705440
PQPubID 53195
PageCount 17
ParticipantIDs informaworld_taylorfrancis_310_1080_0305215X_2018_1519557
proquest_journals_2222705440
crossref_citationtrail_10_1080_0305215X_2018_1519557
crossref_primary_10_1080_0305215X_2018_1519557
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2019-07-03
PublicationDateYYYYMMDD 2019-07-03
PublicationDate_xml – month: 07
  year: 2019
  text: 2019-07-03
  day: 03
PublicationDecade 2010
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle Engineering optimization
PublicationYear 2019
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References CIT0012
CIT0011
CIT0014
CIT0013
CIT0016
CIT0015
CIT0018
CIT0017
CIT0019
CIT0021
CIT0020
CIT0001
CIT0023
CIT0022
CIT0003
CIT0025
CIT0002
CIT0024
CIT0005
CIT0027
CIT0004
CIT0026
CIT0007
CIT0006
CIT0009
CIT0008
References_xml – ident: CIT0014
  doi: 10.1016/j.cor.2008.06.001
– ident: CIT0007
  doi: 10.1016/j.ejor.2014.09.043
– ident: CIT0017
  doi: 10.1007/s10479-012-1098-1
– ident: CIT0005
  doi: 10.1016/j.cor.2017.02.010
– ident: CIT0019
  doi: 10.1016/j.dam.2007.02.003
– ident: CIT0026
  doi: 10.1007/s10479-018-2779-1
– ident: CIT0021
  doi: 10.1016/j.ijpe.2013.12.021
– ident: CIT0022
  doi: 10.1016/j.dam.2011.04.001
– ident: CIT0011
  doi: 10.1057/s41274-017-0253-0
– ident: CIT0003
  doi: 10.1007/s11590-016-1059-8
– ident: CIT0015
  doi: 10.1287/opre.30.2.391
– ident: CIT0012
  doi: 10.1016/j.cie.2011.12.013
– ident: CIT0024
  doi: 10.1093/comjnl/bxx007
– ident: CIT0020
  doi: 10.1007/s10479-013-1481-6
– ident: CIT0001
  doi: 10.1057/jors.1996.155
– ident: CIT0023
  doi: 10.1080/0305215X.2016.1248180
– ident: CIT0013
  doi: 10.1016/j.cor.2014.11.016
– ident: CIT0018
  doi: 10.1080/00207548108956667
– ident: CIT0027
  doi: 10.1016/j.ijpe.2015.12.014
– ident: CIT0025
  doi: 10.1080/00207543.2015.1067379
– ident: CIT0004
  doi: 10.1007/978-3-540-69446-5_5
– ident: CIT0016
  doi: 10.1007/s10479-017-2481-8
– ident: CIT0006
  doi: 10.1016/S0167-5060(08)70356-X
– ident: CIT0002
  doi: 10.1007/978-3-642-41880-8
– ident: CIT0008
  doi: 10.1016/j.jmsy.2017.01.002
– ident: CIT0009
  doi: 10.1080/00207543.2015.1056323
SSID ssj0013008
Score 2.256472
Snippet In this article, the common due-window (CON DW) assignment and scheduling problem on a single machine is studied. The minmax CON DW problem is extended by...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1251
SubjectTerms common due-window
convex resource allocation
Job shops
minmax
position-dependent workloads
Production scheduling
Resource allocation
Scheduling
Single-machine scheduling
Upper bounds
Windows (intervals)
Title Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
URI https://www.tandfonline.com/doi/abs/10.1080/0305215X.2018.1519557
https://www.proquest.com/docview/2222705440
Volume 51
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PT9swFLY6uLADYhvTGDD5sFvkKo7T1DkifqhC2i4rWrVL5PgHY6LpBKlA_PU8x07irkiw7RJViZxG_r48v-e89z2EPmeyHDGVZySlCg46oaTkKiGAt6SlALuZ2drhL1-zyUV6PhvNBoPzIGtpWZdD-fBkXcm_oArnAFdbJfsXyHY3hRPwG_CFIyAMxxdh_A3WnWtN5k1CpI7mV9Vc3NsscXiCSC01uYOIe3EXgYN8dVl16eQQ0MIC4-vQm34yt0EK-n1047f0I_tRXvbQtRv4vYRhtACLM_elnB12fgdAAG1-hrsKTSETiVnHg-lag4_ALoGJIOApzNwS4uymzaKx0jihYfVKso5A48BKWqcqWHFp4jpyrFlzn_7IbIHxaGbz8PiQWjkcp2n9h1C2v_IKbSYQMoDN2zyanPz43n9Tipv-hN3jt_VcVmn9qb9Y8VRWdGzX1u3GGZnuoG0fReAjR4k3aKCrt-h1AMw79GuVHNiRAzty4J4cuCcHBnLgnhy4JQe25MCOHLglB-7JsYsuzk6nxxPiG2sQyRivSWIkhN5aCogO0oRKTrURmcpiQWPDOZhkw6iRuR5rVQrb2BaCZmFgBnmWpzJl79FGtaj0B4R1znMds7HgTKSxUGIEAYcSmo9NnCtq9lDaTmIhveq8bX5yXdBWnNbPfWHnvvBzv4eG3bDfTnbluQF5iFBRNwQ2jrsFe2bsQQtn4d_u2yKxReIQz6Txx_-49T7a6t-uA7RR3yz1IXixdfnJ0_MRljmaeg
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwELYoHCiHltIiKBR86NVpnKd9rCrQUmAvgLQ3y_Gj2nY3iyArEL-eGSehC1XFYS_JIRonscfz8jczhHwtTJWnVhYs4xYuLuGsEjZhsN6GVxrkZoG5w-fDYnCV_Rzlo4VcGIRVog_t20IRQVbj5sZgdA-J-4ZMCqpqhMgsEXEskJKXb8haLosSeT2Nh39PEuLQlQ5JGNL0WTz_G-aZfnpWvfQfaR1U0PF7YvqPb5Enf6J5U0Xm4UVdx-X-bpO86yxU-r1lqQ9kxdVbZGOhbuFH8vsCbhPHpgGJ6eh0XE_1PYX3AFNTO3fsDlz92R0Fy3z8K-ANKHwPBU8aNBsmwNOukc0txUAwDdj3e3rTnSVQRAO0scRP5Or46PLHgHVNG5gBb7dhiTfg1jmjwfLMEm4Ed14Xtog1j70QsN19yr2RrnS20tg0FRwy7WGdRCEzk6XbZLWe1W6HUCeFdHFaapHqLNZW52DMWu1E6WNpud8lWb9UynQVzbGxxkTxvvBpN5UKp1J1U7lLoiey67akx2sEcpEPVBNiKb5tfKLSV2j3e6ZRnXS4VQkmIIOtnMWflxj6kKwPLs_P1NnJ8HSPvIVHMuCI032y2tzM3RewlprqIGyHR0o4B8w
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEA4-QPTgW3ybg9esTdvtpkdRF5-LoIK3kOYhq-4qbhfFX-9MmvpEPHhpD2XSNplMZpJvviFkO9NFMzF5xlJu4GJjzgphYgbjrXmhwG5mmDt81skOr9Lj62aNJhwEWCXG0K4iivC2Gif3o3E1Im4HdRRWqmsEZokGR36UZmuUjGeYaIlZHFHn4yAh8kXpUIShTJ3E81szX5anL-SlP4y1X4HaM6Sov70Cntw1hmXR0K_faB3_9XOzZDr4p3S3Uqg5MmL782TqE2vhArm9gNu9ZT2Pw7S01-331AuF14BKUzO07BkC_YdnCn5598ajDSh8DoU4GtY1TH-noYzNgOI2MPXI9xf6FE4SKGIBqp3ERXLVPrjcO2ShZAPTEOuWLHYagjqrFfidacy14NapzGSR4pETAia7S7jTuW1ZUygsmQrhmHIwTCLLU50mS2Ss_9C3y4TaXOQ2SlpKJCqNlFFNcGWNsqLlotxwt0LSeqSkDnzmWFbjXvKa9jR0pcSulKErV0jjXeyxIvT4SyD_rAay9Dsprip7IpM_ZNdrnZHBNgxkjOnH4Cmn0eo_mt4iE-f7bXl61DlZI5PwJPcg4mSdjJVPQ7sBrlJZbPrJ8Ab_1gZw
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=Single-machine+minmax+common+due-window+assignment+and+scheduling+problems+with+convex+resource+allocation&rft.jtitle=Engineering+optimization&rft.au=Mor%2C+Baruch&rft.date=2019-07-03&rft.pub=Taylor+%26+Francis&rft.issn=0305-215X&rft.eissn=1029-0273&rft.volume=51&rft.issue=7&rft.spage=1251&rft.epage=1267&rft_id=info:doi/10.1080%2F0305215X.2018.1519557&rft.externalDocID=1519557
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-215X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-215X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-215X&client=summon