Baker, K. (1995). Lot streaming in the 2-machine flow-shop with setup times. Annals of
Operations Research, 57, 1-11. http://dx.doi.org/10.1007/BF02099687
Bukchin, J., & Masin, M. (2004). Multi-objective lot splitting for a single product m-machine
flowshop line. Iie Transactions, 36(2), 191-202. http://dx.doi.org/10.1080/07408170490245487
Bukchin, Y., Masin, M., & Kirshner, R. (2010). Modeling and Analysis of Multiobjective Lot
Splitting for N-Product M-Machine Flowshop Lines. Naval Research Logistics, 57(4), 354-366.
Cetinkaya, F. (1994). Lot streaming in a 2-stage flow-shop with set-up, processing and removal times separated. Journal of the Operational Research Society, 45(12), 1445-1455.
Cetinkaya, F.C. (2006). Unit sized transfer batch scheduling in an automated two-machine
flow-line cell with one transport agent. International Journal of Advanced Manufacturing
Technology, 29(1-2), 178-183. http://dx.doi.org/10.1007/s00170-004-2493-9
Cetinkaya, F., & Kayaligil, M. (1992). Unit sized transfer batch scheduling with setup times.
Computers & Industrial Engineering, 22(2), 177-183. http://dx.doi.org/10.1016/0360-
8352(92)90045-L
Chen, J., & Steiner, G. (1997a). Lot streaming with detached setups in three-machine flow
shops. European Journal of Operational Research, 96(3), 591-611.
http://dx.doi.org/10.1016/S0377-2217(96)00091-4
Chen, J., & Steiner, G. (1997b). Approximation methods for discrete lot streaming in flow
shops. Operations Research Letters, 21(3), 139-145. http://dx.doi.org/10.1016/S0167-
6377(97)00039-4
Chen, J., & Steiner, G. (2003). On discrete lot streaming in no-wait flow shops. Iie Transactions, 35(2), 91-101. http://dx.doi.org/10.1080/07408170304379
Chen, J.A., & Steiner, G. (1998). Lot streaming with attached setups in three-machine flow
shops. Iie Transactions, 30(11), 1075-1084. http://dx.doi.org/10.1080/07408179808966564
Chen, J.A., & Steiner, G. (1999). Discrete lot streaming in two-machine flow shops. Infor,
37(2), 160-173.
Chiu, H., Chang, J., & Lee, C. (2004). Lot streaming models with a limited number of
capacitated transporters in multistage batch production systems. Computers & Operations
Research, 31(12), 2003-2020. http://dx.doi.org/10.1016/S0305-0548(03)00159-X
Defersha, F.M., & Chen, M. (2010). A hybrid genetic algorithm for flowshop lot streaming with
setups and variable sublots. Int. Journal of Production Research, 48(6), 1705-1726.
http://dx.doi.org/10.1080/00207540802660544
Edis, R.S., & Ornek, M.A. (2009). A tabu search-based heuristic for single-product lot
streaming problems in flow shops. International Journal of Advanced Manufacturing
Technology, 43(11-12), 1202-1213. http://dx.doi.org/10.1007/s00170-008-1798-5
Feldmann, M., & Biskup, D. (2008). Lot streaming in a multiple product permutation flow shop
with intermingling. International Journal of Production Research, 46(1), 197-216.
http://dx.doi.org/10.1080/00207540600930065
Ganapathy, V., Marimuthu, S., & Ponnambalam, S. (2004). Tabu search and simulated annealing algorithms for lot-streaming in two-machine flowshop. 2004 Ieee International
Conference on Systems, Man & Cybernetics, Vols 1-7, 4221-4225. New York: Ieee.
Glass, C.A., & Herer, Y.T. (2006). On the equivalence of small batch assembly line balancing
and lot streaming in a flow shop. International Journal of Production Research, 44(21),
4587-4606. http://dx.doi.org/10.1080/00207540600607119
Glass, C., & Potts, C. (1998). Structural properties of lot streaming in a flow shop.
Mathematics of Operations Research, 23(3), 624-639. http://dx.doi.org/10.1287/moor.23.3.624
Hall, N., Laporte, G., Selvarajah, E., & Sriskandarajah, C. (2003). Scheduling and lot streaming
in flowshops with no-wait in process. Journal of Scheduling, 6(4), 339-354.
http://dx.doi.org/10.1023/A:1024042209719
Huq, F., Cutright, K., & Martin, C. (2004). Employee scheduling and makespan minimization in
a flow shop with multi-processor work stations: a case study. Omega-International Journal of
Management Science, 32(2), 121-129. http://dx.doi.org/10.1016/j.omega.2003.09.014
Johnson, S.M. (1954). Optimal two‐ and three‐stage production schedules with setup times
included. Naval Research Logistics Quarterly, 1(1), 61-68.
http://dx.doi.org/10.1002/nav.3800010110
Kalir, A.A., & Sarin, S.C. (2001). A near-optimal heuristic for the sequencing problem in
multiple-batch flow-shops with small equal sublots. Omega, 29(6), 577-584.
http://dx.doi.org/10.1016/S0305-0483(01)00046-9
Kalir, A., & Sarin, S. (2003). Constructing near optimal schedules for the flow-shop lot
streaming problem with sublot-attached setups. Journal of Combinatorial Optimization, 7(1),
23-44. http://dx.doi.org/10.1023/A:1021942422161
Kim, K., & Jeong, I.-J. (2009). Flow shop scheduling with no-wait flexible lot streaming using
an adaptive genetic algorithm. International Journal of Advanced Manufacturing Technology,
44(11-12), 1181-1190. http://dx.doi.org/10.1007/s00170-007-1236-0
Kumar, S., Bagchi, T.P., & Sriskandarajah, C. (2000). Lot streaming and scheduling heuristics
for m-machine no-wait flowshops. Computers & Industrial Engineering, 38(1), 149-172.
http://dx.doi.org/10.1016/S0360-8352(00)00035-8
Liu, S.C. (2003). A heuristic method for discrete lot streaming with variable sublots in a flow
shop. The International Journal of Advanced Manufacturing Technology, 22(9-10), 662-668.
http://dx.doi.org/10.1007/s00170-002-1516-7
Marimuthu, S., & Ponnambalam, S. (2005). Heuristic search algorithms for lot streaming in a
two-machine flowshop. International Journal of Advanced Manufacturing Technology,
27(1-2), 174-180. http://dx.doi.org/10.1007/s00170-004-2127-2
Marimuthu, S., Ponnambalam, S.G., & Jawahar, N. (2007). Tabu Search and Simulated
Annealing Algorithms for Scheduling in Flow Shops with Lot Streaming. Proceedings of the
Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 221(2),
317-331. http://dx.doi.org/10.1243/09544054JEM334
Marimuthu, S., Ponnambalam, S.G., & Jawahar, N. (2008). Evolutionary algorithms for
scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated
Manufacturing, 24(1), 125-139. http://dx.doi.org/10.1016/j.rcim.2006.06.007
Marimuthu, S., Ponnambalam, S.G., & Jawahar, N. (2009). Threshold accepting and Ant-colony
optimization algorithms for scheduling m-machine flow shops with lot streaming. Journal of
Materials Processing Technology, 209(2), 1026-1041.
http://dx.doi.org/10.1016/j.jmatprotec.2008.03.013
Marimuthu, S., Ponnambalam, S., & Suresh, R. (2004). Evolutionary algorithm and Threshold
accepting algorithm for scheduling in two-machine flow shop with lot streaming. New York:
Ieee.
Martin, C.H. (2009). A hybrid genetic algorithm/mathematical programming approach to the
multi-family flowshop scheduling problem with lot streaming. Omega, 37(1), 126-137.
http://dx.doi.org/10.1016/j.omega.2006.11.002
Pan, Q.-K., Duan, J., Liang, J.J., Gao, K., & Li, J. (2010a). A Novel Discrete Harmony Search
Algorithm for Scheduling Lot-streaming Flow Shops. New York: Ieee.
Pan, Q.-K., & Ruiz, R. (2012). An estimation of distribution algorithm for lot-streaming flow
shop problems with setup times. Omega, 40(2), 166-180.
http://dx.doi.org/10.1016/j.omega.2011.05.002
Pan, Q.-K., Tasgetiren, M.F., Suganthan, P.N., & Liang, Y.-C. (2010b). Solving Lot-streaming
Flow Shop Scheduling Problems Using a Discrete Harmony Search Algorithm. New York: Ieee.
-769-Journal of Industrial Engineering and Management – http://dx.doi.org/10.3926/jiem.553
Pan, Q.-K., Wang, L., Gao, L., & Li, J. (2011). An effective shuffled frog-leaping algorithm for
lot-streaming flow shop scheduling problem RID C-7528-2009. International Journal of
Advanced Manufacturing Technology, 52(5-8), 699-713. http://dx.doi.org/10.1007/s00170-010-
2775-3
Potts, C.N., & Baker, K.R. (1989). Flow shop scheduling with lot streaming. Operations
Research Letters, 8(6), 297-303. http://dx.doi.org/10.1016/0167-6377(89)90013-8
Sarin, S.C., & Jaiprakash, P. (2007). Flow Shop Lot Streaming. Springer.
http://dx.doi.org/10.1007/978-0-387-47688-9
Sen, A., Topaloglu, E., & Benli, O. (1998). Optimal streaming of a single job in a two-stage flow
shop. European Journal of Operational Research, 110(1), 42-62.
http://dx.doi.org/10.1016/S0377-2217(98)00203-3
Sriskandarajah, C., & Wagneur, E. (1999). Lot streaming and scheduling multiple products in
two-machine no-wait flowshops. Iie Transactions, 31(8), 695-707.
http://dx.doi.org/10.1080/07408179908969869
Trietsch, D., & Baker, K. (1993). Basic Techniques for lot streaming. Operations Research,
41(6), 1065-1076. http://dx.doi.org/10.1287/opre.41.6.1065
Truscott, W. (1985). Scheduling production activities in multi-stage batch manufacturing
systems. International Journal of Production Research, 23(2), 315-328.
http://dx.doi.org/10.1080/00207548508904710
Vickson, R.G. (1995). Optimal lot streaming for multiple products in a two-machine flow shop.
European Journal of Operational Research, 85(3), 556-575. http://dx.doi.org/10.1016/0377-
2217(93)E0366-6
Vickson, R.G., & Alfredsson, B.E. (1992). Two- and three-machine flow shop scheduling
problems with equal sized transfer batches. International Journal of Production Research,
30(7), 1551-1574. http://dx.doi.org/10.1080/00207549208948107
Wagneur, E. (2001). Lotstreaming in no-wait flowshops with one machine never idle. New
York: Ieee.
Thank you for copying data from http://www.arastirmax.com
