Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:INFORMS journal on computing Jg. 13; H. 2; S. 120 - 137
Hauptverfasser: Glass, C.A, Potts, C.N, Strusevich, V.A
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Linthicum INFORMS 22.03.2001
Institute for Operations Research and the Management Sciences
Schlagworte:
Algorithms
Analysis of Algorithms: Computational Complexity
Batch processing
Flow-Shop
Heuristic
Job shops
Open-Shop
Production-Scheduling
Scheduling
Studies
Suboptimal Algorithms
ISSN:1091-9856, 1526-5528, 1091-9856
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches . A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.
AbstractList In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.
In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.[PUBLICATION ABSTRACT]
In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches . A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4 3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.
Audience Academic
Author Potts, C.N
Glass, C.A
Strusevich, V.A
Author_xml – sequence: 1
  fullname: Glass, C.A
– sequence: 2
  fullname: Potts, C.N
– sequence: 3
  fullname: Strusevich, V.A
BookMark eNqNkVtrHCEUgKWkkEv7C_oipY-ZjUfH2fExCc2NlBQ2eRbXcXZcZnWrsyz99znDFBrCQosPeo7fp0fPKTkKMThCvgCbAa_nF34d7QzEjGOIKSY5fCAnIHlVSMnrI1wzBYWqZXVMTnNeM8ZKUaoT8rKwnWt2vQ8remUGDDLd-6GjC_dr58LgTU8f4pL-TNG6nEesjYk-72Pxw9jOB0dv-rinJjT0aesCXXRxmz-Rj63ps_v8Zz4jLzffn6_visen2_vry8fClmU9FFbVgs_BGGWxYtky1QBr6grANMJUBqxroS2ZXVopJGuEXLpKlUsoa4P7TpyRr9O52xSx3DzoddylgFdqzpjEj5jDX2hleqd9aOOQjN34bPWlUjAHLhlC5weglQsumR4_u_WYfosXB3Acjdt4e4hXE29TzDm5Vls_mMHHgJ7vNTA9NlKPjdQgNMcQU2Mj0RXv3G3yG5N-_8PikzUWlzb5P6Vvk9T5Vbf3aXraaL-FxSv7Q77h
CitedBy_id crossref_primary_10_1016_j_ejor_2006_06_060
crossref_primary_10_1016_j_disopt_2011_11_001
crossref_primary_10_1002_nav_20473
crossref_primary_10_1007_s10951_007_0041_9
crossref_primary_10_1016_j_rcim_2008_05_003
crossref_primary_10_1057_jors_2011_64
crossref_primary_10_1016_j_orl_2005_07_006
crossref_primary_10_1155_2009_153910
crossref_primary_10_1007_s10951_013_0340_2
crossref_primary_10_1080_07408170701592473
crossref_primary_10_1016_j_omega_2005_04_004
crossref_primary_10_1007_s00170_012_3906_9
crossref_primary_10_1080_00207543_2014_910625
crossref_primary_10_1080_00207543_2011_560620
crossref_primary_10_1016_j_endm_2010_05_149
crossref_primary_10_1016_j_ejor_2009_01_029
crossref_primary_10_1016_j_ejor_2004_01_029
crossref_primary_10_1080_00207543_2016_1140920
crossref_primary_10_1016_S0377_2217_03_00250_9
crossref_primary_10_1016_j_cie_2014_10_010
crossref_primary_10_1007_s00170_009_1986_y
crossref_primary_10_1080_00207543_2024_2432473
crossref_primary_10_1007_s10951_014_0410_0
crossref_primary_10_1007_s10626_014_0195_5
crossref_primary_10_1016_j_ejor_2012_03_001
crossref_primary_10_1016_j_ejor_2003_03_002
crossref_primary_10_1016_j_ejor_2021_03_026
crossref_primary_10_1016_j_cor_2022_105732
crossref_primary_10_1016_j_ejor_2006_03_068
crossref_primary_10_1002_nav_20323
crossref_primary_10_1007_s00170_010_3150_0
crossref_primary_10_1007_s10479_004_5029_7
Cites_doi 10.1145/321921.321934
10.1080/05695557908974469
10.1016/0167-6377(94)90063-9
10.1002/nav.3800010110
10.1007/978-1-4684-2001-2_9
10.1016/0166-218X(85)90009-5
10.1016/0305-0548(93)90115-Y
10.1287/opre.43.4.692
10.1016/0166-218X(93)90085-3
10.1080/15458830.1996.11770748
10.1145/321978.321985
10.1016/S0167-5060(08)70356-X
10.1287/mnsc.12.5.437
10.1007/BF01303431
10.1137/0117039
10.1080/07408179808966485
ContentType Journal Article
Copyright COPYRIGHT 2001 Institute for Operations Research and the Management Sciences
Copyright Institute for Operations Research and the Management Sciences Spring 2001
Copyright_xml – notice: COPYRIGHT 2001 Institute for Operations Research and the Management Sciences
– notice: Copyright Institute for Operations Research and the Management Sciences Spring 2001
DBID AAYXX
CITATION
3V.
7WY
7WZ
7XB
87Z
8AL
8AO
8FE
8FG
8FK
8FL
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
M0C
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PYYUZ
Q9U
DOI 10.1287/ijoc.13.2.120.10521
DatabaseName CrossRef
ProQuest Central (Corporate)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Global (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ProQuest ABI/INFORM Global
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
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
ABI/INFORM Collection China
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Pharma Collection
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
ABI/INFORM Complete (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ABI/INFORM China
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Business Premium Collection (Alumni)
DatabaseTitleList CrossRef

ABI/INFORM Global (Corporate)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central - New (Subscription)
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1526-5528
1091-9856
EndPage 137
ExternalDocumentID 548005611
A99171250
10_1287_ijoc_13_2_120_10521
ijoc.13.2.120.10521
joc_13_2_120
Genre Research Article
Feature
GroupedDBID 1AW
29I
3V.
4.4
4S
5GY
7WY
8AL
8AO
8FE
8FG
8FL
8VB
AAPBV
ABDBF
ABFLS
ABPTK
ABUWG
ACNCT
ADCOW
AEILP
AENEX
AFKRA
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ARCSS
AZQEC
BENPR
BEZIV
BGLVJ
BPHCQ
CS3
DU5
DWQXO
EAD
EAP
EBA
EBE
EBR
EBS
EBU
ECS
EDO
EHE
EJD
EMI
EMK
EPL
EST
ESX
F5P
FRNLG
GNUQQ
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
HCIFZ
I-F
IAO
ICD
IEA
IGS
IL9
IOF
ITC
K6
K60
K6V
K7-
M0C
M0N
MV1
N95
NIEAY
P2P
P62
PQEST
PQQKQ
PQUKI
PRINS
PROAC
QWB
RPU
TH9
TN5
TUS
XFK
XI7
Y99
ZL0
ZY4
ACYGS
.4S
.DC
18M
AADHG
AAYXX
ABDNZ
ACGFO
AEGXH
AEMOZ
AFFHD
AHQJS
AIAGR
BAAKF
CCPQU
CITATION
EBO
K1G
K6~
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
XOL
7XB
8FK
JQ2
L.-
PKEHL
Q9U
ID FETCH-LOGICAL-c448t-c983271aa9c5215f09d10d8611ad3a6a1cef1f40cbc5350d35be694b148a3a6e3
IEDL.DBID K7-
ISICitedReferencesCount 35
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000168732100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1091-9856
IngestDate Fri Jul 25 23:51:00 EDT 2025
Tue Nov 11 11:21:38 EST 2025
Mon Nov 24 15:52:48 EST 2025
Tue Nov 04 18:46:12 EST 2025
Sat Nov 29 03:32:06 EST 2025
Tue Nov 18 21:25:58 EST 2025
Tue Jan 05 23:25:02 EST 2021
Fri Jan 15 03:35:25 EST 2021
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c448t-c983271aa9c5215f09d10d8611ad3a6a1cef1f40cbc5350d35be694b148a3a6e3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 200510571
PQPubID 46392
PageCount 18
ParticipantIDs highwire_informs_joc_13_2_120
crossref_primary_10_1287_ijoc_13_2_120_10521
gale_infotracacademiconefile_A99171250
crossref_citationtrail_10_1287_ijoc_13_2_120_10521
proquest_journals_200510571
gale_infotracmisc_A99171250
gale_infotracgeneralonefile_A99171250
informs_primary_10_1287_ijoc_13_2_120_10521
ProviderPackageCode Y99
RPU
NIEAY
PublicationCentury 2000
PublicationDate 20010322
PublicationDateYYYYMMDD 2001-03-22
PublicationDate_xml – month: 03
  year: 2001
  text: 20010322
  day: 22
PublicationDecade 2000
PublicationPlace Linthicum
PublicationPlace_xml – name: Linthicum
PublicationTitle INFORMS journal on computing
PublicationYear 2001
Publisher INFORMS
Institute for Operations Research and the Management Sciences
Publisher_xml – name: INFORMS
– name: Institute for Operations Research and the Management Sciences
References B20
B10
B21
B11
B12
B13
B14
B15
B16
B17
B18
B19
B1
B2
B3
B4
B5
B6
B7
B8
B9
Potts C.N. (B16) 1998
Lawler E.L. (B14) 1993
Garey M.R. (B7) 1979
References_xml – ident: B8
– ident: B12
– ident: B9
– ident: B11
– ident: B13
– ident: B14
– ident: B10
– ident: B3
– ident: B2
– ident: B20
– ident: B1
– ident: B4
– ident: B7
– ident: B5
– ident: B6
– ident: B21
– ident: B17
– ident: B18
– ident: B16
– ident: B15
– ident: B19
– ident: B18
  doi: 10.1145/321921.321934
– ident: B21
  doi: 10.1080/05695557908974469
– ident: B11
  doi: 10.1016/0167-6377(94)90063-9
– ident: B12
  doi: 10.1002/nav.3800010110
– ident: B13
  doi: 10.1007/978-1-4684-2001-2_9
– volume-title: Shop scheduling with batching machines
  year: 1998
  ident: B16
– ident: B15
  doi: 10.1016/0166-218X(85)90009-5
– ident: B19
  doi: 10.1016/0305-0548(93)90115-Y
– ident: B20
  doi: 10.1287/opre.43.4.692
– volume-title: Computers and Intractability. A Guide to The Theory of NP-Completeness
  year: 1979
  ident: B7
– ident: B1
  doi: 10.1016/0166-218X(93)90085-3
– ident: B3
  doi: 10.1080/15458830.1996.11770748
– start-page: 455
  volume-title: Handbooks in Operations Research and Management Science, Volume 4, Logistics of Production and Inventory
  year: 1993
  ident: B14
– ident: B8
  doi: 10.1145/321978.321985
– ident: B10
  doi: 10.1016/S0167-5060(08)70356-X
– ident: B17
  doi: 10.1287/mnsc.12.5.437
– ident: B2
  doi: 10.1007/BF01303431
– ident: B9
  doi: 10.1137/0117039
– ident: B6
  doi: 10.1080/07408179808966485
SSID ssj0004349
Score 1.7491578
Snippet In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in...
SourceID proquest
gale
crossref
informs
highwire
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 120
SubjectTerms Algorithms
Analysis of Algorithms: Computational Complexity
Batch processing
Flow-Shop
Heuristic
Job shops
Open-Shop
Production-Scheduling
Scheduling
Studies
Suboptimal Algorithms
Title Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
URI http://joc.journal.informs.org/cgi/content/abstract/13/2/120
https://www.proquest.com/docview/200510571
Volume 13
WOSCitedRecordID wos000168732100003&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: PRVPQU
  databaseName: AAdvanced Technologies & Aerospace Database (subscription)
  customDbUrl:
  eissn: 1526-5528
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0004349
  issn: 1091-9856
  databaseCode: P5Z
  dateStart: 19990401
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1526-5528
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0004349
  issn: 1091-9856
  databaseCode: 7WY
  dateStart: 19990401
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Collection (ProQuest)
  customDbUrl:
  eissn: 1526-5528
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0004349
  issn: 1091-9856
  databaseCode: M0C
  dateStart: 19990401
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database (ProQuest)
  customDbUrl:
  eissn: 1526-5528
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0004349
  issn: 1091-9856
  databaseCode: K7-
  dateStart: 19990401
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central - New (Subscription)
  customDbUrl:
  eissn: 1526-5528
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0004349
  issn: 1091-9856
  databaseCode: BENPR
  dateStart: 19990401
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED_tgwd4YDCYKGWVH4AX8BY7zdcT2qZVCLSqopsYvFiO7YyhqilLYf8-d64zWjFNSLxYcnyJ7Nz5fGeffwfwsswMGhFxxCv0LghU23Ed2ZjHUZWWaZLoLDM-2UQ2HObn58UoxOY0Iayy1YleUdva0B75vvTik2Ti3ewHp6RRdLgaMmisw6aQUpCYf8z4n2uRsbd-CfqSF3mSBtAh9BH2L7_XZk_EexKrPtetFCsLU6ueW8xgf9eJrMjmL53tF6LB1n8O4RE8DBYoO1iIzGNYc9Nt2GqzO7Aw2bfhwRJU4RM4GyN3LYWtX7BDTaxuGO3hsrGPxUY9MWEf6pKFiwdEhgNhp9c1P_Hxmo4NJvU101PLKIiFjb_Vs-YpnA2OT4_e85CSgRv04-bcFKgBMqF1YfCXJVVUWBHZPBVC21inWhhXiaofmRJFIEGmJ6VLi36JTpfGdhfvwMa0nrpnwFJTGNevHOHn9ONIlznaXlZYaS3alEXeAdnyQ5mAV05pMyaK_BZkoiImKhEriVU6SscedeDtzUuzBVzH3eSvidGKeIvfNjrcScAeEiyWOkDrOUMTMOrAqxXCiwUm-C103RU6nKtmuXW3FSgVxEktd6oDb9rH_9T5bitmKiieRt3I2PM7W7twvw2mk_IFbMyvfrpduGd-zS-bqx6sZ5-_9GDz8Hg4-tTzkwrLk-gIy1Hy9TeBcCU4
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VggQcKBQQIRT2QLmAW-_6fUCoFKKWthFSUqm3Zb27LkVRHOpAxI_iPzKz8ZZEoIpLDxydnVhj-9t52DPfADwvM41BRBQGFWYXRKptAxWaKIjCKi3TJFFZpt2wiazfz09Oio8r8NP3wlBZpbeJzlCbWtM78m3h4JNk_M3ka0BDo-jjqp-gMUfFgf0xw4yteb3_Dh_vphC998PdvaAdKhBozESmgS4QwxlXqtDouZIqLAwPTZ5yrkykUsW1rXgVh7rEi0hQ7aS0aRGXmDYoXLcRnvcaXI9j3A1UKRju_m7DjFy0TVSbQZEnaUtyhDnJ9tmXWm_xaEvgoZutK_iSI_TuwHMUu94qilqbP3yEc3y9tf_slt2FO22EzXbmW-IerNjxOqz56RWsNWbrcHuBivE-HA8QvYbK8k_ZW0VQbhi9o2YDV2uOdnDEPtQlaxsrSAxvHBvO6uDI1aNa1hvVM6bGhlGRDht8rifNAzi-kkt9CKvjemwfAUt1oW1cWeIHiqNQlTnGloYbYQzGzEXeAeGfv9QtHzuNBRlJyssQNJJAI3kkBR5SqQBq1IFXF3-azOlILhd_QcCShCU8t1ZtzwVqSLRfcgezgwxD3LADm0uCp3PO87_IdZfk0BbpxdUND2DZwlcuKtWBl_7nf1K-62EtW8PayAtMP7509Rnc3BseHcrD_f5BF275wkEhnsDq9Pyb3YAb-vv0rDl_6rYwg09XvQF-Aecnfbg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Pb9MwFH4aAyE4MBggShn4wLiA1zhpkuaA0GBUjEI1qZu0m3FsZwxVTVkKFX8a_x3vufZoBZq47MAx8UtkJ5_fj-S97wE8LXONTkQS8QqjCyLVtlxFJuFJVGVllqYqz7VrNpEPh73j4-JgDX6GWhhKqww60SlqU2v6Rt6JHXzSXHQqnxVxsNd_Nf3KqYEU_WgN3TQWCBnYH3OM3pqX-3v4qrfjuP_28M077hsMcI1RyYzrAvGcC6UKjVYsraLCiMj0MiGUSVSmhLaVqLqRLnFBKS4hLW1WdEsMIRSO2wTvewWuohFOaYsNcv67JDNxnjfRbvKil2ae8Ajjk87pl1rviGQnxkPXZzcWK0YxmIbAV-zqrMiDbf6wF84I9jf-48d3G255z5vtLrbKHVizk03YCF0tmFdym3BziaLxLhyNENWG0vVP2GtFEG8YfbtmI5eDjvpxzN7XJfMFFySGD5Edzmv-0eWpWtYf13OmJoZR8g4bfa6nzT04upSl3of1ST2xD4BlutC2W1niDeomkSp76HMaYWJj0Jcuei2IAxak9jzt1C5kLCleQwBJApAUiYzxkFIIcEYteHF-0XRBU3Kx-DMCmSRc4b218rUYOEOiA5O7GDXk6PpGLdheETxZcKH_Ra69Ioc6Si-PbgUwSw9luTypFjwPp_9p8u0AcekVbiPP8f3wwtEncB1xLz_sDwdtuBHyCeP4EazPzr7ZLbimv89Om7PHbjcz-HTZ-P8FiziGXg
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=Scheduling+batches+with+sequential+job+processing+for+two-machine+flow+and+open+shops&rft.jtitle=INFORMS+journal+on+computing&rft.au=Glass%2C+C.A&rft.au=Potts%2C+C.N&rft.au=Strusevich%2C+V.A&rft.date=2001-03-22&rft.pub=Institute+for+Operations+Research+and+the+Management+Sciences&rft.issn=1091-9856&rft.volume=13&rft.issue=2&rft.spage=120&rft_id=info:doi/10.1287%2Fijoc.13.2.120.10521&rft.externalDocID=A99171250
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1091-9856&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1091-9856&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1091-9856&client=summon