A concise survey of efficiently solvable special cases of the permutation flow-shop problem
RAIRO-Oper. Res., 17 2 (1983) 105-119
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Bounds for the permutation flowshop scheduling problem: New framework and theoretical insights
J.A. Alejandro-Soto, Carlos Segura and Joel Antonio Trejo-SanchezComputers & Operations Research 191 107445 (2026)
https://doi.org/10.1016/j.cor.2026.107445
Operations Research Proceedings 2019
Kathrin Maassen and Paz Perez-GonzalezOperations Research Proceedings, Operations Research Proceedings 2019 555 (2020)
https://doi.org/10.1007/978-3-030-48439-2_67
https://doi.org/10.1002/9781119262602.ch10
Applications of max-plus algebra to flow shop scheduling problems
Susumu Kubo and Katsuhiro NishinariDiscrete Applied Mathematics 247 278 (2018)
https://doi.org/10.1016/j.dam.2018.03.045
Reduction of permutation flowshop problems to single machine problems using machine dominance relations
Victor Fernandez-Viagas and Jose M. FraminanComputers & Operations Research 77 96 (2017)
https://doi.org/10.1016/j.cor.2016.07.009
Scheduling
Michael L. PinedoScheduling 151 (2016)
https://doi.org/10.1007/978-3-319-26580-3_6
Solution algorithms for synchronous flow shop problems with two dominating machines
Matthias Kampmeyer, Sigrid Knust and Stefan WaldherrComputers & Operations Research 74 42 (2016)
https://doi.org/10.1016/j.cor.2016.04.010
899 (2015)
https://doi.org/10.1109/IESM.2015.7380262
A combination of flow shop scheduling and the shortest path problem
Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon and Roel LeusJournal of Combinatorial Optimization 29 (1) 36 (2015)
https://doi.org/10.1007/s10878-013-9670-4
Review of the ordered and proportionate flow shop scheduling research
S.S. Panwalkar, Milton L. Smith and Christos KoulamasNaval Research Logistics (NRL) 60 (1) 46 (2013)
https://doi.org/10.1002/nav.21518
Flow Shop Scheduling
Hamilton Emmons and George VairaktarakisInternational Series in Operations Research & Management Science, Flow Shop Scheduling 182 97 (2013)
https://doi.org/10.1007/978-1-4614-5152-5_4
Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines
Lin-Hui Sun, Lin-Yan Sun, Ming-Zheng Wang and Ji-Bo WangInternational Journal of Production Economics 138 (1) 195 (2012)
https://doi.org/10.1016/j.ijpe.2012.03.023
https://doi.org/10.1002/9780470451793.ch10
Fifty years of scheduling: a survey of milestones
C N Potts and V A StrusevichJournal of the Operational Research Society 60 (sup1) S41 (2009)
https://doi.org/10.1057/jors.2009.2
Computational Intelligence in Flow Shop and Job Shop Scheduling
E. MokotoffStudies in Computational Intelligence, Computational Intelligence in Flow Shop and Job Shop Scheduling 230 101 (2009)
https://doi.org/10.1007/978-3-642-02836-6_4
Handbook on Scheduling
International Handbook on Information Systems, Handbook on Scheduling 271 (2007)https://doi.org/10.1007/978-3-540-32220-7_8
Flow shop scheduling problems with decreasing linear deterioration under dominant machines
Ji-Bo WangComputers & Operations Research 34 (7) 2043 (2007)
https://doi.org/10.1016/j.cor.2005.08.008
On no-wait and no-idle flow shops with makespan criterion
Pawel Jan Kalczynski and Jerzy KamburowskiEuropean Journal of Operational Research 178 (3) 677 (2007)
https://doi.org/10.1016/j.ejor.2006.01.036
Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
Ji-Bo Wang, Feng Shan, Bo Jiang and Li-Yan WangApplied Mathematics and Computation 182 (1) 947 (2006)
https://doi.org/10.1016/j.amc.2006.04.052
Flow shop scheduling with deteriorating jobs under dominating machines
Ji-Bo Wang and Zun-Quan XiaOmega 34 (4) 327 (2006)
https://doi.org/10.1016/j.omega.2004.10.006
Flow shop scheduling problems with deteriorating jobs under dominating machines
J-B Wang and Z-Q XiaJournal of the Operational Research Society 57 (2) 220 (2006)
https://doi.org/10.1057/palgrave.jors.2601959
No-wait or no-idle permutation flowshop scheduling with dominating machines
Ji-Bo Wang and Zun-Quan XiaJournal of Applied Mathematics and Computing 17 (1-2) 419 (2005)
https://doi.org/10.1007/BF02936066
Flow-shop scheduling with a learning effect
J-B Wang and Z-Q XiaJournal of the Operational Research Society 56 (11) 1325 (2005)
https://doi.org/10.1057/palgrave.jors.2601856
Nonpreemptive flowshop scheduling with machine dominance
Ondřej Čepek, Masanori Okada and Milan VlachEuropean Journal of Operational Research 139 (2) 245 (2002)
https://doi.org/10.1016/S0377-2217(01)00356-3
Scheduling Computer and Manufacturing Processes
Jacek Błażewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt and Jan WęglarzScheduling Computer and Manufacturing Processes 247 (2001)
https://doi.org/10.1007/978-3-662-04363-9_7
Mathematical Foundations of Computer Science 2001
Wolfgang Espelage and Egon WankeLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2001 2136 363 (2001)
https://doi.org/10.1007/3-540-44683-4_32
Non-bottleneck machines in three-machine flow shops
Jerzy KamburowskiJournal of Scheduling 3 (4) 209 (2000)
https://doi.org/10.1002/1099-1425(200007/08)3:4<209::AID-JOS43>3.0.CO;2-W
Solvable cases of permutation flowshop scheduling with dominating machines
S. Xiang, G. Tang and T.C.E. ChengInternational Journal of Production Economics 66 (1) 53 (2000)
https://doi.org/10.1016/S0925-5273(99)00106-1
On three-machine flow shops with random job processing times
Jerzy KamburowskiEuropean Journal of Operational Research 125 (2) 440 (2000)
https://doi.org/10.1016/S0377-2217(99)00222-2
Structural Properties of Lot Streaming in a Flow Shop
C. A. Glass and C. N. PottsMathematics of Operations Research 23 (3) 624 (1998)
https://doi.org/10.1287/moor.23.3.624
Flow-line scheduling problem with controllable processing times
SELCUK KARABATI and PANAGIOTIS KOUVELISIIE Transactions 29 (1) 1 (1997)
https://doi.org/10.1080/07408179708966307
Open shop scheduling with maximal machines
George J. Kyparisis and Christos KoulamasDiscrete Applied Mathematics 78 (1-3) 175 (1997)
https://doi.org/10.1016/S0166-218X(97)00018-8
Scheduling Computer and Manufacturing Processes
Jacek Błażewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt and Jan WęglarzScheduling Computer and Manufacturing Processes 249 (1996)
https://doi.org/10.1007/978-3-662-03217-6_7
The job shop scheduling problem: Conventional and new solution techniques
Jacek Błażewicz, Wolfgang Domschke and Erwin PeschEuropean Journal of Operational Research 93 (1) 1 (1996)
https://doi.org/10.1016/0377-2217(95)00362-2
On the recognition of permuted bottleneck Monge matrices
Bettina Klinz, Rüdiger Rudolf and Gerhard J. WoegingerDiscrete Applied Mathematics 63 (1) 43 (1995)
https://doi.org/10.1016/0166-218X(94)00019-A
1 59 (1995)
https://doi.org/10.1109/ETFA.1995.496763
Lot streaming in the two-machine flow shop with setup times
Kenneth R. BakerAnnals of Operations Research 57 (1) 1 (1995)
https://doi.org/10.1007/BF02099687
The interface of buffer design and cyclic scheduling decisions in deterministic flow lines
Selcuk Karabati and Panagiotis KouvelisAnnals of Operations Research 50 (1) 295 (1994)
https://doi.org/10.1007/BF02085645
Logistics of Production and Inventory
Eugene L. Lawler, Jan Karel Lenstra, Alexander H.G. Rinnooy Kan and David B. ShmoysHandbooks in Operations Research and Management Science, Logistics of Production and Inventory 4 445 (1993)
https://doi.org/10.1016/S0927-0507(05)80189-6
On the heuristic solution of the permutation flow shop problem by path algorithms
Frank WernerComputers & Operations Research 20 (7) 707 (1993)
https://doi.org/10.1016/0305-0548(93)90058-Q
Les problèmes d'ordonnancement
GothaRAIRO - Operations Research 27 (1) 77 (1993)
https://doi.org/10.1051/ro/1993270100771
The permutation flow shop problem with sum-of-completion times performance criterion
Selcuk Karabati and Panagiotis KouvelisNaval Research Logistics 40 (6) 843 (1993)
https://doi.org/10.1002/1520-6750(199310)40:6<843::AID-NAV3220400608>3.0.CO;2-A
Open-shop scheduling problems with dominated machines
I. Adiri and N. Aizikowitz (Hefetz)Naval Research Logistics 36 (3) 273 (1989)
https://doi.org/10.1002/nav.3220360305
Optimization 18 (5) 697 (1987)
https://doi.org/10.1080/02331938708843282