How to cite this paper
Centobelli, P., Converso, G., Murino, T & Santillo, L. (2016). Flow shop scheduling algorithm to optimize warehouse activities.International Journal of Industrial Engineering Computations , 7(1), 49-66.
Refrences
Accorsi, R., Manzini, R., & Maranesi, F. (2014). A decision-support system for the design and management of warehousing systems. Computers in Industry, 65(1), 175–186.
Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving job processing times. European Journal of Operational Research, 70, 335-341.
Allahverdi, A. (2004). A new heuristic for m-machine flow-shop scheduling problem with bi-criteria of makespan and maximum tardiness. Computers & Operations Research, 31(2), 157–180.
Arroyo, J.C., & Armentano, V.A. (2004). A partial enumeration heuristic for multi-objective flow-shop scheduling problems. Journal of the Operational Research Society, 55, 1000–1007.
Ashour, S. (1967). A decomposition approach for the machine scheduling problem. The International Journal of Production Research, 6(2), 109-122.
Ashour, S. (1970). A modified decomposition algorithm for scheduling problems. The International Journal of Production Research, 8(3), 281-284.
Averbakh, I., & Berman, O. (1999). A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems. Operations Research,47(1), 165-170.
Bagdasaryan, A. (2011). Discrete dynamic simulation models and technique for complex control systems. Simulation Modelling Practice and Theory, 19, 1061-1087.
Belarbi, K., & Hindi, K.S. (1992). Detail scheduling for a class of two-stage intermittent manufacturing systems. Production Planning & Control, 3(1), 36-47.
Braglia, M., & Grassi, A. (2009). A new heuristic for the flow-shop scheduling problem to minimize makespan and maximum tardiness. International Journal of Production Research, 47(1), 273–288.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the n job, m machine sequencing problem. Management science, 16(10), B-630.
Cao, J., & Bedworth, D.D. (1992). Flow shop scheduling in a serial multi-product process with transfer and set-up times. International Journal of Production Research, 30(8), 1819-1830.
Chandra, P., Mehta, P., & Tirupati, D. (2009). Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research, 47(20), 5591–5610.
Daniels, R.L., & Chambers, R.J. (1990). Multi objective flow-shop scheduling. Naval Research Logistics Quarterly, 37, 981–995.
Dobson, G., & Yano, C.A. (1994). Cyclic scheduling to minimize inventory in a batch flow line. European Journal of Operational Research, 77, 441-461.
Dotoli, M., Epicoco, N., Falagario, M., Costantino, N., & Turchiano, B. (2015). An integrated approach for warehouse analysis and optimization: A case study. Computers in Industry, 70(1), 56-69.
Eren, T., & Güner, E. (2008). The tricriteria flow-shop scheduling problem. International Journal of Advanced Manufacturing Technology, 36, 1210–1220.
Framinan, J.M., Gupta, J.N.D., & Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 55, 1243-1255.
Framinan, J.M., Leisten, R., & Ruiz-Usano, R. (2002). Efficient heuristics for flow-shop sequencing with objectives of makespan and flow time minimization. European Journal of Operational Research, 141, 561–571.
Framinan, J.M., & Leisten, R. (2008). A multi-objective iterated greedy search for flow-shop scheduling with makespan and flow time criteria. OR Spectrum, 30, 787–804.
Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of operations research, 1(2), 117-129.
Gelders, L.F., & Samdandam, N. (1978). Four simple heuristics for scheduling a flow-shop. International Journal of Production Research, 16, 221–231.
Greiner, R., Puig, J., Huchery, C., Collier, N., & Garnett, S.T. (2014). Scenario modelling to support industry strategic planning and decision making. Environmental Modelling and Software, 55, 120-131.
Guinet, A.G.P. (1993). Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. International Journal of Production Research, 31(7), 1579- 1594.
Guinet, A.G.P., & Slomon, M.M. (1996). Scheduling hybrid flow-shops to minimize maximum tardiness or maximum completion time. International Journal of Production Research, 34(6), 1643-1654.
Gupta, J.N.D. (1968). Heuristic rules for n x m flow-shop scheduling problem. Opsearch, 5, 165-170.
Gupta, J.N.D. (1971). A functional heuristic for the flow-shop scheduling problem. Operations Research Quarterly, 22, 39-47.
Gupta, J.N.D. (1971). Flow-shop scheduling via sorting analogy. UARI Research Report, 109, University of Alabama in Huntsville, USA.
Gupta, J.N.D. (1972). Heuristic algorithms for multistage flow-shop scheduling problem. AIIE Trans, 4, 11-18.
Gupta, J.N.D. (1979). A review of flow-shop scheduling research, In: Ritzman LP, Krajewski LJ, Berry WL, Goodman SM, Hardy ST, Vitt LD (eds), Disaggregation Problems in Manu-facturing and Service Operations, Martin Nijhoff Publishers, The Hague, Netherlands, 363-388.
Gupta, J.N.D. (1988). Two-stage hybrid flow-shop scheduling problem. Journal of the Operational Research Society, 39(4), 359-364.
Gupta, J.N.D., Hennig, K., & Werner F. (2001). Minimizing total flow time in a 2-machine flow shop problem with minimum makespan. International Journal of Production Economics, 69, 323–338.
Gupta, J.N.D., Hennig, K., & Werner, F. (2002). Local search heuristics for two-stage flow shop problems with secondary criterion. Computers & Operations Research, 29(2), 123–149.
Gupta, J.N.D., & Maykut, A.R. (1973). Flow-shop scheduling by heuristic decomposition. International Journal of Production Research, 11, 105-111.
Gupta, J.N.D., & Tunc, E.A. (1991). Scheduling for a two-stage hybrid flow-shop with parallel machines at the second stage. International Journal of Production Research, 29(7), 1489-1502.
Hall, R.W. (1988). Cyclic scheduling for improvement. International Journal of Production Research, 26(3), 457-472.
Hannen, C. (1994). Study of a NP-hard cyclic scheduling problem: The recurrent job-shop. European Journal of Production Research, 72, 82-101.
Haq, A., & Ramanan, TR. (2006). A bi-criterion flow shop scheduling using artificial neural network. International Journal of Advanced Manufacturing Technology, 3, 1132–1138.
Hedge, G.G., Shang, J.S., & Tadikamalla, P.R. (1991). An integrated approach for production planning - A case study. OMEGA, 19(5), 413-419.
Hedge, G.G., Shang, J.S., & Tadikamalla, P.R. (1991). An integrated approach for production planning-A case study, OMEGA, 19(5), 413-419.
Ho, J.C., & Chang, Y.L. (1991). A new heuristic for the n-job, m-machine flow-shop problem. European Journal of Operational Research, 52, 194–202.
Hodgeson, T.J., & Wang, D. (1991). Optimal hybrid push/pull control strategies for a parallel multistage system. International Journal of Production Research, 29(6), 1279-1287.
Hoogeveen, J.A., Lenstra, J.K., & Veltman, B. (1996). Primitive scheduling in a two-stage multiprocessor flow shop is NP-hard. European Journal of Operational Research, 89, 172-175.
Huq, F., & Huq, Z. (1995). The sensitivity of rule combination for scheduling in a hybrid job shop. International Journal of Operations & Production Management, 15(3), 59-75.
Ishibuchi, H., Yoshida, T., & Murata, T. (2003). Balance between genetic search and local search in memetic algorithms for multiobjective permutation flow-shop scheduling. IEEE Transactions on Evolutionary Computation, 7(2), 204–223.
Jacobs, F.R., & Bragg, D.J. (1988). Repetitive lots: Flow-time reductions through sequencing and dynamic batch sizing. Decision Sciences, 19, 281-294.
Johnson, S.M. (1954). Optimal two- and three-stage production schedules with setup times included. NavalResearch Logistics Quarterly, 1(l), 61-68.
Kalczynski, P.J., & Kamburowski, J. (2007). On the NEH heuristic for minimizing the makespan in permutation flow shops. OMEGA–The International Journal of Management Science, 35(1), 53–60.
Kamoun, H., & Sriskandarajah, S. (1993). The complexity of scheduling jobs in repetitive manufacturing systems. European Journal of Production Research, 70, 350-364.
King, J.R., & Spachis, A.S. (1980). Heuristics for flow-shop scheduling. International Journal of Production Research, 18, 345-357.
Liao, C.-J., Yu, W.-C., & Joe, C.-B. (1997). Bicriterion scheduling in the two-machine flow- shop. Journal of the Operational Research Society, 48(9), 929–935.
Loerch, A.G., & Muckstadt, J.A. (1994). An approach to production planning and scheduling in cyclically scheduled manufacturing systems. International Journal of Production Research, 32(4), 851-871.
Lourenço, HR (1996). Sevast & apos; yanov & apos; s algorithm for the flow-shop scheduling problem. European Journal of Operational Research, 91, 176-189.
McMahon, G.B., & Lim, C. (1993). The two-machine flow shop problem with arbitrary precedence relations. European Journal of Operational Research, 64, 249-257.
Moccellin, J.V. (1995). A new heuristic method for the permutation flow-shop scheduling problem. Journal of Operations Research Society, 46, 883-886.
Munier, A. (1996). The complexity of a cyclic scheduling problem with identical machines and precedence constraints. European Journal of Operational Research, 91, 471-480.
Nagar, A., Heragu, S.S., & Haddock J. (1995). A branch and bound approach for two- machine flow shop scheduling problem. Journal of the Operational Research Society, 46, 721–734.
Narasimhan, S. L., & Panwalker, S.S. (1984). Scheduling in a two-stage manufacturing process. International Journal of Production Research, 22(4), 555-564.
Narasimhan, S.L., & Mangiameli, P.M. (1987). A comparison of sequencing rules for a two-stage hybrid flow shop. Decision Sciences, 18, 250-265.
Nawaz, M., Enscore, E., & Ham I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA–The International Journal of Management Science, 11(1), 91–95.
Nawaz, M., Enscore, E.E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega-International Journal of Management Science, 11, 91-95.
Palmer, D.S. (1965). Sequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near-optimum. Operations Research Quarterly, 16, 101-107.
Panwalker, S.S. (1991). Scheduling in a two-machine flow shop with travel time between machines. Journal of the Operational Research Society, 42(7), 609-613.
Park, Y.B., Pegden, C.D., & Enscore, E.E. (1984). A survey and evaluation of static flow-shop scheduling heuristic. International Journal of Production Research, 22, 127-141.
Paul, R.J. (1979). A production scheduling problem in the glass-container industry. Operations Research, 27, 290-302.
Pinedo, M. (1995). Scheduling: Theory, Algorithms and Systems. Prentice-Hall: Englewood Cliffs, NJ.
Pinto, P.A., & Rao, B.M. (1992). Joint lot-sizing and scheduling for multi-stage multi-product flow shops. International Journal of Production Research, 30(5), 1137-1152.
Rajendran, C. (1994). A heuristic algorithm for scheduling in flow-shop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research, 32, 2541–2558.
Rajendran, C. (1995). Heuristics for scheduling in flow-shop with multiple objectives. European Journal of Operational Research, 82, 540–555.
Smunt, T.L., Buss, D.H., & Kropp, D H. (1996). Lot splitting in stochastic flow shop and job shop environments. Decision Sciences, 27, 215-238.
So, K.C. (1990). Some heuristics for scheduling jobs on parallel machines with Setup. Management Science, 36(4), 467-475.
Tan, W., Chai, Y., Wang, W., & Liu, Y. (2012). General modeling and simulation for enterprise operational decision-making problem: A policy-combination perspective. Simulation Modelling Practice and Theory, 21(1), 1-20.
Tang, L., Liu, W., & Liu, J. (2005). A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing, 16(3), 361-370.
Tsubone, H. (1975). Production scheduling system in the food manufacturing industry. 27th Conference Proceeding of Zennohren Society, Yamaguchi City, 240-244 (in Japanese).
Tsubone, H., Ohba, M., Takamuki, H., & Miyake, Y. (1993). A production scheduling system for a hybrid flow shop- A case study. OMEGA, 21(3), 205-214.
Tsubone, H., Ohba, M., & Uetake, T. (1996). The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop. International Journal of Production Research, 34(l l), 3037-3054.
Tsubone, H., & Tanaka, T. (1988). Production scheduling system in the flow shop. OMEGA, 16(6), 608-611.
Uetake, T., Tsubone, H., & Ohba, M. (1995). A production scheduling system in a hybrid flow shop. International Journal of Production Economics, 41, 395- 398.
Uysal, O., & Bulkan, S. (2008). Comparison of genetic algorithm and particles warm optimization for bicriteria permutation flow-shop scheduling problem. International Journal of Computational Intelligence Research, 4(2), 159–175.
Uzsoy, U. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615-1635.
Varadharajan, T.K., & Rajendran, C., (2005). A multi-objective simulated-annealing algorithm for scheduling in flow-shops to minimize the makespan and total flow time of jobs. European Journal of Operational Research, 167, 772–795.
Widmer, M., & Hertz, A. (1991). A new heuristic method for the flow-shop sequencing problem. European Journal of Operational Research, 41, 186-193.
Wittrock, R.J. (1988). An adaptable scheduling algorithm for flexible flow lines. Operations Research, 36(3), 445-453.
Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving job processing times. European Journal of Operational Research, 70, 335-341.
Allahverdi, A. (2004). A new heuristic for m-machine flow-shop scheduling problem with bi-criteria of makespan and maximum tardiness. Computers & Operations Research, 31(2), 157–180.
Arroyo, J.C., & Armentano, V.A. (2004). A partial enumeration heuristic for multi-objective flow-shop scheduling problems. Journal of the Operational Research Society, 55, 1000–1007.
Ashour, S. (1967). A decomposition approach for the machine scheduling problem. The International Journal of Production Research, 6(2), 109-122.
Ashour, S. (1970). A modified decomposition algorithm for scheduling problems. The International Journal of Production Research, 8(3), 281-284.
Averbakh, I., & Berman, O. (1999). A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems. Operations Research,47(1), 165-170.
Bagdasaryan, A. (2011). Discrete dynamic simulation models and technique for complex control systems. Simulation Modelling Practice and Theory, 19, 1061-1087.
Belarbi, K., & Hindi, K.S. (1992). Detail scheduling for a class of two-stage intermittent manufacturing systems. Production Planning & Control, 3(1), 36-47.
Braglia, M., & Grassi, A. (2009). A new heuristic for the flow-shop scheduling problem to minimize makespan and maximum tardiness. International Journal of Production Research, 47(1), 273–288.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the n job, m machine sequencing problem. Management science, 16(10), B-630.
Cao, J., & Bedworth, D.D. (1992). Flow shop scheduling in a serial multi-product process with transfer and set-up times. International Journal of Production Research, 30(8), 1819-1830.
Chandra, P., Mehta, P., & Tirupati, D. (2009). Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research, 47(20), 5591–5610.
Daniels, R.L., & Chambers, R.J. (1990). Multi objective flow-shop scheduling. Naval Research Logistics Quarterly, 37, 981–995.
Dobson, G., & Yano, C.A. (1994). Cyclic scheduling to minimize inventory in a batch flow line. European Journal of Operational Research, 77, 441-461.
Dotoli, M., Epicoco, N., Falagario, M., Costantino, N., & Turchiano, B. (2015). An integrated approach for warehouse analysis and optimization: A case study. Computers in Industry, 70(1), 56-69.
Eren, T., & Güner, E. (2008). The tricriteria flow-shop scheduling problem. International Journal of Advanced Manufacturing Technology, 36, 1210–1220.
Framinan, J.M., Gupta, J.N.D., & Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 55, 1243-1255.
Framinan, J.M., Leisten, R., & Ruiz-Usano, R. (2002). Efficient heuristics for flow-shop sequencing with objectives of makespan and flow time minimization. European Journal of Operational Research, 141, 561–571.
Framinan, J.M., & Leisten, R. (2008). A multi-objective iterated greedy search for flow-shop scheduling with makespan and flow time criteria. OR Spectrum, 30, 787–804.
Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of operations research, 1(2), 117-129.
Gelders, L.F., & Samdandam, N. (1978). Four simple heuristics for scheduling a flow-shop. International Journal of Production Research, 16, 221–231.
Greiner, R., Puig, J., Huchery, C., Collier, N., & Garnett, S.T. (2014). Scenario modelling to support industry strategic planning and decision making. Environmental Modelling and Software, 55, 120-131.
Guinet, A.G.P. (1993). Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. International Journal of Production Research, 31(7), 1579- 1594.
Guinet, A.G.P., & Slomon, M.M. (1996). Scheduling hybrid flow-shops to minimize maximum tardiness or maximum completion time. International Journal of Production Research, 34(6), 1643-1654.
Gupta, J.N.D. (1968). Heuristic rules for n x m flow-shop scheduling problem. Opsearch, 5, 165-170.
Gupta, J.N.D. (1971). A functional heuristic for the flow-shop scheduling problem. Operations Research Quarterly, 22, 39-47.
Gupta, J.N.D. (1971). Flow-shop scheduling via sorting analogy. UARI Research Report, 109, University of Alabama in Huntsville, USA.
Gupta, J.N.D. (1972). Heuristic algorithms for multistage flow-shop scheduling problem. AIIE Trans, 4, 11-18.
Gupta, J.N.D. (1979). A review of flow-shop scheduling research, In: Ritzman LP, Krajewski LJ, Berry WL, Goodman SM, Hardy ST, Vitt LD (eds), Disaggregation Problems in Manu-facturing and Service Operations, Martin Nijhoff Publishers, The Hague, Netherlands, 363-388.
Gupta, J.N.D. (1988). Two-stage hybrid flow-shop scheduling problem. Journal of the Operational Research Society, 39(4), 359-364.
Gupta, J.N.D., Hennig, K., & Werner F. (2001). Minimizing total flow time in a 2-machine flow shop problem with minimum makespan. International Journal of Production Economics, 69, 323–338.
Gupta, J.N.D., Hennig, K., & Werner, F. (2002). Local search heuristics for two-stage flow shop problems with secondary criterion. Computers & Operations Research, 29(2), 123–149.
Gupta, J.N.D., & Maykut, A.R. (1973). Flow-shop scheduling by heuristic decomposition. International Journal of Production Research, 11, 105-111.
Gupta, J.N.D., & Tunc, E.A. (1991). Scheduling for a two-stage hybrid flow-shop with parallel machines at the second stage. International Journal of Production Research, 29(7), 1489-1502.
Hall, R.W. (1988). Cyclic scheduling for improvement. International Journal of Production Research, 26(3), 457-472.
Hannen, C. (1994). Study of a NP-hard cyclic scheduling problem: The recurrent job-shop. European Journal of Production Research, 72, 82-101.
Haq, A., & Ramanan, TR. (2006). A bi-criterion flow shop scheduling using artificial neural network. International Journal of Advanced Manufacturing Technology, 3, 1132–1138.
Hedge, G.G., Shang, J.S., & Tadikamalla, P.R. (1991). An integrated approach for production planning - A case study. OMEGA, 19(5), 413-419.
Hedge, G.G., Shang, J.S., & Tadikamalla, P.R. (1991). An integrated approach for production planning-A case study, OMEGA, 19(5), 413-419.
Ho, J.C., & Chang, Y.L. (1991). A new heuristic for the n-job, m-machine flow-shop problem. European Journal of Operational Research, 52, 194–202.
Hodgeson, T.J., & Wang, D. (1991). Optimal hybrid push/pull control strategies for a parallel multistage system. International Journal of Production Research, 29(6), 1279-1287.
Hoogeveen, J.A., Lenstra, J.K., & Veltman, B. (1996). Primitive scheduling in a two-stage multiprocessor flow shop is NP-hard. European Journal of Operational Research, 89, 172-175.
Huq, F., & Huq, Z. (1995). The sensitivity of rule combination for scheduling in a hybrid job shop. International Journal of Operations & Production Management, 15(3), 59-75.
Ishibuchi, H., Yoshida, T., & Murata, T. (2003). Balance between genetic search and local search in memetic algorithms for multiobjective permutation flow-shop scheduling. IEEE Transactions on Evolutionary Computation, 7(2), 204–223.
Jacobs, F.R., & Bragg, D.J. (1988). Repetitive lots: Flow-time reductions through sequencing and dynamic batch sizing. Decision Sciences, 19, 281-294.
Johnson, S.M. (1954). Optimal two- and three-stage production schedules with setup times included. NavalResearch Logistics Quarterly, 1(l), 61-68.
Kalczynski, P.J., & Kamburowski, J. (2007). On the NEH heuristic for minimizing the makespan in permutation flow shops. OMEGA–The International Journal of Management Science, 35(1), 53–60.
Kamoun, H., & Sriskandarajah, S. (1993). The complexity of scheduling jobs in repetitive manufacturing systems. European Journal of Production Research, 70, 350-364.
King, J.R., & Spachis, A.S. (1980). Heuristics for flow-shop scheduling. International Journal of Production Research, 18, 345-357.
Liao, C.-J., Yu, W.-C., & Joe, C.-B. (1997). Bicriterion scheduling in the two-machine flow- shop. Journal of the Operational Research Society, 48(9), 929–935.
Loerch, A.G., & Muckstadt, J.A. (1994). An approach to production planning and scheduling in cyclically scheduled manufacturing systems. International Journal of Production Research, 32(4), 851-871.
Lourenço, HR (1996). Sevast & apos; yanov & apos; s algorithm for the flow-shop scheduling problem. European Journal of Operational Research, 91, 176-189.
McMahon, G.B., & Lim, C. (1993). The two-machine flow shop problem with arbitrary precedence relations. European Journal of Operational Research, 64, 249-257.
Moccellin, J.V. (1995). A new heuristic method for the permutation flow-shop scheduling problem. Journal of Operations Research Society, 46, 883-886.
Munier, A. (1996). The complexity of a cyclic scheduling problem with identical machines and precedence constraints. European Journal of Operational Research, 91, 471-480.
Nagar, A., Heragu, S.S., & Haddock J. (1995). A branch and bound approach for two- machine flow shop scheduling problem. Journal of the Operational Research Society, 46, 721–734.
Narasimhan, S. L., & Panwalker, S.S. (1984). Scheduling in a two-stage manufacturing process. International Journal of Production Research, 22(4), 555-564.
Narasimhan, S.L., & Mangiameli, P.M. (1987). A comparison of sequencing rules for a two-stage hybrid flow shop. Decision Sciences, 18, 250-265.
Nawaz, M., Enscore, E., & Ham I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA–The International Journal of Management Science, 11(1), 91–95.
Nawaz, M., Enscore, E.E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega-International Journal of Management Science, 11, 91-95.
Palmer, D.S. (1965). Sequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near-optimum. Operations Research Quarterly, 16, 101-107.
Panwalker, S.S. (1991). Scheduling in a two-machine flow shop with travel time between machines. Journal of the Operational Research Society, 42(7), 609-613.
Park, Y.B., Pegden, C.D., & Enscore, E.E. (1984). A survey and evaluation of static flow-shop scheduling heuristic. International Journal of Production Research, 22, 127-141.
Paul, R.J. (1979). A production scheduling problem in the glass-container industry. Operations Research, 27, 290-302.
Pinedo, M. (1995). Scheduling: Theory, Algorithms and Systems. Prentice-Hall: Englewood Cliffs, NJ.
Pinto, P.A., & Rao, B.M. (1992). Joint lot-sizing and scheduling for multi-stage multi-product flow shops. International Journal of Production Research, 30(5), 1137-1152.
Rajendran, C. (1994). A heuristic algorithm for scheduling in flow-shop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research, 32, 2541–2558.
Rajendran, C. (1995). Heuristics for scheduling in flow-shop with multiple objectives. European Journal of Operational Research, 82, 540–555.
Smunt, T.L., Buss, D.H., & Kropp, D H. (1996). Lot splitting in stochastic flow shop and job shop environments. Decision Sciences, 27, 215-238.
So, K.C. (1990). Some heuristics for scheduling jobs on parallel machines with Setup. Management Science, 36(4), 467-475.
Tan, W., Chai, Y., Wang, W., & Liu, Y. (2012). General modeling and simulation for enterprise operational decision-making problem: A policy-combination perspective. Simulation Modelling Practice and Theory, 21(1), 1-20.
Tang, L., Liu, W., & Liu, J. (2005). A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing, 16(3), 361-370.
Tsubone, H. (1975). Production scheduling system in the food manufacturing industry. 27th Conference Proceeding of Zennohren Society, Yamaguchi City, 240-244 (in Japanese).
Tsubone, H., Ohba, M., Takamuki, H., & Miyake, Y. (1993). A production scheduling system for a hybrid flow shop- A case study. OMEGA, 21(3), 205-214.
Tsubone, H., Ohba, M., & Uetake, T. (1996). The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop. International Journal of Production Research, 34(l l), 3037-3054.
Tsubone, H., & Tanaka, T. (1988). Production scheduling system in the flow shop. OMEGA, 16(6), 608-611.
Uetake, T., Tsubone, H., & Ohba, M. (1995). A production scheduling system in a hybrid flow shop. International Journal of Production Economics, 41, 395- 398.
Uysal, O., & Bulkan, S. (2008). Comparison of genetic algorithm and particles warm optimization for bicriteria permutation flow-shop scheduling problem. International Journal of Computational Intelligence Research, 4(2), 159–175.
Uzsoy, U. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615-1635.
Varadharajan, T.K., & Rajendran, C., (2005). A multi-objective simulated-annealing algorithm for scheduling in flow-shops to minimize the makespan and total flow time of jobs. European Journal of Operational Research, 167, 772–795.
Widmer, M., & Hertz, A. (1991). A new heuristic method for the flow-shop sequencing problem. European Journal of Operational Research, 41, 186-193.
Wittrock, R.J. (1988). An adaptable scheduling algorithm for flexible flow lines. Operations Research, 36(3), 445-453.