Polynomial time approximation schemes for general multiprocessor job shop scheduling

We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most μ ordered operations that can be processed on different (possibly all) subsets of m machines with different processing times, compute a schedul...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of algorithms Ročník 45; číslo 2; s. 167 - 191
Hlavní autori: Jansen, Klaus, Porkolab, Lorant
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: San Diego, CA Elsevier Inc 01.11.2002
Elsevier
Predmet:
Applied sciences
Computer science; control theory; systems
Computer systems performance. Reliability
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Scheduling, sequencing
Software
Polynomial
Minimum
Scheme
Polynomial approximation
Job shop
Processing time
Process
Makespan
Approximation algorithm
Machine
Result
Numerical approximation
Multiprocessor
Accuracy
Development
Shift
Order
Linear programming
Scheduling
Algorithm
Flow
Polynomial time
Optimal solution
Schedule
Models
Problem
ISSN:0196-6774, 1090-2678
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most μ ordered operations that can be processed on different (possibly all) subsets of m machines with different processing times, compute a schedule (preemptive or non-preemptive, depending on the model) with minimum makespan where operations belonging to the same task have to be scheduled according to the specified order. We propose algorithms for both preemptive and non-preemptive variants of this problem that compute approximate solutions of any positive ϵ accuracy and run in O( n) time for any fixed values of m, μ, and  ϵ. These results include (as special cases) many recent developments on polynomial time approximation schemes for scheduling jobs on unrelated machines, multiprocessor tasks, and classical open, flow and job shops.
AbstractList We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most μ ordered operations that can be processed on different (possibly all) subsets of m machines with different processing times, compute a schedule (preemptive or non-preemptive, depending on the model) with minimum makespan where operations belonging to the same task have to be scheduled according to the specified order. We propose algorithms for both preemptive and non-preemptive variants of this problem that compute approximate solutions of any positive ϵ accuracy and run in O( n) time for any fixed values of m, μ, and  ϵ. These results include (as special cases) many recent developments on polynomial time approximation schemes for scheduling jobs on unrelated machines, multiprocessor tasks, and classical open, flow and job shops.
Author Jansen, Klaus
Porkolab, Lorant
Author_xml – sequence: 1
  givenname: Klaus
  surname: Jansen
  fullname: Jansen, Klaus
  email: kj@informatik.uni-kiel.de
  organization: Institute for Computer Science and Applied Mathematics, University of Kiel, Kiel, Germany
– sequence: 2
  givenname: Lorant
  surname: Porkolab
  fullname: Porkolab, Lorant
  email: porkolab@doc.ic.ac.uk
  organization: Department of Computing, Imperial College, London, United Kingdom
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14466985$$DView record in Pascal Francis
BookMark eNqFkE1LxDAQhoOs4PrxE4ReBD1UZ9I0bfEgIn6BoKCeQ5pMdyNtU5Iq-u-tu-LBy54Ghuedj2eXzXrfE2OHCKcIKM-eASuZyqIQx8BPALgoU9xic4QKUi6Lcsbmf8gO243xDQAxF9WcvTz59qv3ndNtMrqOEj0MwX-6To_O90k0S-ooJo0PyYJ6ChPWvbejmyBDMU7tN18ncemHFWvfW9cv9tl2o9tIB791j73eXL9c3aUPj7f3V5cPqREZH1OLOQjSYFFwtJBlZZPVteS1lTlVprTcNrIBqupSFryoCTTlWINAnqOUPNtjR-u5g45Gt03QvXFRDWE6P3wpFELKqswn7nzNmeBjDNQo48bVg2PQrlUI6kekWolUP5YUcLUSqXBK5__Sfws25C7WOZoUfDgKKhpHvSHrAplRWe82TPgGv4OOGQ
CODEN JOALDV
CitedBy_id crossref_primary_10_1016_j_cie_2008_09_011
crossref_primary_10_1007_s10951_008_0089_1
crossref_primary_10_1007_s00453_007_9086_6
Cites_doi 10.1287/opre.45.2.288
10.1016/S0304-3975(00)00260-7
10.1016/0020-0190(92)90172-R
10.1287/moor.21.2.321
10.1023/A:1009794729459
10.1137/S0097539793255801
10.1007/BF01585871
10.1016/0166-218X(94)90012-4
10.1007/s00453-001-0076-9
10.1137/S0097539798348110
10.1137/S0895480199326104
10.1287/moor.26.2.324.10559
10.1016/0377-2217(96)00123-3
10.1007/BF02057160
10.1016/0304-3975(94)90152-X
10.1109/TC.1986.1676781
10.1137/S009753979222676X
10.1287/moor.25.4.645.12118
10.1007/BF01585870
10.1007/s00453-001-0085-8
10.1137/0402042
10.1002/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H
10.1287/moor.1.2.117
10.1016/0097-3165(76)90001-7
ContentType Journal Article
Copyright 2002 Elsevier Science (USA)
2003 INIST-CNRS
Copyright_xml – notice: 2002 Elsevier Science (USA)
– notice: 2003 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1016/S0196-6774(02)00248-1
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1090-2678
EndPage 191
ExternalDocumentID 14466985
10_1016_S0196_6774_02_00248_1
S0196677402002481
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABMAC
ABTAH
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADFGL
ADGUI
ADIYS
ADJOM
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
DM4
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FA8
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
KOM
LG5
LX9
M25
MHUIS
MO0
MVM
N9A
O-L
O9-
OAUVE
OZT
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SEW
SME
SPC
SSV
SSW
SSZ
T5K
TN5
TWZ
UPT
UQL
WUQ
XJT
XPP
YQT
ZCA
ZU3
ZY4
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
IQODW
SSH
ID FETCH-LOGICAL-c432t-d1504ea0d1421d0338f3bb62bd65e9c8d2df6f0e9b86727be0ae51b0412516623
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000180057800005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0196-6774
IngestDate Mon Jul 21 09:12:38 EDT 2025
Tue Nov 18 21:21:35 EST 2025
Sat Nov 29 03:01:56 EST 2025
Fri Feb 23 02:22:55 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Polynomial
Minimum
Scheme
Polynomial approximation
Job shop
Processing time
Process
Makespan
Approximation algorithm
Machine
Result
Numerical approximation
Multiprocessor
Accuracy
Development
Shift
Order
Linear programming
Scheduling
Algorithm
Flow
Polynomial time
Optimal solution
Schedule
Models
Problem
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c432t-d1504ea0d1421d0338f3bb62bd65e9c8d2df6f0e9b86727be0ae51b0412516623
PageCount 25
ParticipantIDs pascalfrancis_primary_14466985
crossref_citationtrail_10_1016_S0196_6774_02_00248_1
crossref_primary_10_1016_S0196_6774_02_00248_1
elsevier_sciencedirect_doi_10_1016_S0196_6774_02_00248_1
PublicationCentury 2000
PublicationDate 2002-11-01
PublicationDateYYYYMMDD 2002-11-01
PublicationDate_xml – month: 11
  year: 2002
  text: 2002-11-01
  day: 01
PublicationDecade 2000
PublicationPlace San Diego, CA
PublicationPlace_xml – name: San Diego, CA
PublicationTitle Journal of algorithms
PublicationYear 2002
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
References Lepere, Trystram, Woeginger (BIB029) 2001; 2161
Williamson, Hall, Hoogeveen, Hurkens, Lenstra, Sevastianov, Shmoys (BIB036) 1997; 45
Blazewicz, Drabowski, Weglarz (BIB005) 1986; C-35
Feldmann, Kao, Sgall, Teng (BIB013) 1998; 1
Ludwig, Tiwari (BIB030) 1994
Goldberg, Paterson, Srinivasan, Sweedyk (BIB017) 2001; 14
Schwiegelshohn (BIB031) 1996; 1136
Shmoys, Stein, Wein (BIB032) 1994; 23
Sevastianov, Woeginger (BIB033) 1998; 82
Garey, Graham, Johnson, Yao (BIB015) 1976; 21
Drozdowski (BIB011) 1996; 94
Hoogeveen, van de Velde, Veltman (BIB020) 1994; 55
Chen, Lee (BIB008) 1999; 46
Jansen, Mastrolilli, Solis-Oba (BIB021) 2000; 1776
Jansen, Porkolab (BIB023) 2001; 26
Jansen, Solis-Oba, Sviridenko (BIB026) 1999; 1671
Jansen, Porkolab (BIB024) 1999; 1663
Kenyon, Remila (BIB027) 2000; 25
Bischof, Mayr (BIB003) 2001; 268
Hall (BIB019) 1998; 82
Du, Leung (BIB012) 1989; 2
Brucker (BIB006) 1998
Chakrabarti, Muthukrishnan (BIB007) 1996
Jansen, Porkolab (BIB022) 2002; 32
Lawler, Lenstra, Rinnoy Kan, Shmoys (BIB028) 1993; 4
Amoura, Bampis, Kenyon, Manoussakis (BIB001) 2002; 32
Drozdowski (BIB010) 1995; 43
Steinberg (BIB034) 1997; 26
Turek, Wolf, Yu (BIB035) 1992
Bianco, Blazewicz, Dell Olmo, Drozdowski (BIB002) 1995; 58
Grigoriadis, Khachiyan (BIB018) 1996; 21
Chen, Miranda (BIB009) 2001; 31
Garey, Johnson, Sethi (BIB016) 1976; 1
Blazewicz, Dell Olmo, Drozdowski, Speranza (BIB004) 1992; 41
Jansen, Solis-Oba, Sviridenko (BIB025) 1999
Feldmann, Sgall, Teng (BIB014) 1994; 130
Turek (10.1016/S0196-6774(02)00248-1_BIB035) 1992
Schwiegelshohn (10.1016/S0196-6774(02)00248-1_BIB031) 1996; 1136
Hall (10.1016/S0196-6774(02)00248-1_BIB019) 1998; 82
Bianco (10.1016/S0196-6774(02)00248-1_BIB002) 1995; 58
Bischof (10.1016/S0196-6774(02)00248-1_BIB003) 2001; 268
Blazewicz (10.1016/S0196-6774(02)00248-1_BIB004) 1992; 41
Chen (10.1016/S0196-6774(02)00248-1_BIB009) 2001; 31
Du (10.1016/S0196-6774(02)00248-1_BIB012) 1989; 2
Kenyon (10.1016/S0196-6774(02)00248-1_BIB027) 2000; 25
Sevastianov (10.1016/S0196-6774(02)00248-1_BIB033) 1998; 82
Hoogeveen (10.1016/S0196-6774(02)00248-1_BIB020) 1994; 55
Jansen (10.1016/S0196-6774(02)00248-1_BIB026) 1999; 1671
Garey (10.1016/S0196-6774(02)00248-1_BIB015) 1976; 21
Drozdowski (10.1016/S0196-6774(02)00248-1_BIB011) 1996; 94
Chen (10.1016/S0196-6774(02)00248-1_BIB008) 1999; 46
Steinberg (10.1016/S0196-6774(02)00248-1_BIB034) 1997; 26
Garey (10.1016/S0196-6774(02)00248-1_BIB016) 1976; 1
Jansen (10.1016/S0196-6774(02)00248-1_BIB021) 2000; 1776
Jansen (10.1016/S0196-6774(02)00248-1_BIB025) 1999
Jansen (10.1016/S0196-6774(02)00248-1_BIB022) 2002; 32
Shmoys (10.1016/S0196-6774(02)00248-1_BIB032) 1994; 23
Feldmann (10.1016/S0196-6774(02)00248-1_BIB014) 1994; 130
Goldberg (10.1016/S0196-6774(02)00248-1_BIB017) 2001; 14
Jansen (10.1016/S0196-6774(02)00248-1_BIB023) 2001; 26
Drozdowski (10.1016/S0196-6774(02)00248-1_BIB010) 1995; 43
Ludwig (10.1016/S0196-6774(02)00248-1_BIB030) 1994
Chakrabarti (10.1016/S0196-6774(02)00248-1_BIB007) 1996
Williamson (10.1016/S0196-6774(02)00248-1_BIB036) 1997; 45
Lawler (10.1016/S0196-6774(02)00248-1_BIB028) 1993; 4
Amoura (10.1016/S0196-6774(02)00248-1_BIB001) 2002; 32
Brucker (10.1016/S0196-6774(02)00248-1_BIB006) 1998
Jansen (10.1016/S0196-6774(02)00248-1_BIB024) 1999; 1663
Lepere (10.1016/S0196-6774(02)00248-1_BIB029) 2001; 2161
Feldmann (10.1016/S0196-6774(02)00248-1_BIB013) 1998; 1
Grigoriadis (10.1016/S0196-6774(02)00248-1_BIB018) 1996; 21
Blazewicz (10.1016/S0196-6774(02)00248-1_BIB005) 1986; C-35
References_xml – volume: 1671
  start-page: 177
  year: 1999
  end-page: 188
  ident: BIB026
  article-title: A linear time approximation scheme for the job shop scheduling problem
  publication-title: Proceedings of the 2nd Workshop on Approximation Algorithms
– volume: 25
  start-page: 645
  year: 2000
  end-page: 656
  ident: BIB027
  article-title: Approximate strip packing
  publication-title: Math. Oper. Res.
– volume: C-35
  start-page: 389
  year: 1986
  end-page: 393
  ident: BIB005
  article-title: Scheduling multiprocessor tasks to minimize schedule length
  publication-title: IEEE Trans. Comput.
– volume: 23
  start-page: 617
  year: 1994
  end-page: 632
  ident: BIB032
  article-title: Improved approximation algorithms for shop scheduling problems
  publication-title: SIAM J. Comput.
– start-page: 329
  year: 1996
  end-page: 335
  ident: BIB007
  article-title: Resource scheduling for parallel database and scientific applications
  publication-title: Proceedings of the 8th ACM Symposium on Parallel Algorithms and Architectures
– volume: 94
  start-page: 215
  year: 1996
  end-page: 230
  ident: BIB011
  article-title: Scheduling multiprocessor tasks—an overview
  publication-title: European J. Oper. Res.
– volume: 2161
  start-page: 146
  year: 2001
  end-page: 157
  ident: BIB029
  article-title: Approximation algorithms for scheduling malleable tasks under precedence constraints
  publication-title: Proceedings of the 9th European Symposium on Algorithms
– year: 1998
  ident: BIB006
  publication-title: Scheduling Algorithms
– volume: 41
  start-page: 275
  year: 1992
  end-page: 280
  ident: BIB004
  article-title: Scheduling multiprocessor tasks on the three dedicated processors
  publication-title: Inform. Process. Lett.
– volume: 1776
  start-page: 68
  year: 2000
  end-page: 77
  ident: BIB021
  article-title: Approximation algorithms for flexible job shop problems
  publication-title: Proceedings of the 4th Latin American Theoretical Informatics
– volume: 1
  start-page: 117
  year: 1976
  end-page: 129
  ident: BIB016
  article-title: The complexity of flowshop and jobshop scheduling
  publication-title: Math. Oper. Res.
– volume: 82
  start-page: 191
  year: 1998
  end-page: 198
  ident: BIB033
  article-title: Makespan minimization in open shops: A polynomial time approximation scheme
  publication-title: Math. Programming
– volume: 32
  start-page: 507
  year: 2002
  end-page: 520
  ident: BIB022
  article-title: Linear-time approximation schemes for scheduling malleable parallel tasks
  publication-title: Algorithmica
– start-page: 323
  year: 1992
  end-page: 332
  ident: BIB035
  article-title: Approximate algorithms for scheduling parallelizable tasks
  publication-title: Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures
– start-page: 394
  year: 1999
  end-page: 399
  ident: BIB025
  article-title: Makespan minimization in job shops: a polynomial time approximation scheme
  publication-title: Proceedings of the 31st ACM Symposium on the Theory of Computing
– volume: 45
  start-page: 288
  year: 1997
  end-page: 294
  ident: BIB036
  article-title: Short shop schedules
  publication-title: Oper. Res.
– volume: 21
  start-page: 321
  year: 1996
  end-page: 340
  ident: BIB018
  article-title: Coordination complexity of parallel price-directive decomposition
  publication-title: Math. Oper. Res.
– volume: 14
  start-page: 67
  year: 2001
  end-page: 92
  ident: BIB017
  article-title: Better approximation guarantees for job-shop scheduling
  publication-title: SIAM J. Discrete Math.
– volume: 268
  start-page: 67
  year: 2001
  end-page: 90
  ident: BIB003
  article-title: On-line scheduling of parallel jobs with runtime restrictions
  publication-title: Theoret. Comput. Sci.
– volume: 1663
  start-page: 110
  year: 1999
  end-page: 121
  ident: BIB024
  article-title: General multiprocessor task scheduling: approximate solution in linear time
  publication-title: Proceedings of the 6th International Workshop on Algorithms and Data Structures
– volume: 130
  start-page: 49
  year: 1994
  end-page: 72
  ident: BIB014
  article-title: Dynamic scheduling on parallel machines
  publication-title: Theoret. Comput. Sci.
– volume: 26
  start-page: 324
  year: 2001
  end-page: 338
  ident: BIB023
  article-title: Improved approximation schemes for scheduling unrelated parallel machines
  publication-title: Math. Oper. Res.
– volume: 1136
  start-page: 39
  year: 1996
  end-page: 51
  ident: BIB031
  article-title: Preemptive weighted completion time scheduling of parallel jobs
  publication-title: Proceedings of the 4th European Symposium of Algorithms
– volume: 4
  year: 1993
  ident: BIB028
  article-title: Sequencing and scheduling: algorithms and complexity
  publication-title: Handbook Oper. Res. Management Sci.
– volume: 58
  start-page: 493
  year: 1995
  end-page: 517
  ident: BIB002
  article-title: Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
  publication-title: Ann. Oper. Res.
– volume: 21
  start-page: 257
  year: 1976
  end-page: 298
  ident: BIB015
  article-title: Resource constrained scheduling as generalized bin packing
  publication-title: J. Combin. Theory Ser. A
– volume: 2
  start-page: 473
  year: 1989
  end-page: 487
  ident: BIB012
  article-title: Complexity of scheduling parallel task systems
  publication-title: SIAM J. Discrete Math.
– volume: 55
  start-page: 259
  year: 1994
  end-page: 272
  ident: BIB020
  article-title: Complexity of scheduling multiprocessor tasks with prespecified processor allocations
  publication-title: Discrete Appl. Math.
– volume: 43
  start-page: 381
  year: 1995
  end-page: 392
  ident: BIB010
  article-title: On the complexity of multiprocessor task scheduling
  publication-title: Bull. Polish Acad. Sci.
– volume: 26
  start-page: 401
  year: 1997
  end-page: 409
  ident: BIB034
  article-title: A strip-packing algorithm with absolute performance bound two
  publication-title: SIAM J. Comput.
– start-page: 167
  year: 1994
  end-page: 176
  ident: BIB030
  article-title: Scheduling malleable and nonmalleable parallel tasks
  publication-title: Proceedings of the 5th ACM–SIAM Symposium on Discrete Algorithms
– volume: 46
  start-page: 57
  year: 1999
  end-page: 74
  ident: BIB008
  article-title: General multiprocessor tasks scheduling
  publication-title: Naval Res. Logist.
– volume: 31
  start-page: 1
  year: 2001
  end-page: 17
  ident: BIB009
  article-title: A polynomial time approximation scheme for general multiprocessor job scheduling
  publication-title: SIAM J. Comput.
– volume: 82
  start-page: 175
  year: 1998
  end-page: 190
  ident: BIB019
  article-title: Approximability of flow shop scheduling
  publication-title: Math. Programming
– volume: 1
  start-page: 393
  year: 1998
  end-page: 411
  ident: BIB013
  article-title: Optimal online scheduling of parallel jobs with dependencies
  publication-title: J. Combin. Optim.
– volume: 32
  start-page: 247
  year: 2002
  end-page: 261
  ident: BIB001
  article-title: Scheduling independent multiprocessor tasks
  publication-title: Algorithmica
– volume: 45
  start-page: 288
  year: 1997
  ident: 10.1016/S0196-6774(02)00248-1_BIB036
  article-title: Short shop schedules
  publication-title: Oper. Res.
  doi: 10.1287/opre.45.2.288
– volume: 268
  start-page: 67
  year: 2001
  ident: 10.1016/S0196-6774(02)00248-1_BIB003
  article-title: On-line scheduling of parallel jobs with runtime restrictions
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(00)00260-7
– volume: 41
  start-page: 275
  year: 1992
  ident: 10.1016/S0196-6774(02)00248-1_BIB004
  article-title: Scheduling multiprocessor tasks on the three dedicated processors
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(92)90172-R
– volume: 21
  start-page: 321
  year: 1996
  ident: 10.1016/S0196-6774(02)00248-1_BIB018
  article-title: Coordination complexity of parallel price-directive decomposition
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.21.2.321
– volume: 1
  start-page: 393
  issue: 4
  year: 1998
  ident: 10.1016/S0196-6774(02)00248-1_BIB013
  article-title: Optimal online scheduling of parallel jobs with dependencies
  publication-title: J. Combin. Optim.
  doi: 10.1023/A:1009794729459
– volume: 4
  year: 1993
  ident: 10.1016/S0196-6774(02)00248-1_BIB028
  article-title: Sequencing and scheduling: algorithms and complexity
– volume: 26
  start-page: 401
  year: 1997
  ident: 10.1016/S0196-6774(02)00248-1_BIB034
  article-title: A strip-packing algorithm with absolute performance bound two
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539793255801
– start-page: 167
  year: 1994
  ident: 10.1016/S0196-6774(02)00248-1_BIB030
  article-title: Scheduling malleable and nonmalleable parallel tasks
– volume: 2161
  start-page: 146
  year: 2001
  ident: 10.1016/S0196-6774(02)00248-1_BIB029
  article-title: Approximation algorithms for scheduling malleable tasks under precedence constraints
– volume: 82
  start-page: 191
  year: 1998
  ident: 10.1016/S0196-6774(02)00248-1_BIB033
  article-title: Makespan minimization in open shops: A polynomial time approximation scheme
  publication-title: Math. Programming
  doi: 10.1007/BF01585871
– volume: 55
  start-page: 259
  year: 1994
  ident: 10.1016/S0196-6774(02)00248-1_BIB020
  article-title: Complexity of scheduling multiprocessor tasks with prespecified processor allocations
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(94)90012-4
– volume: 32
  start-page: 247
  year: 2002
  ident: 10.1016/S0196-6774(02)00248-1_BIB001
  article-title: Scheduling independent multiprocessor tasks
  publication-title: Algorithmica
  doi: 10.1007/s00453-001-0076-9
– volume: 31
  start-page: 1
  year: 2001
  ident: 10.1016/S0196-6774(02)00248-1_BIB009
  article-title: A polynomial time approximation scheme for general multiprocessor job scheduling
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539798348110
– volume: 14
  start-page: 67
  year: 2001
  ident: 10.1016/S0196-6774(02)00248-1_BIB017
  article-title: Better approximation guarantees for job-shop scheduling
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/S0895480199326104
– volume: 26
  start-page: 324
  year: 2001
  ident: 10.1016/S0196-6774(02)00248-1_BIB023
  article-title: Improved approximation schemes for scheduling unrelated parallel machines
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.26.2.324.10559
– volume: 94
  start-page: 215
  year: 1996
  ident: 10.1016/S0196-6774(02)00248-1_BIB011
  article-title: Scheduling multiprocessor tasks—an overview
  publication-title: European J. Oper. Res.
  doi: 10.1016/0377-2217(96)00123-3
– volume: 58
  start-page: 493
  year: 1995
  ident: 10.1016/S0196-6774(02)00248-1_BIB002
  article-title: Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
  publication-title: Ann. Oper. Res.
  doi: 10.1007/BF02057160
– volume: 130
  start-page: 49
  issue: 1
  year: 1994
  ident: 10.1016/S0196-6774(02)00248-1_BIB014
  article-title: Dynamic scheduling on parallel machines
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(94)90152-X
– volume: C-35
  start-page: 389
  issue: 5
  year: 1986
  ident: 10.1016/S0196-6774(02)00248-1_BIB005
  article-title: Scheduling multiprocessor tasks to minimize schedule length
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/TC.1986.1676781
– volume: 23
  start-page: 617
  year: 1994
  ident: 10.1016/S0196-6774(02)00248-1_BIB032
  article-title: Improved approximation algorithms for shop scheduling problems
  publication-title: SIAM J. Comput.
  doi: 10.1137/S009753979222676X
– volume: 25
  start-page: 645
  year: 2000
  ident: 10.1016/S0196-6774(02)00248-1_BIB027
  article-title: Approximate strip packing
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.25.4.645.12118
– volume: 1136
  start-page: 39
  year: 1996
  ident: 10.1016/S0196-6774(02)00248-1_BIB031
  article-title: Preemptive weighted completion time scheduling of parallel jobs
– volume: 82
  start-page: 175
  year: 1998
  ident: 10.1016/S0196-6774(02)00248-1_BIB019
  article-title: Approximability of flow shop scheduling
  publication-title: Math. Programming
  doi: 10.1007/BF01585870
– volume: 32
  start-page: 507
  year: 2002
  ident: 10.1016/S0196-6774(02)00248-1_BIB022
  article-title: Linear-time approximation schemes for scheduling malleable parallel tasks
  publication-title: Algorithmica
  doi: 10.1007/s00453-001-0085-8
– volume: 1671
  start-page: 177
  year: 1999
  ident: 10.1016/S0196-6774(02)00248-1_BIB026
  article-title: A linear time approximation scheme for the job shop scheduling problem
– volume: 2
  start-page: 473
  year: 1989
  ident: 10.1016/S0196-6774(02)00248-1_BIB012
  article-title: Complexity of scheduling parallel task systems
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/0402042
– volume: 1776
  start-page: 68
  year: 2000
  ident: 10.1016/S0196-6774(02)00248-1_BIB021
  article-title: Approximation algorithms for flexible job shop problems
– start-page: 323
  year: 1992
  ident: 10.1016/S0196-6774(02)00248-1_BIB035
  article-title: Approximate algorithms for scheduling parallelizable tasks
– start-page: 394
  year: 1999
  ident: 10.1016/S0196-6774(02)00248-1_BIB025
  article-title: Makespan minimization in job shops: a polynomial time approximation scheme
– year: 1998
  ident: 10.1016/S0196-6774(02)00248-1_BIB006
– start-page: 329
  year: 1996
  ident: 10.1016/S0196-6774(02)00248-1_BIB007
  article-title: Resource scheduling for parallel database and scientific applications
– volume: 46
  start-page: 57
  year: 1999
  ident: 10.1016/S0196-6774(02)00248-1_BIB008
  article-title: General multiprocessor tasks scheduling
  publication-title: Naval Res. Logist.
  doi: 10.1002/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H
– volume: 1
  start-page: 117
  year: 1976
  ident: 10.1016/S0196-6774(02)00248-1_BIB016
  article-title: The complexity of flowshop and jobshop scheduling
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.1.2.117
– volume: 1663
  start-page: 110
  year: 1999
  ident: 10.1016/S0196-6774(02)00248-1_BIB024
  article-title: General multiprocessor task scheduling: approximate solution in linear time
– volume: 21
  start-page: 257
  year: 1976
  ident: 10.1016/S0196-6774(02)00248-1_BIB015
  article-title: Resource constrained scheduling as generalized bin packing
  publication-title: J. Combin. Theory Ser. A
  doi: 10.1016/0097-3165(76)90001-7
– volume: 43
  start-page: 381
  year: 1995
  ident: 10.1016/S0196-6774(02)00248-1_BIB010
  article-title: On the complexity of multiprocessor task scheduling
  publication-title: Bull. Polish Acad. Sci.
SSID ssj0011549
Score 1.5337473
Snippet We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most μ...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 167
SubjectTerms Applied sciences
Computer science; control theory; systems
Computer systems performance. Reliability
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Scheduling, sequencing
Software
Title Polynomial time approximation schemes for general multiprocessor job shop scheduling
URI https://dx.doi.org/10.1016/S0196-6774(02)00248-1
Volume 45
WOSCitedRecordID wos000180057800005&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: 1090-2678
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0011549
  issn: 0196-6774
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLYQ7DBp2tgvwTaQDzsMIW-xkzj2ESEQDIQq0U29RbHjlEJJqrZM3X-_59hJ2k2McdgliqzYsfK-2M_2976H0MeImjAJI000F5JEJi-IVDElmmqlJEyYvCbRfD9PLi7EYCB7npA5q9MJJGUpFgs5-a-mhjIwtg2dfYS520ahAO7B6HAFs8P1nwzfq8Y_baxxHQ9ya5xq-GLkQhT3YTFrrD6TZRcOneS0JxW6iAEovq7U_uyqmtTP5papPrzHhc3Gw2o6ml_ddjzErPRbOmfj7K4t7lXTG1hD12c_5wA6T7ZpdhuYD7tb2oCUnPDEZdZpRlAnCOmRwpaGQ-pSbfiZlbq8XH8M2m7_4LJtGlxrKwsra701QruZqjmd_20Ca2mFS4w1yVPbVBqwtG4mhRXyBktiCSPfxsHp0eBre9ZkRepcUL17fRfn9aXr06eA7fn-3OfBPJtkM_ivCpcQZclL6W-i5942-MDB4iVaM-Ur9KJJ3YH9SP4a9TuUYIsSvIIS7FGCASXYowSvogQDSrBFCe5Q8gZ9Oz7qH54Qn2CD6Chkc5LDaiAyWZDTiNE8CENRhEpxpnIeG6lFzvKCF4GRStgDe2WCzMRUWYm2mHJwnN-i9bIqzRbC4ONkoVTKKKkjLTIpAuv5KlOrJ4V8G0XNR0u1V5-3SVDG6V-Nto0-t9UmTn7loQqisUjqfUjnG6aAtoeq7q5YsHuh5TxIEb97bGfeo6fdP_QBrc-nd2YHPdE_5qPZdNfj8Bd4qpmU
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=Polynomial+time+approximation+schemes+for+general+multiprocessor+job+shop+scheduling&rft.jtitle=Journal+of+algorithms&rft.au=Jansen%2C+Klaus&rft.au=Porkolab%2C+Lorant&rft.date=2002-11-01&rft.issn=0196-6774&rft.volume=45&rft.issue=2&rft.spage=167&rft.epage=191&rft_id=info:doi/10.1016%2FS0196-6774%2802%2900248-1&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0196_6774_02_00248_1
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0196-6774&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0196-6774&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0196-6774&client=summon