Improved algorithms for proportionate flow shop scheduling with due-window assignment

In a recent study, Sun et al. (AOR 292:113–131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For common due-window (denoted by CONW) and slack due-window (denoted by SLKW) assignment methods, they proved that these two problems can be solved i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 309; číslo 1; s. 249 - 258
Hlavní autoři: Qian, Jin, Han, Haiyan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.02.2022
Springer
Springer Nature B.V
Témata:
Algorithms
Business and Management
Combinatorics
Job shop scheduling
Job shops
Machine shops
Management
Methods
Operations research
Operations Research/Decision Theory
Original Research
Scheduling
Scheduling (Management)
Theory of Computation
China
Scheduling
Due-window assignment
Position-dependent weights
Proportionate flow shop
Algorithm complexity
ISSN:0254-5330, 1572-9338
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In a recent study, Sun et al. (AOR 292:113–131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For common due-window (denoted by CONW) and slack due-window (denoted by SLKW) assignment methods, they proved that these two problems can be solved in O ( n 2 log n ) time respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contribution is that the CONW problem can be optimally solved by a lower-order algorithm, which runs in O ( n log n ) time, implying an improvement of a factor of n .
AbstractList In a recent study, Sun et al. (AOR 292:113–131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For common due-window (denoted by CONW) and slack due-window (denoted by SLKW) assignment methods, they proved that these two problems can be solved in O ( n 2 log n ) time respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contribution is that the CONW problem can be optimally solved by a lower-order algorithm, which runs in O ( n log n ) time, implying an improvement of a factor of n .
In a recent study, Sun et al. (AOR 292:113–131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For common due-window (denoted by CONW) and slack due-window (denoted by SLKW) assignment methods, they proved that these two problems can be solved in O(n2logn) time respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contribution is that the CONW problem can be optimally solved by a lower-order algorithm, which runs in O(nlogn) time, implying an improvement of a factor of n.
In a recent study, Sun et al. (AOR 292:113-131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For common due-window (denoted by CONW) and slack due-window (denoted by SLKW) assignment methods, they proved that these two problems can be solved in [Formula omitted] time respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contribution is that the CONW problem can be optimally solved by a lower-order algorithm, which runs in [Formula omitted] time, implying an improvement of a factor of n.
Audience Academic
Author Han, Haiyan
Qian, Jin
Author_xml – sequence: 1
  givenname: Jin
  orcidid: 0000-0003-2306-2274
  surname: Qian
  fullname: Qian, Jin
  email: qianjin@mail.neu.edu.cn
  organization: Department of Mathematics, Northeastern University
– sequence: 2
  givenname: Haiyan
  surname: Han
  fullname: Han, Haiyan
  organization: Department of Mathematics, Northeastern University
BookMark eNp9kctqHDEQRUVwIGMnP5BVQ7aRo-e0emlMHgaDN_ZaSOpSj0y3NJHUGfL30WQCjkMwtSgo3VMl7j1HZzFFQOg9JZeUkP5ToUT0AyaMYiIEFVi8Qhsqe4YHztUZ2hAmBZackzfovJRHQgilSm7Qw82yz-kHjJ2Zp5RD3S2l8yl3bbpPuYYUTYXOz-nQlV3ad8XtYFznEKfu0NTduAI-hDi2d1NKmOICsb5Fr72ZC7z70y_Qw5fP99ff8O3d15vrq1vsBOMVw6B68AYcZ-MAjlk1eALM-sEbJdXWcmudUUYRK5TkVlJQ1gmw1EguOeMX6MNpb_vt9xVK1Y9pzbGd1GzLiOJ9P8gn1WRm0CH6VLNxSyhOX23VoBinw3HX5X9UrUZYgmt2-9Dmz4CPfwF2LSFCcyA2E3a1TGYt5blcneQup1IyeO1CNUeD250wa0r0MUp9ilK3KPXvKLVoKPsH3eewmPzzZYifoNLEcYL85M0L1C85Y7N9
CitedBy_id crossref_primary_10_3390_math11163536
crossref_primary_10_1080_01605682_2025_2492817
crossref_primary_10_1142_S0217595924500118
crossref_primary_10_3390_math11010222
crossref_primary_10_1007_s12190_024_02080_w
crossref_primary_10_1007_s10479_024_06329_2
crossref_primary_10_1007_s12190_024_02090_8
crossref_primary_10_1007_s10479_024_06275_z
crossref_primary_10_1007_s12190_024_02023_5
Cites_doi 10.1080/0305215X.2019.1573898
10.1007/s10479-011-0923-2
10.1007/s10951-008-0062-z
10.1002/nav.21666
10.1080/0305215X.2019.1577411
10.1016/j.ejor.2018.04.019
10.1007/s10479-020-03653-1
10.1016/j.omega.2017.05.010
10.1007/s11590-020-01670-4
10.1002/nav.21518
10.1080/0305215X.2020.1740921
10.1016/j.cor.2012.08.006
10.1016/j.cor.2015.12.006
10.1016/j.ejor.2020.01.002
10.1057/jors.2013.9
10.1016/S0167-5060(08)70356-X
10.1007/s10878-020-00676-z
10.1111/itor.12323
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021
COPYRIGHT 2022 Springer
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021
– notice: COPYRIGHT 2022 Springer
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
DBID AAYXX
CITATION
N95
3V.
7TA
7TB
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FR3
FRNLG
F~G
GNUQQ
HCIFZ
JG9
JQ2
K60
K6~
K7-
KR7
L.-
L6V
M0C
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10479-021-04414-4
DatabaseName CrossRef
Gale Business: Insights
ProQuest Central (Corporate)
Materials Business File
Mechanical & Transportation Engineering Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection (Proquest)
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central
Engineering Research Database
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest SciTech Premium Collection
Materials Research Database
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
Civil Engineering Abstracts
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Global
Computing Database
Science Database
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business (OCUL)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
Materials Research Database
ProQuest Business Collection (Alumni Edition)
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
Materials Business File
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
ABI/INFORM Complete (Alumni Edition)
Civil Engineering Abstracts
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList
Materials Research Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1572-9338
EndPage 258
ExternalDocumentID A689823192
10_1007_s10479_021_04414_4
GeographicLocations China
GeographicLocations_xml – name: China
GrantInformation_xml – fundername: fundamental research funds for the central universities
  grantid: 02060022121020
  funderid: http://dx.doi.org/10.13039/501100012226
GroupedDBID -4X
-57
-5G
-BR
-EM
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
2.D
203
23M
28-
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
7WY
88I
8AO
8FE
8FG
8FL
8TC
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHQJS
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DWQXO
EBLON
EBO
EBS
EBU
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I09
IAO
IEA
IHE
IJ-
IKXTQ
ITC
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M0C
M0N
M2P
M4Y
M7S
MA-
N2Q
N95
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZD
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SBE
SCF
SCLPG
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TH9
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7S
Z7U
Z7V
Z7W
Z7X
Z7Y
Z7Z
Z81
Z83
Z88
Z8N
Z8U
Z92
ZL0
ZMTXR
ZYFGU
~8M
~A9
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
ICD
PHGZM
PHGZT
PQGLB
7TA
7TB
7XB
8AL
8FD
8FK
FR3
JG9
JQ2
KR7
L.-
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c423t-e987efaec32d9ec2b89f0e2bf9fa8586b3bbca8a80b4853b51e8bc4eb1a535323
IEDL.DBID M2P
ISICitedReferencesCount 11
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000721423100002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0254-5330
IngestDate Wed Nov 05 14:53:36 EST 2025
Sat Nov 29 14:02:06 EST 2025
Mon Nov 24 15:45:29 EST 2025
Sat Nov 29 09:27:51 EST 2025
Tue Nov 18 21:55:57 EST 2025
Sat Nov 29 02:36:45 EST 2025
Fri Feb 21 02:46:38 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Scheduling
Due-window assignment
Position-dependent weights
Proportionate flow shop
Algorithm complexity
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c423t-e987efaec32d9ec2b89f0e2bf9fa8586b3bbca8a80b4853b51e8bc4eb1a535323
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-2306-2274
PQID 2620837795
PQPubID 25585
PageCount 10
ParticipantIDs proquest_journals_2620837795
gale_infotracmisc_A689823192
gale_infotracacademiconefile_A689823192
gale_businessinsightsgauss_A689823192
crossref_citationtrail_10_1007_s10479_021_04414_4
crossref_primary_10_1007_s10479_021_04414_4
springer_journals_10_1007_s10479_021_04414_4
PublicationCentury 2000
PublicationDate 20220200
2022-02-00
20220201
PublicationDateYYYYMMDD 2022-02-01
PublicationDate_xml – month: 2
  year: 2022
  text: 20220200
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Annals of operations research
PublicationTitleAbbrev Ann Oper Res
PublicationYear 2022
Publisher Springer US
Springer
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer
– name: Springer Nature B.V
References Wang, Wang (CR17) 2011; 191
Estévez-Fernández, Mosquera, Borm, Hamers (CR1) 2008; 11
Koulamas (CR5) 2020; 284
CR3
Panwalkar, Smith, Koulamas (CR11) 2013; 60
Wang, Hu, Zhang (CR15) 2021; 53
Mosheiov, Sarig, Strusevich, Mosheiff (CR8) 2018; 271
Lv, Wang (CR6) 2020
Panwalkar, Koulamas (CR10) 2015; 62
Wang, Cui, Ji, Liu (CR14) 2021; 41
Jiang, Zou, Bai, Wang (CR4) 2020; 52
Wang, Xu, Yang (CR19) 2018; 2018
Rossit, Tohmé, Frutos (CR12) 2018; 77
Sun, Geng, Liu (CR13) 2020; 292
Wang, Wang (CR18) 2013; 40
Mor, Mosheiov (CR7) 2014; 65
Neufeld, Gupta, Buscher (CR9) 2016; 70
Wang, Liu, Wang (CR16) 2019; 26
Graham, Lawler, Lenstra, Rinnooy Kan (CR2) 1979; 5
Wang, Zhang, Li, Bai, Feng (CR20) 2020; 52
SS Panwalkar (4414_CR11) 2013; 60
DA Rossit (4414_CR12) 2018; 77
D-Y Lv (4414_CR6) 2020
A Estévez-Fernández (4414_CR1) 2008; 11
J-B Wang (4414_CR17) 2011; 191
J-B Wang (4414_CR15) 2021; 53
J-B Wang (4414_CR19) 2018; 2018
RL Graham (4414_CR2) 1979; 5
4414_CR3
J-B Wang (4414_CR20) 2020; 52
B Mor (4414_CR7) 2014; 65
X Sun (4414_CR13) 2020; 292
JS Neufeld (4414_CR9) 2016; 70
J-B Wang (4414_CR14) 2021; 41
J-B Wang (4414_CR16) 2019; 26
J-B Wang (4414_CR18) 2013; 40
C Jiang (4414_CR4) 2020; 52
C Koulamas (4414_CR5) 2020; 284
G Mosheiov (4414_CR8) 2018; 271
SS Panwalkar (4414_CR10) 2015; 62
References_xml – volume: 52
  start-page: 37
  issue: 1
  year: 2020
  end-page: 52
  ident: CR4
  article-title: Proportional flowshop scheduling with position-dependent weights
  publication-title: Engineering Optimization
  doi: 10.1080/0305215X.2019.1573898
– volume: 191
  start-page: 155
  year: 2011
  end-page: 169
  ident: CR17
  article-title: Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
  publication-title: Annals of Operations Research
  doi: 10.1007/s10479-011-0923-2
– volume: 11
  start-page: 433
  year: 2008
  end-page: 447
  ident: CR1
  article-title: Proportionate flow shop games
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-008-0062-z
– ident: CR3
– volume: 62
  start-page: 595
  issue: 7
  year: 2015
  end-page: 603
  ident: CR10
  article-title: On equivalence between the proportionate flow shop and single-machine scheduling problems
  publication-title: Naval Research Logistics
  doi: 10.1002/nav.21666
– volume: 2018
  start-page: 12
  year: 2018
  ident: CR19
  article-title: Bi-criterion optimization for flow shop with a learning effect subject to release dates
  publication-title: Complexity
– volume: 52
  start-page: 185
  issue: 2
  year: 2020
  end-page: 193
  ident: CR20
  article-title: Due window assignment scheduling problems with position-dependent weights on a single machine
  publication-title: Engineering Optimization
  doi: 10.1080/0305215X.2019.1577411
– volume: 271
  start-page: 388
  year: 2018
  end-page: 400
  ident: CR8
  article-title: Two-machine flow shop and open shop scheduling problems with a single maintenance window
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2018.04.019
– volume: 292
  start-page: 113
  issue: 1
  year: 2020
  end-page: 131
  ident: CR13
  article-title: Due-window assignment scheduling in the proportionate flow shop setting
  publication-title: Annals of Operations Research
  doi: 10.1007/s10479-020-03653-1
– volume: 77
  start-page: 143
  year: 2018
  end-page: 153
  ident: CR12
  article-title: The non-permutation flow-shop scheduling problem: A literature review
  publication-title: Omega
  doi: 10.1016/j.omega.2017.05.010
– year: 2020
  ident: CR6
  article-title: Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
  publication-title: Optimization Letters
  doi: 10.1007/s11590-020-01670-4
– volume: 60
  start-page: 46
  year: 2013
  end-page: 55
  ident: CR11
  article-title: Review of the ordered and proportionate flow shop scheduling research
  publication-title: Naval Research Logistics
  doi: 10.1002/nav.21518
– volume: 53
  start-page: 496
  issue: 3
  year: 2021
  end-page: 512
  ident: CR15
  article-title: Common due-window assignment for single-machine scheduling with generalized earliness/tardiness penalties and a rate-modifying activity
  publication-title: Engineering Optimization
  doi: 10.1080/0305215X.2020.1740921
– volume: 40
  start-page: 547
  issue: 2
  year: 2013
  end-page: 557
  ident: CR18
  article-title: Minimizing makespan in three-machine flow shops with deteriorating jobs
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2012.08.006
– volume: 70
  start-page: 56
  year: 2016
  end-page: 74
  ident: CR9
  article-title: A comprehensive review of flowshop group scheduling literature
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2015.12.006
– volume: 284
  start-page: 439
  year: 2020
  end-page: 444
  ident: CR5
  article-title: The proportionate flow shop total tardiness problem
  publication-title: European Journal of Operational
  doi: 10.1016/j.ejor.2020.01.002
– volume: 65
  start-page: 151
  year: 2014
  end-page: 157
  ident: CR7
  article-title: Polynomial time solutions for scheduling problems on a proportionate flow shop with two competing agents
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/jors.2013.9
– volume: 5
  start-page: 287
  year: 1979
  end-page: 326
  ident: CR2
  article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey
  publication-title: Annals of Discrete Mathematics
  doi: 10.1016/S0167-5060(08)70356-X
– volume: 41
  start-page: 290
  year: 2021
  end-page: 303
  ident: CR14
  article-title: Research on scheduling with position-dependent weights and past-sequence-dependent delivery times
  publication-title: Journal of Combinatorial Optimization
  doi: 10.1007/s10878-020-00676-z
– volume: 26
  start-page: 1135
  issue: 3
  year: 2019
  end-page: 1151
  ident: CR16
  article-title: Research on m-machine flow shop scheduling with truncated learning effects
  publication-title: International Transactions in Operational Research
  doi: 10.1111/itor.12323
– volume: 77
  start-page: 143
  year: 2018
  ident: 4414_CR12
  publication-title: Omega
  doi: 10.1016/j.omega.2017.05.010
– volume: 191
  start-page: 155
  year: 2011
  ident: 4414_CR17
  publication-title: Annals of Operations Research
  doi: 10.1007/s10479-011-0923-2
– ident: 4414_CR3
– volume: 70
  start-page: 56
  year: 2016
  ident: 4414_CR9
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2015.12.006
– volume: 62
  start-page: 595
  issue: 7
  year: 2015
  ident: 4414_CR10
  publication-title: Naval Research Logistics
  doi: 10.1002/nav.21666
– volume: 292
  start-page: 113
  issue: 1
  year: 2020
  ident: 4414_CR13
  publication-title: Annals of Operations Research
  doi: 10.1007/s10479-020-03653-1
– volume: 53
  start-page: 496
  issue: 3
  year: 2021
  ident: 4414_CR15
  publication-title: Engineering Optimization
  doi: 10.1080/0305215X.2020.1740921
– volume: 284
  start-page: 439
  year: 2020
  ident: 4414_CR5
  publication-title: European Journal of Operational
  doi: 10.1016/j.ejor.2020.01.002
– volume: 52
  start-page: 37
  issue: 1
  year: 2020
  ident: 4414_CR4
  publication-title: Engineering Optimization
  doi: 10.1080/0305215X.2019.1573898
– volume: 40
  start-page: 547
  issue: 2
  year: 2013
  ident: 4414_CR18
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2012.08.006
– volume: 65
  start-page: 151
  year: 2014
  ident: 4414_CR7
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/jors.2013.9
– volume: 11
  start-page: 433
  year: 2008
  ident: 4414_CR1
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-008-0062-z
– volume: 60
  start-page: 46
  year: 2013
  ident: 4414_CR11
  publication-title: Naval Research Logistics
  doi: 10.1002/nav.21518
– volume: 26
  start-page: 1135
  issue: 3
  year: 2019
  ident: 4414_CR16
  publication-title: International Transactions in Operational Research
  doi: 10.1111/itor.12323
– volume: 5
  start-page: 287
  year: 1979
  ident: 4414_CR2
  publication-title: Annals of Discrete Mathematics
  doi: 10.1016/S0167-5060(08)70356-X
– volume: 2018
  start-page: 12
  year: 2018
  ident: 4414_CR19
  publication-title: Complexity
– volume: 52
  start-page: 185
  issue: 2
  year: 2020
  ident: 4414_CR20
  publication-title: Engineering Optimization
  doi: 10.1080/0305215X.2019.1577411
– year: 2020
  ident: 4414_CR6
  publication-title: Optimization Letters
  doi: 10.1007/s11590-020-01670-4
– volume: 271
  start-page: 388
  year: 2018
  ident: 4414_CR8
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2018.04.019
– volume: 41
  start-page: 290
  year: 2021
  ident: 4414_CR14
  publication-title: Journal of Combinatorial Optimization
  doi: 10.1007/s10878-020-00676-z
SSID ssj0001185
Score 2.3951235
Snippet In a recent study, Sun et al. (AOR 292:113–131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For...
In a recent study, Sun et al. (AOR 292:113-131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For...
SourceID proquest
gale
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 249
SubjectTerms Algorithms
Business and Management
Combinatorics
Job shop scheduling
Job shops
Machine shops
Management
Methods
Operations research
Operations Research/Decision Theory
Original Research
Scheduling
Scheduling (Management)
Theory of Computation
SummonAdditionalLinks – databaseName: SpringerLINK Contemporary 1997-Present
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LbxMxEB7RUlVwoDS0IlCQD616aC1t9mkfI0TFqUJAUW-W7XjTSGkSxRv695lxvGnTlwSXvXhseW3Pw-OZbwAOM0r7zpzGHSgEz7UuuSkry2VVp4kWvWqQ2VBsojo_F5eX8ntMCvNttHv7JBkk9Z1kt7ySnEIKEtThOc834CWqO0EFG378_L2Sv2gyh8BFvPpwip2MqTKPj7Gmju4L5Qevo0HpnO3833TfwptoZLL-8lTswgs36cB2G-PegZ22lgOLrN2B13eACd_BxdLX4AZMj4fT-ai5uvYMzVs2o6IK8-A_bByrx9Mb5q-mM4Z3ZNRZlNrOyLPLBgvHb_C6j-1onY-GIeZgDy7Ovv768o3HAgzcopXVcCdF5WrtbJYOpLOpEbJOXGpqWWtRiNJkxlgttEhMjmrfFD0njM1R_OsiK7I024fNyXTi3gMrHJmWKE8EAdY7IQuDxqI0Sa2TqtR5F3rtPigb0cmpSMZY3eIq04IqXFAVFlRhn5NVn9kSm-NZ6iPaXhWLe-LHk_vDD_XCe9UvhaQXUZl24TjQEYPjDKyOeQr4HwSVtUZ5sEaJjGnXm9uDpKJg8Irw_wWBPBZdOG0Pzm3z09P_8G_kH-FVSokaIb78ADab-cJ9gi37pxn5-efAMH8B16IN1A
  priority: 102
  providerName: Springer Nature
Title Improved algorithms for proportionate flow shop scheduling with due-window assignment
URI https://link.springer.com/article/10.1007/s10479-021-04414-4
https://www.proquest.com/docview/2620837795
Volume 309
WOSCitedRecordID wos000721423100002&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: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED-xDSF4YFBAFEblBxAPYC3Nl-0nNKZNSGhVtTEYvES243SVSlualP373LnOSkHshZeTIp8TR2effz7fB8DLhMK-E6dRApnkqdY5N7mwXIkqjrTsizKxvtiEGAzkxYUaBoNbHdwqW53oFXU5s2Qj36fE6ZKy42Xv5j84VY2i29VQQmMLdhDZ9Mml6yQeXmtiBM_ehREPQZy8KEPQTAidS4Xi5KAQISJIebqxMf2pnv-6J_Xbz_Hu_w78AdwPwJMdrGbKQ7jlph240_q9d2C3re_AwnLvwL3fkhU-gvOV_cGVTE9G-IHm8nvNEPKyORVaWHibYuNYNZldsfpyNmd4bsZ9jMLdGVl7Wbl0_Go8LbEdEft45P0QHsP58dGnww88FGXgFpFXw52SwlXa2SQulbOxkaqKXGwqVWmZydwkxlgttYxMilDAZH0njU1xS9BZkiVx8gS2p7OpewoscwQ3UcdISmLvpMoMAkhlokpHItdpF_qtRAobMpZT4YxJsc61TFIsUIqFl2KBfd5c95mv8nXcyP2KBF2Egp9IajKJ1CO9rOviIJeKbklV3IXXno8WPY7A6hC7gP9B6bM2OPc2OHGx2s3mdpIUQVnUxXqGdOFtO83Wzf8e_rOb3_Yc7sYUrOF9zPdgu1ks3Qu4bX8243rRgy3x5WsPdt4fDYan-PRRcKQn0WHPLyKi4gzpMPuG9PTs8y-BNx9Z
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NbxMxEB1VBfFxoBBABAr4QMUBrG720z4gVAFVq5aoh1bqzdhebxopJCHeEPGn-I3MOLsNAdFbD1z2Ynu13n37PB7PvAF4lVDad-I0foFM8FTrnJu8sFwWVRxp0SvKxIZiE0W_L87P5ckG_GxzYSissuXEQNTlxJKPfJeE0wWp42Xvp984VY2i09W2hMYSFkfuxwK3bP7d4Uf8vjtxvP_p9MMBb6oKcIumQ80d7rJdpZ1N4lI6Gxshq8jFppKVFpnITWKM1UKLyKS4lpms54SxKXKazpIsIaEDpPwbKSmLUahgfHLJ_Gish5BJ3HRxitpsknSaVL20kJwCIiK0QFKeri2Efy4Hf53LhuVuf-t_e1H34V5jWLO95Z_wADbcuAO32rj-Dmy19StYQ2cduPubGONDOFv6V1zJ9GiAE6ovvnqGJj2bUiGJWfCZ1o5Vo8mC-YvJlHnEe0mB_ANG3mxWzh1fDMcltuOOZDgIcRaP4OxaZv0YNseTsXsCLHNkTiOHChLpd0JmBg1kaaJKR0Wu0y70WgQo2yiyU2GQkVppSRNqFKJGBdQoHPPmcsx0qUdyZe8dApZqCprixZPLxw_03Hu1lwtJp8Ay7sLr0I9IDZ_A6iY3A-dB8mBrPbfXeiIZ2fXmFpSqIUOvVojswtsW1qvmfz_-06vv9hJuH5x-PlbHh_2jZ3AnpsSUEE-_DZv1bO6ew037vR762YvwmzL4ct1w_wXUOHf7
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LbxMxEB5VBVVwoBBApBTwgYoDWN3s0z4gVFEiqqIoBypVXBbb600jhSSNEyL-Gr-OGcfbEBC99cBlL_au1ruf5-VvZgBeJpT2nViFfyATPFUq5zovDJdFHUdKdIoqMb7ZRNHrifNz2d-Cn00uDNEqG5noBXU1MRQjP6TC6YKq42WHdaBF9I-776aXnDpI0Ulr005jBZFT-2OJ7pt7e3KM__ogjrsfPr__yEOHAW7QjJhzix63rZU1SVxJa2ItZB3ZWNeyViITuU60NkooEekU9ZrOOlZok6J8U1mSJVT0AMX_rQJ9TKIT9rMvV1oADXdPn0QHjBODMyTshLS9tJCcyBERWiMpTzeU4p-q4a8zWq_6urv_80e7D_eCwc2OVjvkAWzZcQt2Gr5_C3abvhYsiLkW3P2tSONDOFvFXWzF1GiAC5pffHMMTX02pQYTMx9LnVtWjyZL5i4mU-ZwH1RE8B8winKzamH5cjiucBw9leHA8y8ewdmNrPoxbI8nY_sEWGbJzEbZKqh4vxUy02g4Sx3VKipylbah06ChNKFSOzUMGZXrGtOEoBIRVHoElXjP66t7pqs6JdfOPiCQlaHRKV4chYLcQC2cK49yIel0WMZteOXnkbDDNzAq5GzgOqhs2MbM_Y2ZKKTM5nAD0DIISVeu0dmGNw3E18P_fv2965_2AnYQ5eWnk97pU7gTU76Kp9nvw_Z8trDP4Lb5Ph-62XO_Yxl8vWm0_wI9kIDn
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=Improved+algorithms+for+proportionate+flow+shop+scheduling+with+due-window+assignment&rft.jtitle=Annals+of+operations+research&rft.au=Qian%2C+Jin&rft.au=Han%2C+Haiyan&rft.date=2022-02-01&rft.pub=Springer+Nature+B.V&rft.issn=0254-5330&rft.eissn=1572-9338&rft.volume=309&rft.issue=1&rft.spage=249&rft.epage=258&rft_id=info:doi/10.1007%2Fs10479-021-04414-4&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0254-5330&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0254-5330&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0254-5330&client=summon