Semi-online scheduling with GoS eligibility constraints

We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest proce...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production economics Jg. 153; S. 204 - 214
Hauptverfasser: Lee, Kangbok, Hwang, Hark-Chin, Lim, Kyungkuk
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.07.2014
Elsevier Sequoia S.A
Schlagworte:
Algorithms
Competitive ratio
Economics
Grade of Service (GoS)
Job shops
Lower bound example
Lower bounds
Mathematical problems
Operations research
Optimization
Optimization algorithms
Production scheduling
Scheduling
Scheduling algorithms
Semi-online scheduling
Studies
Unified algorithm
Unified algorithm
Grade of Service (GoS)
Lower bound example
Semi-online scheduling
Competitive ratio
ISSN:0925-5273, 1873-7579
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest processing times and (4) the known optimal makespan. For semi-online problems with different numbers of machines and information, we present a unified algorithm. Then we provide lower bounds of the competitive ratio for any algorithm and prove the competitive ratio of the proposed algorithm.
AbstractList We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest processing times and (4) the known optimal makespan. For semi-online problems with different numbers of machines and information, we present a unified algorithm. Then we provide lower bounds of the competitive ratio for any algorithm and prove the competitive ratio of the proposed algorithm.
Author Lim, Kyungkuk
Lee, Kangbok
Hwang, Hark-Chin
Author_xml – sequence: 1
  givenname: Kangbok
  surname: Lee
  fullname: Lee, Kangbok
  email: klee5@york.cuny.edu
  organization: Department of Business and Economics, School of Business and Information Systems, York College, The City University of New York (CUNY), 94-20 Guy R. Brewer Blvd, Jamaica, NY 11451, United States
– sequence: 2
  givenname: Hark-Chin
  surname: Hwang
  fullname: Hwang, Hark-Chin
  email: hchwang@khu.ac.kr
  organization: School of Management, Kyung Hee University, 26 Kyunghee-daero, Dongdaemun-gu, Seoul 130-701, Republic of Korea
– sequence: 3
  givenname: Kyungkuk
  surname: Lim
  fullname: Lim, Kyungkuk
  email: lkkuk@postech.ac.kr
  organization: BK21 Project, Sogang Business School, Shinsu-dong 1, Mapo-gu, Seoul 121-742, Republic of Korea
BookMark eNp9kE1P3DAQQK0KJBboH-AUqZdeks7EySaReqkQpZWQOEDPlj8mMFHW3treIv49ibYnDpzGh_esmXcuTnzwJMQVQoWA229TxdOeqhqwqUBWAPhJbLDvZNm13XAiNjDUbdnWnTwT5ylNANBh329E90A7LoOf2VOR7DO5w_J8Kl44Pxe34aGgmZ_Y8Mz5tbDBpxw1-5wuxemo50Sf_88L8efnzeP1r_Lu_vb39Y-70jZ1m0uHLTVSG9ubsbbaaTegwaYZh8ZqgwOig8ZsJZJ0tG212RrUo4PBAtIwGnkhvh7_3cfw90Apqx0nS_OsPYVDUti2CJ1sunpBv7xDp3CIftluoeoBluP7leqPlI0hpUijspx15uDXy2aFoNaialJrUbUWVSDVUnRR63fqPvJOx9ePpe9HiZZK_5iiSpbJW3IcyWblAn-kvwGS9pG9
CODEN IJPCEY
CitedBy_id crossref_primary_10_1007_s00186_023_00830_3
crossref_primary_10_1007_s10878_022_00906_6
crossref_primary_10_1016_j_orl_2015_07_008
crossref_primary_10_1016_j_ijpe_2014_09_038
crossref_primary_10_1080_00207160_2014_922682
crossref_primary_10_1080_01605682_2017_1404185
crossref_primary_10_1142_S0217595919500027
crossref_primary_10_1016_j_cor_2021_105646
Cites_doi 10.1137/S0097539798346135
10.1016/S0305-0548(03)00164-3
10.1007/s10951-013-0329-x
10.1016/S0167-6377(02)00164-5
10.1016/j.ijpe.2011.07.021
10.1007/s10878-007-9095-z
10.1016/j.tcs.2011.05.029
10.1016/j.orl.2005.11.004
10.1631/jzus.2006.A0309
10.1006/jagm.1995.1008
10.1002/nav.20202
10.1007/s006070050020
10.1016/j.tcs.2009.08.014
10.1016/j.ijpe.2008.09.003
10.1007/s10288-010-0149-1
10.1016/j.tcs.2004.11.018
10.1002/nav.20286
10.1016/S0167-6377(98)00005-4
10.1016/j.ejor.2009.02.011
ContentType Journal Article
Copyright 2014 Elsevier B.V.
Copyright Elsevier Sequoia S.A. Jul 2014
Copyright_xml – notice: 2014 Elsevier B.V.
– notice: Copyright Elsevier Sequoia S.A. Jul 2014
DBID AAYXX
CITATION
7TA
7TB
8FD
FR3
JG9
KR7
7SC
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ijpe.2014.03.001
DatabaseName CrossRef
Materials Business File
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Materials Research Database
Civil Engineering Abstracts
Computer and Information Systems Abstracts
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Materials Research Database
Civil Engineering Abstracts
Engineering Research Database
Technology Research Database
Mechanical & Transportation Engineering Abstracts
Materials Business File
Computer and Information Systems Abstracts – Academic
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Materials Research Database

Materials Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Business
Economics
EISSN 1873-7579
EndPage 214
ExternalDocumentID 3316677121
10_1016_j_ijpe_2014_03_001
S0925527314000711
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFFL
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAPFB
AAQFI
AAQXK
AARIN
AAXUO
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACGOD
ACIWK
ACNNM
ACRLP
ACROA
ADBBV
ADEZE
ADFHU
ADMUD
ADTZH
AEBSH
AECPX
AEFWE
AEKER
AENEX
AEYQN
AFKWA
AFODL
AFTJW
AGHFR
AGTHC
AGUBO
AGYEJ
AHHHB
AHJVU
AI.
AIEXJ
AIIAU
AIKHN
AITUG
AJBFU
AJOXV
AJWLA
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ASPBG
AVWKF
AXJTR
AXLSJ
AZFZN
BEHZQ
BEZPJ
BGSCR
BJAXD
BKOJK
BKOMP
BLXMC
BNTGB
BPUDD
BULVW
BZJEE
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLX
HVGLF
HZ~
IHE
IXIXF
J1W
JJJVA
KOM
LG8
LY1
LY7
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SBM
SDF
SDG
SDP
SDS
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SSF
SST
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
YK3
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7TA
7TB
8FD
AGCQF
FR3
JG9
KR7
7SC
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c425t-d15e43abc8bf2cadad91b144f94cab1911d04b631e3de65ab6b1afd09c01e9fb3
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000337007900017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-5273
IngestDate Sat Sep 27 18:54:25 EDT 2025
Wed Aug 13 09:18:47 EDT 2025
Sat Nov 29 03:48:09 EST 2025
Tue Nov 18 22:54:54 EST 2025
Fri Feb 23 02:18:57 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Unified algorithm
Grade of Service (GoS)
Lower bound example
Semi-online scheduling
Competitive ratio
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c425t-d15e43abc8bf2cadad91b144f94cab1911d04b631e3de65ab6b1afd09c01e9fb3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 1529027382
PQPubID 45063
PageCount 11
ParticipantIDs proquest_miscellaneous_1551073472
proquest_journals_1529027382
crossref_citationtrail_10_1016_j_ijpe_2014_03_001
crossref_primary_10_1016_j_ijpe_2014_03_001
elsevier_sciencedirect_doi_10_1016_j_ijpe_2014_03_001
PublicationCentury 2000
PublicationDate 2014-07-01
PublicationDateYYYYMMDD 2014-07-01
PublicationDate_xml – month: 07
  year: 2014
  text: 2014-07-01
  day: 01
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle International journal of production economics
PublicationYear 2014
Publisher Elsevier B.V
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Sequoia S.A
References Park, Chang, Lee (bib17) 2006; 34
Lee, Leung, Pinedo (bib12) 2010; 8
Azar, Naor, Rom (bib1) 1995; 18
Jiang (bib8) 2008; 16
Ou, Leung, Li (bib16) 2008; 55
Glass, Kellerer (bib5) 2007; 54
Tan, He (bib18) 2002; 30
Bar-Noy, Freund, Naor (bib2) 2001; 31
Kellerer, Kotov, Speranza, Tuza (bib10) 1997; 21
Lee, Lim (bib11) 2013; 16
Leung, Li (bib13) 2008; 116
Tan, Zhang (bib19) 2011; 412
Li, Wang (bib14) 2010; 200
Jiang, He, Tang (bib9) 2006; 7
Cheng, Kellerer, Kotov (bib4) 2005; 337
He, Zhang (bib7) 1999; 62
Zhang, A., Jiang, Y.W., Tan, Z.Y., 2008. Optimal Algorithms for Online Hierarchical Scheduling on Parallel Machines, Technical Report, Zhejiang University.
Cai (bib3) 2002; 23
Hwang, Chang, Lee (bib6) 2004; 31
Wu, Huang, Yang (bib20) 2008; 35
Wu, Ji, Yang (bib21) 2012; 135
Lim, Chang, Lee (bib15) 2011; 412
Tan (10.1016/j.ijpe.2014.03.001_bib19) 2011; 412
Park (10.1016/j.ijpe.2014.03.001_bib17) 2006; 34
Tan (10.1016/j.ijpe.2014.03.001_bib18) 2002; 30
Cai (10.1016/j.ijpe.2014.03.001_bib3) 2002; 23
Kellerer (10.1016/j.ijpe.2014.03.001_bib10) 1997; 21
Azar (10.1016/j.ijpe.2014.03.001_bib1) 1995; 18
Jiang (10.1016/j.ijpe.2014.03.001_bib9) 2006; 7
Bar-Noy (10.1016/j.ijpe.2014.03.001_bib2) 2001; 31
10.1016/j.ijpe.2014.03.001_bib22
Wu (10.1016/j.ijpe.2014.03.001_bib20) 2008; 35
Ou (10.1016/j.ijpe.2014.03.001_bib16) 2008; 55
Leung (10.1016/j.ijpe.2014.03.001_bib13) 2008; 116
Li (10.1016/j.ijpe.2014.03.001_bib14) 2010; 200
Cheng (10.1016/j.ijpe.2014.03.001_bib4) 2005; 337
Hwang (10.1016/j.ijpe.2014.03.001_bib6) 2004; 31
Lee (10.1016/j.ijpe.2014.03.001_bib12) 2010; 8
Lim (10.1016/j.ijpe.2014.03.001_bib15) 2011; 412
Jiang (10.1016/j.ijpe.2014.03.001_bib8) 2008; 16
Wu (10.1016/j.ijpe.2014.03.001_bib21) 2012; 135
He (10.1016/j.ijpe.2014.03.001_bib7) 1999; 62
Glass (10.1016/j.ijpe.2014.03.001_bib5) 2007; 54
Lee (10.1016/j.ijpe.2014.03.001_bib11) 2013; 16
References_xml – volume: 23
  start-page: 1
  year: 2002
  end-page: 3
  ident: bib3
  article-title: Semi online scheduling on three identical machines
  publication-title: J. Wenzhou Teach. Coll.
– volume: 412
  start-page: 5211
  year: 2011
  end-page: 5224
  ident: bib15
  article-title: Improved bounds for online scheduling with eligibility constraints
  publication-title: Theor. Comput. Sci.
– reference: Zhang, A., Jiang, Y.W., Tan, Z.Y., 2008. Optimal Algorithms for Online Hierarchical Scheduling on Parallel Machines, Technical Report, Zhejiang University.
– volume: 337
  start-page: 134
  year: 2005
  end-page: 146
  ident: bib4
  article-title: Semi-on-line multiprocessor scheduling with given total processing time
  publication-title: Theor. Comput. Sci.
– volume: 34
  start-page: 692
  year: 2006
  end-page: 696
  ident: bib17
  article-title: Online and semi-online scheduling of two machines under a grade of service provision
  publication-title: Oper. Res. Lett.
– volume: 200
  start-page: 702
  year: 2010
  end-page: 710
  ident: bib14
  article-title: Scheduling parallel machines with inclusive processing set restrictions and job release times
  publication-title: Eur. J. Oper. Res.
– volume: 135
  start-page: 367
  year: 2012
  end-page: 371
  ident: bib21
  article-title: Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
  publication-title: Int. J. Prod. Econ.
– volume: 30
  start-page: 408
  year: 2002
  end-page: 414
  ident: bib18
  article-title: Semi-on-line problems on two identical machines with combined partial information
  publication-title: Oper. Res. Lett.
– volume: 31
  start-page: 527
  year: 2001
  end-page: 549
  ident: bib2
  article-title: Online load balancing in a hierarchical server topology
  publication-title: SIAM J. Comput.
– volume: 31
  start-page: 2055
  year: 2004
  end-page: 2061
  ident: bib6
  article-title: Parallel machine scheduling under a grade of service provision
  publication-title: Comput. Oper. Res.
– volume: 18
  start-page: 221
  year: 1995
  end-page: 237
  ident: bib1
  article-title: The competitiveness of online assignments
  publication-title: J. Algorithms
– volume: 116
  start-page: 251
  year: 2008
  end-page: 262
  ident: bib13
  article-title: Scheduling with processing set restrictions
  publication-title: Int. J. Prod. Econ.
– volume: 16
  start-page: 461
  year: 2013
  end-page: 477
  ident: bib11
  article-title: Semi-online scheduling problems on a small number of machines
  publication-title: J. Sched.
– volume: 62
  start-page: 179
  year: 1999
  end-page: 187
  ident: bib7
  article-title: Semi online scheduling on two identical machines
  publication-title: Computing
– volume: 7
  start-page: 309
  year: 2006
  end-page: 314
  ident: bib9
  article-title: Optimal online algorithms for scheduling on two identical machines under a grade of service
  publication-title: J. Zhejiang Univ. Sci. A
– volume: 21
  start-page: 235
  year: 1997
  end-page: 242
  ident: bib10
  article-title: Semi on-line algorithms for the partitioning problem
  publication-title: Oper. Res. Lett.
– volume: 55
  start-page: 328
  year: 2008
  end-page: 338
  ident: bib16
  article-title: Scheduling parallel machines with inclusive processing set restrictions
  publication-title: Naval Res. Logist.
– volume: 35
  start-page: 23
  year: 2008
  end-page: 26
  ident: bib20
  article-title: Semi-online multiprocessor scheduling with the longest processing time
  publication-title: J. Zhejiang Univ.: Sci. Ed.
– volume: 8
  start-page: 331
  year: 2010
  end-page: 364
  ident: bib12
  article-title: Makespan minimization in online scheduling with machine eligibility
  publication-title: 4OR
– volume: 54
  start-page: 250
  year: 2007
  end-page: 257
  ident: bib5
  article-title: Parallel machine scheduling with job assignment restrictions
  publication-title: Naval Res. Logist.
– volume: 16
  start-page: 28
  year: 2008
  end-page: 38
  ident: bib8
  article-title: Online scheduling on parallel machines with two GoS levels
  publication-title: J. Comb. Optim.
– volume: 412
  start-page: 246
  year: 2011
  end-page: 256
  ident: bib19
  article-title: Online hierarchical scheduling
  publication-title: Theor. Comput. Sci.
– volume: 31
  start-page: 527
  year: 2001
  ident: 10.1016/j.ijpe.2014.03.001_bib2
  article-title: Online load balancing in a hierarchical server topology
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539798346135
– volume: 31
  start-page: 2055
  year: 2004
  ident: 10.1016/j.ijpe.2014.03.001_bib6
  article-title: Parallel machine scheduling under a grade of service provision
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(03)00164-3
– volume: 16
  start-page: 461
  year: 2013
  ident: 10.1016/j.ijpe.2014.03.001_bib11
  article-title: Semi-online scheduling problems on a small number of machines
  publication-title: J. Sched.
  doi: 10.1007/s10951-013-0329-x
– volume: 30
  start-page: 408
  year: 2002
  ident: 10.1016/j.ijpe.2014.03.001_bib18
  article-title: Semi-on-line problems on two identical machines with combined partial information
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(02)00164-5
– volume: 35
  start-page: 23
  year: 2008
  ident: 10.1016/j.ijpe.2014.03.001_bib20
  article-title: Semi-online multiprocessor scheduling with the longest processing time
  publication-title: J. Zhejiang Univ.: Sci. Ed.
– volume: 135
  start-page: 367
  year: 2012
  ident: 10.1016/j.ijpe.2014.03.001_bib21
  article-title: Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2011.07.021
– volume: 16
  start-page: 28
  year: 2008
  ident: 10.1016/j.ijpe.2014.03.001_bib8
  article-title: Online scheduling on parallel machines with two GoS levels
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-007-9095-z
– volume: 412
  start-page: 5211
  year: 2011
  ident: 10.1016/j.ijpe.2014.03.001_bib15
  article-title: Improved bounds for online scheduling with eligibility constraints
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2011.05.029
– ident: 10.1016/j.ijpe.2014.03.001_bib22
– volume: 34
  start-page: 692
  year: 2006
  ident: 10.1016/j.ijpe.2014.03.001_bib17
  article-title: Online and semi-online scheduling of two machines under a grade of service provision
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2005.11.004
– volume: 7
  start-page: 309
  year: 2006
  ident: 10.1016/j.ijpe.2014.03.001_bib9
  article-title: Optimal online algorithms for scheduling on two identical machines under a grade of service
  publication-title: J. Zhejiang Univ. Sci. A
  doi: 10.1631/jzus.2006.A0309
– volume: 18
  start-page: 221
  year: 1995
  ident: 10.1016/j.ijpe.2014.03.001_bib1
  article-title: The competitiveness of online assignments
  publication-title: J. Algorithms
  doi: 10.1006/jagm.1995.1008
– volume: 54
  start-page: 250
  year: 2007
  ident: 10.1016/j.ijpe.2014.03.001_bib5
  article-title: Parallel machine scheduling with job assignment restrictions
  publication-title: Naval Res. Logist.
  doi: 10.1002/nav.20202
– volume: 62
  start-page: 179
  year: 1999
  ident: 10.1016/j.ijpe.2014.03.001_bib7
  article-title: Semi online scheduling on two identical machines
  publication-title: Computing
  doi: 10.1007/s006070050020
– volume: 412
  start-page: 246
  year: 2011
  ident: 10.1016/j.ijpe.2014.03.001_bib19
  article-title: Online hierarchical scheduling
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2009.08.014
– volume: 116
  start-page: 251
  year: 2008
  ident: 10.1016/j.ijpe.2014.03.001_bib13
  article-title: Scheduling with processing set restrictions
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2008.09.003
– volume: 23
  start-page: 1
  year: 2002
  ident: 10.1016/j.ijpe.2014.03.001_bib3
  article-title: Semi online scheduling on three identical machines
  publication-title: J. Wenzhou Teach. Coll.
– volume: 8
  start-page: 331
  year: 2010
  ident: 10.1016/j.ijpe.2014.03.001_bib12
  article-title: Makespan minimization in online scheduling with machine eligibility
  publication-title: 4OR
  doi: 10.1007/s10288-010-0149-1
– volume: 337
  start-page: 134
  year: 2005
  ident: 10.1016/j.ijpe.2014.03.001_bib4
  article-title: Semi-on-line multiprocessor scheduling with given total processing time
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2004.11.018
– volume: 55
  start-page: 328
  year: 2008
  ident: 10.1016/j.ijpe.2014.03.001_bib16
  article-title: Scheduling parallel machines with inclusive processing set restrictions
  publication-title: Naval Res. Logist.
  doi: 10.1002/nav.20286
– volume: 21
  start-page: 235
  year: 1997
  ident: 10.1016/j.ijpe.2014.03.001_bib10
  article-title: Semi on-line algorithms for the partitioning problem
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(98)00005-4
– volume: 200
  start-page: 702
  year: 2010
  ident: 10.1016/j.ijpe.2014.03.001_bib14
  article-title: Scheduling parallel machines with inclusive processing set restrictions and job release times
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2009.02.011
SSID ssj0007188
Score 2.1440885
Snippet We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 204
SubjectTerms Algorithms
Competitive ratio
Economics
Grade of Service (GoS)
Job shops
Lower bound example
Lower bounds
Mathematical problems
Operations research
Optimization
Optimization algorithms
Production scheduling
Scheduling
Scheduling algorithms
Semi-online scheduling
Studies
Unified algorithm
Title Semi-online scheduling with GoS eligibility constraints
URI https://dx.doi.org/10.1016/j.ijpe.2014.03.001
https://www.proquest.com/docview/1529027382
https://www.proquest.com/docview/1551073472
Volume 153
WOSCitedRecordID wos000337007900017&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-7579
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007188
  issn: 0925-5273
  databaseCode: AIEXJ
  dateStart: 19950301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdKhxA8IBggCgMFCfFSearjJE4eK9RR2FSQ2qG-WY5jo36Qdv0Y29_AP805dtJsiAoeeImqxIlS3-V-5_Pd7xB6CwgVaxrGOAvCDg60iLHQQuMoTcE5UOBhF8mYX8_YYBCPx8mXRuNnWQtzOWd5Hl9dJcv_Kmo4B8I2pbP_IO7qoXACfoPQ4Qhih-NfCX6ovk-wJcBow9IVoGReBVw_LIbtIge5SIm9Njnn66JJhOVzKr3Um2HCGrnE0vLDGpVRrqK58sldSs-pyL-li6r-p__DBaT7YjXDplt3Nd72cT69BnMz287q4QcSVKmqLiZW1sUM1cV2MRHt4XG3HmT0Q2wo3izaWBMbM4pZaFvIVDY4pHUrajsS_2bdbaBhejyZLg3DKQksPy3ZYVm5fz_4zE_Oz874qDce3bxqoZuSKGKM-OTd8gKbFmRmq971Y7mDDnwWJnETHXQ_9safKmAHGC-AvfxTrgbLpgvefqc_-Tm3EL9wY0aP0EO3_vC6Vm8eo4bKD9G9svzhED2oEVQ-QaymTN5OmTyjTB4ok1dTJq-mTE_R-Ulv9L6PXasNLMFob3BGQhVQkco41b4UmcgSksJaWyeBFCms6UnWCdKIEkUzFYUijVIidNZJZIeoRKf0GWrmi1w9Rx7zfSaN2yP9LKAySCTTSsMHKn0mNFMtRMqJ4dLx0JuXm_My4XDKzWRyM5m8Q03WZQu1q3uWloVl7-iwnG_u_EjrH3JQpL33HZXC4e7TWnPwb5OC88lvoTfVZbDBZmNN5GqxNWMA2RgNmP9i_yNeovu7b-gINTerrXqF7srLzWS9eu307Rcei6gV
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=Semi-online+scheduling+with+GoS+eligibility+constraints&rft.jtitle=International+journal+of+production+economics&rft.au=Lee%2C+Kangbok&rft.au=Hwang%2C+Hark-Chin&rft.au=Lim%2C+Kyungkuk&rft.date=2014-07-01&rft.pub=Elsevier+Sequoia+S.A&rft.issn=0925-5273&rft.eissn=1873-7579&rft.volume=153&rft.spage=204&rft_id=info:doi/10.1016%2Fj.ijpe.2014.03.001&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3316677121
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5273&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5273&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5273&client=summon