A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan

We address a two-machine flow shop on-line scheduling problem. Jobs arrive over time. Each job becomes available for processing at its release time after which it must be processed without preemption on the first machine and then on the second machine. The objective is to minimize the makespan. We p...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & operations research Ročník 51; s. 251 - 256
Hlavní autori: Liu, Peihai, Lu, Xiwen
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Kidlington Elsevier Ltd 01.11.2014
Elsevier
Pergamon Press Inc
Predmet:
Algorithms
Applied sciences
Competitive ratio
Exact sciences and technology
Flow shop
Inventory control, production control. Distribution
Job shops
Mathematical problems
Online
Operational research and scientific management
Operational research. Management science
Operations research
Optimization algorithms
Production scheduling
Scheduling
Scheduling algorithms
Scheduling, sequencing
Studies
Scheduling
Flow shop
Competitive ratio
Online
Preemption
On line
Multiple machine
Priority
Competitiveness
Processing time
Makespan
Competitive algorithms
Production management
Deterministic algorithms
Execution time
ISSN:0305-0548, 1873-765X, 0305-0548
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We address a two-machine flow shop on-line scheduling problem. Jobs arrive over time. Each job becomes available for processing at its release time after which it must be processed without preemption on the first machine and then on the second machine. The objective is to minimize the makespan. We provide a best possible deterministic on-line algorithm with a competitive ratio of (5+1)/2. Computational experiments on randomly generated problem instances are performed and the results show that the online algorithm is very useful to obtain near-optimal solutions.
AbstractList This paper addresses a two-machine flow shop on-line scheduling problem. Jobs arrive over time. Each job becomes available for processing at its release time after which it must be processed without preemption on the first machine and then on the second machine. The objective is to minimize the makespan. This paper provides a best possible deterministic on-line algorithm with a competitive ratio of (...5 + 1)/2. Computational experiments on randomly generated problem instances are performed and the results show that the online algorithm is very useful to obtain near-optimal solutions. (ProQuest: ... denotes formulae/symbols omitted.)
We address a two-machine flow shop on-line scheduling problem. Jobs arrive over time. Each job becomes available for processing at its release time after which it must be processed without preemption on the first machine and then on the second machine. The objective is to minimize the makespan. We provide a best possible deterministic on-line algorithm with a competitive ratio of (5+1)/2. Computational experiments on randomly generated problem instances are performed and the results show that the online algorithm is very useful to obtain near-optimal solutions.
Author Liu, Peihai
Lu, Xiwen
Author_xml – sequence: 1
  givenname: Peihai
  orcidid: 0000-0002-3963-1526
  surname: Liu
  fullname: Liu, Peihai
  email: pliu@ecust.edu.cn
– sequence: 2
  givenname: Xiwen
  surname: Lu
  fullname: Lu, Xiwen
  email: xwlu@ecust.edu.cn
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28741428$$DView record in Pascal Francis
BookMark eNp9kE1LxDAURYMoOH78AHcBcdmaNE2awZWIXyC4URBchDR9dTK2SU0yiv56M4y4cGE2d5Fz3uPdPbTtvAOEjigpKaHidFkaH8qK0LokosyxhWZUNqxoBH_aRjPCCC8Ir-Uu2otxSfJrKjpDz-e4hZjw5GO07QDYu2KwDrAeXnywaTHi3gecPnwxarNY__SD_8Bx4ScczQK6VcZfcPJ4tM6O9gvwqF8hTtodoJ1eDxEOf3IfPV5dPlzcFHf317cX53eFYVKkYq7bGljbkb5ilIEmlLK57BvBGmiNMFp2hut6TlpgPRfaCDnvqrZqWc27hhq2j443c6fg31b5GrX0q-DySkU5ryspOeOZOvmhdDR66IN2xkY1BTvq8Kkq2dQ0s5mjG86E3EmA_hehRK27VkuVu1brrhURKkd2mj-OsUkn610K2g7_mmcbE3JB7xaCisaCM9DZACapztt_7G9e2Zus
CODEN CMORAP
CitedBy_id crossref_primary_10_1016_j_cor_2021_105650
crossref_primary_10_3390_machines11020292
crossref_primary_10_1016_j_eswa_2022_118068
Cites_doi 10.1023/A:1009786526733
10.1002/nav.3800010110
10.1016/j.cor.2012.01.011
10.1007/BF01585870
10.1016/S0927-0507(05)80189-6
10.1016/S0167-5060(08)70743-X
10.1287/moor.10.4.576
10.1016/S0166-218X(00)00374-7
10.1057/palgrave.jors.2600481
ContentType Journal Article
Copyright 2014 Elsevier Ltd
2015 INIST-CNRS
Copyright Pergamon Press Inc. Nov 2014
Copyright_xml – notice: 2014 Elsevier Ltd
– notice: 2015 INIST-CNRS
– notice: Copyright Pergamon Press Inc. Nov 2014
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cor.2014.06.014
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology 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
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
Applied Sciences
EISSN 1873-765X
0305-0548
EndPage 256
ExternalDocumentID 3406676161
28741428
10_1016_j_cor_2014_06_014
S0305054814001725
Genre Feature
GrantInformation_xml – fundername: Fundamental Research Funds for the Central Universities
– fundername: National Nature Science Foundation of China
  grantid: 11101147; 11371137
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
186
1B1
1OL
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABEFU
ABFNM
ABFRF
ABJNI
ABMAC
ABMMH
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADJOM
ADMUD
AEBSH
AEFWE
AEHXG
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
AOUOD
APLSM
ARUGR
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
H~9
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
PRBVW
Q38
R2-
RIG
ROL
RPZ
RXW
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSO
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
UAO
UPT
VH1
WUQ
XFK
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
BNPGV
IQODW
SSH
7SC
8FD
AFXIZ
AGCQF
AGRNS
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c386t-9ab4e3bd0f2313ea011398f7637ebc6ca8dc5a490be3f56ac689d2b2b345d71c3
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000341473200023&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0305-0548
IngestDate Fri Jul 25 06:50:48 EDT 2025
Wed Apr 02 07:24:48 EDT 2025
Sat Nov 29 03:23:38 EST 2025
Tue Nov 18 22:32:59 EST 2025
Fri Feb 23 02:33:28 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Scheduling
Flow shop
Competitive ratio
Online
Preemption
On line
Multiple machine
Priority
Competitiveness
Processing time
Makespan
Competitive algorithms
Production management
Deterministic algorithms
Execution time
Language English
License CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c386t-9ab4e3bd0f2313ea011398f7637ebc6ca8dc5a490be3f56ac689d2b2b345d71c3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ORCID 0000-0002-3963-1526
PQID 1554288535
PQPubID 45870
PageCount 6
ParticipantIDs proquest_journals_1554288535
pascalfrancis_primary_28741428
crossref_primary_10_1016_j_cor_2014_06_014
crossref_citationtrail_10_1016_j_cor_2014_06_014
elsevier_sciencedirect_doi_10_1016_j_cor_2014_06_014
PublicationCentury 2000
PublicationDate 2014-11-01
PublicationDateYYYYMMDD 2014-11-01
PublicationDate_xml – month: 11
  year: 2014
  text: 2014-11-01
  day: 01
PublicationDecade 2010
PublicationPlace Kidlington
PublicationPlace_xml – name: Kidlington
– name: New York
PublicationTitle Computers & operations research
PublicationYear 2014
Publisher Elsevier Ltd
Elsevier
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Elsevier
– name: Pergamon Press Inc
References Kashyrskikh, Potts, Sevastianov (bib4) 2001; 114
Potts (bib8) 1985; 10
Tadei, Gupta, Della Croce, Cortesi (bib9) 1998; 49
Hall (bib2) 1998; 82
Chen, Vestjens, Woeginger (bib1) 1997; 1
Pawel, Kalczynski, Kamburowski (bib7) 2012; 39
Lenstra, Rinnooy Kan, Brucker (bib6) 1977; 1
Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Handbooks in operations research and management science, vol. 4; 1993. Amsterdam: North-Holland. p. 445–522.
Johnson (bib3) 1954; 1
Vestjens APA. On-line machine scheduling [Ph.D. thesis]. Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands; 1997.
Pawel (10.1016/j.cor.2014.06.014_bib7) 2012; 39
Kashyrskikh (10.1016/j.cor.2014.06.014_bib4) 2001; 114
10.1016/j.cor.2014.06.014_bib10
10.1016/j.cor.2014.06.014_bib5
Lenstra (10.1016/j.cor.2014.06.014_bib6) 1977; 1
Tadei (10.1016/j.cor.2014.06.014_bib9) 1998; 49
Hall (10.1016/j.cor.2014.06.014_bib2) 1998; 82
Potts (10.1016/j.cor.2014.06.014_bib8) 1985; 10
Chen (10.1016/j.cor.2014.06.014_bib1) 1997; 1
Johnson (10.1016/j.cor.2014.06.014_bib3) 1954; 1
References_xml – volume: 1
  start-page: 61
  year: 1954
  end-page: 68
  ident: bib3
  article-title: Optimal two- and three-stage production schedules with setup times included
  publication-title: Naval Res Logist
– volume: 1
  start-page: 343
  year: 1977
  end-page: 362
  ident: bib6
  article-title: Complexity of machine scheduling problems
  publication-title: Ann Discret Math
– volume: 82
  start-page: 175
  year: 1998
  end-page: 190
  ident: bib2
  article-title: Approximability of flow shop scheduling
  publication-title: Math Program
– reference: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Handbooks in operations research and management science, vol. 4; 1993. Amsterdam: North-Holland. p. 445–522.
– volume: 1
  start-page: 355
  year: 1997
  end-page: 365
  ident: bib1
  article-title: On-line scheduling of two-machine open shops where jobs arrive over time
  publication-title: J Comb Optim
– volume: 39
  start-page: 2659
  year: 2012
  end-page: 2665
  ident: bib7
  article-title: An empirical analysis of heuristics for solving the two-machine flow shop problem with release times
  publication-title: Comput Oper Res
– volume: 114
  start-page: 255
  year: 2001
  end-page: 271
  ident: bib4
  article-title: A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
  publication-title: Discret Appl Math
– volume: 49
  start-page: 77
  year: 1998
  end-page: 85
  ident: bib9
  article-title: Minimising makespan in the two-machine flow-shop with release times
  publication-title: J Oper Res Soc
– reference: Vestjens APA. On-line machine scheduling [Ph.D. thesis]. Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands; 1997.
– volume: 10
  start-page: 576
  year: 1985
  end-page: 584
  ident: bib8
  article-title: Analysis of heuristics for two-machine flow-shop sequencing subject to release dates
  publication-title: Math Oper Res
– volume: 1
  start-page: 355
  issue: 4
  year: 1997
  ident: 10.1016/j.cor.2014.06.014_bib1
  article-title: On-line scheduling of two-machine open shops where jobs arrive over time
  publication-title: J Comb Optim
  doi: 10.1023/A:1009786526733
– volume: 1
  start-page: 61
  issue: 1
  year: 1954
  ident: 10.1016/j.cor.2014.06.014_bib3
  article-title: Optimal two- and three-stage production schedules with setup times included
  publication-title: Naval Res Logist
  doi: 10.1002/nav.3800010110
– volume: 39
  start-page: 2659
  year: 2012
  ident: 10.1016/j.cor.2014.06.014_bib7
  article-title: An empirical analysis of heuristics for solving the two-machine flow shop problem with release times
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2012.01.011
– volume: 82
  start-page: 175
  issue: 1–2
  year: 1998
  ident: 10.1016/j.cor.2014.06.014_bib2
  article-title: Approximability of flow shop scheduling
  publication-title: Math Program
  doi: 10.1007/BF01585870
– ident: 10.1016/j.cor.2014.06.014_bib5
  doi: 10.1016/S0927-0507(05)80189-6
– ident: 10.1016/j.cor.2014.06.014_bib10
– volume: 1
  start-page: 343
  year: 1977
  ident: 10.1016/j.cor.2014.06.014_bib6
  article-title: Complexity of machine scheduling problems
  publication-title: Ann Discret Math
  doi: 10.1016/S0167-5060(08)70743-X
– volume: 10
  start-page: 576
  issue: 4
  year: 1985
  ident: 10.1016/j.cor.2014.06.014_bib8
  article-title: Analysis of heuristics for two-machine flow-shop sequencing subject to release dates
  publication-title: Math Oper Res
  doi: 10.1287/moor.10.4.576
– volume: 114
  start-page: 255
  issue: 1–3
  year: 2001
  ident: 10.1016/j.cor.2014.06.014_bib4
  article-title: A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
  publication-title: Discret Appl Math
  doi: 10.1016/S0166-218X(00)00374-7
– volume: 49
  start-page: 77
  year: 1998
  ident: 10.1016/j.cor.2014.06.014_bib9
  article-title: Minimising makespan in the two-machine flow-shop with release times
  publication-title: J Oper Res Soc
  doi: 10.1057/palgrave.jors.2600481
SSID ssj0000721
Score 2.1145675
Snippet We address a two-machine flow shop on-line scheduling problem. Jobs arrive over time. Each job becomes available for processing at its release time after which...
This paper addresses a two-machine flow shop on-line scheduling problem. Jobs arrive over time. Each job becomes available for processing at its release time...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 251
SubjectTerms Algorithms
Applied sciences
Competitive ratio
Exact sciences and technology
Flow shop
Inventory control, production control. Distribution
Job shops
Mathematical problems
Online
Operational research and scientific management
Operational research. Management science
Operations research
Optimization algorithms
Production scheduling
Scheduling
Scheduling algorithms
Scheduling, sequencing
Studies
Title A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
URI https://dx.doi.org/10.1016/j.cor.2014.06.014
https://www.proquest.com/docview/1554288535
Volume 51
WOSCitedRecordID wos000341473200023&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fi9NAEF5qT0QRf1TF6nnsg0-WSNJssruPRU5U5BA8oSAYks3mmrNNQtu7Hv71zmx203rqoYIvoVmabuj3ZWZ2M_MNIc8jgaLsPvMUuH-PySDzxDiVHs95nkH8EfE8N80m-NGRmE7lh17vi6uFOZ_zqhIXF7L5r1DDGICNpbN_AXf3ozAAnwF0OALscPwj4CejDCz9qKmR7Zg6WHkmlEznJ_WyXM8WbWbhpvYWJpFSj4p5vRmtZnUzgqUuuB5ToQ4xKcqOLMpvmOL6VYPlqXYjWdcOYmXIUzd6aZPqrHxQt838vjxrE4HLWVp2g2ZsWm5sJZrddwiYLcDrNsNcQcw2-8gUYWEuYNSKZ77UrU0VPPR4HE13ja5VmbVW055pexb_0ra32wynAA3quAbM6K62FaiXJLM_4m3gXcDqEde40TWyN-aRFH2yN3l7OH239dXcVOZ1t-3ee5sMwEsT_S5yud2kK3ieirYRyk8-3QQqx_fIHbvCoJOWGfdJT1cDcsMVOAzIXYcctXZ9QG7tqFI-IJ8nFBlEHYOoZRDtGESBQXSHQRQZRJFBdMsguq6pYxB1DHpIPr0-PH71xrM9ODwVinjtyTRjOsxyv4CFQKhTcAehFAV4Ja4zFatU5CpKmfQzHRZRnKpYyHycjbOQRTkPVPiI9Ku60o8J9TNf5UwWmscpK3QgZCyE5LgloZVk_pD47v9NlBWoxz4p88RlIp4mAEmCkCSYjRmwIXnRXdK06ixXfZk50BIbXrZhYwIMu-qygx8A7ibCThGoVzgk-w7xxNqBVYJh-lhALBw9-bdpn5Kb26dun_TXyzP9jFxX5-tytTywPP4O-MCzOw
linkProvider Elsevier
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=A+best+possible+on-line+algorithm+for+two-machine+flow+shop+scheduling+to+minimize+makespan&rft.jtitle=Computers+%26+operations+research&rft.au=Liu%2C+Peihai&rft.au=Lu%2C+Xiwen&rft.date=2014-11-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=51&rft.spage=251&rft.epage=256&rft_id=info:doi/10.1016%2Fj.cor.2014.06.014&rft.externalDocID=S0305054814001725
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon