References

Bagchi, T.P., J.N.D. Gupta and C. Sriskandarajah, 2006. A review of TSP based approaches for flowshop scheduling. Eur. J. Operat. Res., 169: 816-854.
Direct Link  |  

Bao, Y., H. Jing and L. Zheng, 2011. A hybrid based GA and HS algorithms in blocking flow shop scheduling problems. Proceedings of the 2nd International Conference on Mechanic Automation and Control Engineering, July 15-17, 2011, Hohhot, pp: 953-956.

Brucker, P., 1998. Scheduling Algorithms. 2nd Edn., Springer, Heidelberg, USA.

Bucki, R. and B. Chramcov, 2011. Modelling and simulation of the order realization in the serial production system. Int. J. Math. Models Methods Applied Sci., 5: 1233-1240.
Direct Link  |  

Carlier, J. and I. Rebai, 1996. Two branch-and-bound algorithms for the permutation flow shop problem. Eur. J. Operat. Res., 90: 238-251.

Chakraborty, U.K. and D. Laha, 2007. An improved heuristic for permutation flowshop scheduling. Int. J. Inform. Commun. Technol., 1: 89-97.
Direct Link  |  

Chen, J.S., J.C.H. Pan and C.K. Wu, 2008. Hybrid tabu search for re-entrant permutation flow-shop scheduling problem. Expert Syst. Appl., 34: 1924-1930.
Direct Link  |  

Dannenbring, D.G., 1997. An evaluation of flow shop sequencing heuristics. Manage. Sci., 23: 1174-1182.
Direct Link  |  

Dorigo, M. and L.M. Gambardella, 1997. Ant colonies for the traveling salesman problem. Bio Systems, 43: 73-81.
PubMed  |  Direct Link  |  

Duda, J., 2006. Local search and nature based metaheuristics: A case of flow shop scheduling problem. Proceedings of the International Multiconference on Computer Science and Information Technology, November 6-10, 2006, Wisla, Poland, pp: 17-24.

Engin, O. and A. Doyen, 2007. A new approach to solve flow shop scheduling problems by artificial immune systems. Dogus Universitesi Dergisi, 8: 12-27.
Direct Link  |  

Fink, A. and S. Vob, 2001. Solving the continuous flow-shop scheduling problem by meta-heuristics. Eur. J. Operat. Res., 151: 400-414.
Direct Link  |  

Framinan, J.M., J.N.D. Gupta and R. Leisten, 2004. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Operat. Res. Soc., 55: 1243-1255.
Direct Link  |  

Gao, J. and R. Chen, 2011. An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems. Scient. Res. Essays, 6: 3094-3100.
Direct Link  |  

Garey, M.R., D.S. Johnson and R. Sethi, 1976. The complexity of flow shop and job shop scheduleing. Math. Operat. Res., 1: 117-129.
CrossRef  |  

Graham, R.L., E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, 1979. Optimization and approximation in deterministic sequencing and scheduling theory: A survey. Ann. Discrete Math., 5: 287-326.
CrossRef  |  

Guanlong, D. and G. Xingsheng, 2012. A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion. Comput. Operat. Res., 38: 2152-2160.

Hamdi, I. and T. Loukil, 2011. Minimizing the makespan in the permutation flowshop problem with minimal and maximal time lags. Proceedings of the International Conference on Communications, Computing and Control Applications, March 3-5, 2011, Tunisia, pp: 1-6.

Haouari, M. and T. Ladhari, 2003. A branch-and-bound based local search method for the flow shop problem. J. Operat. Res. Soc., 54: 1070-1084.
Direct Link  |  

Hyer, N.L., 1987. Capabilities of Group Technology. 1st Edn., Computer and Automated Systems Association of SME, Dearborn, MI., Pages: 428.

Jarboui, B., S. Ibrahim, P. Siarry and A. Rebai, 2007. A combinatorial particle swarm optimization for solving permutation flowshop problems. Comput. Indus. Eng., 54: 526-538.

Johnson, S.M., 1954. Optimal two and three stage production schedule with set up times included. Naval Res. Logistics Q., 8: 61-68.

Johnson, S.M., 1954. Optimal two-and three-stage production schedules with setup times included. Naval Res. Logistics Q., 8: 1-61.

Khodadadi, A., 2011. Solving constrained flow-shop scheduling problem with three machines. Int. J. Acad. Res., 3: 38-40.

Lenstra, J.K., A.H.G. Rinnooy Kan and P. Brucker, 1977. Complexity of machine scheduling problems. Ann. Discrete Math., 1: 343-362.
CrossRef  |  Direct Link  |  

Liu, B., L. Wang and Y.H. Jiu, 2007. An effective PSO-based Memetic Algorithm for flow shop scheduling. IEEE Trans. Syst. Man Cybernetics Part B: Cybernetics, 37: 18-27.
CrossRef  |  

Mehta, P., P. Pandit, D. Philip and P. Sharma, 2011. An efficient local search for minimizing completion time variance in permutation flow shops. Comput. Operat. Res., 39: 1000-1009.

Minella, G., R. Ruiz and M. Ciavotta, 2011. Restarted iterated pareto greedy algorithm for multi-objective flowshop scheduling problems. Comput. Operat. Res., 38: 1521-1533.

Moccellin, J.V., 1995. A new heuristic methods for the permutation flowshop scheduling problem. J. Operat. Res. Soc., 46: 883-886.

Modrak, V. and J. Mandulak, 2009. Mapping development of MES functionalities. Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics Signal Processing, Systems Modeling and Control, July 2-5, 2009, Milan, Italy, pp: 244-247.

Modrak, V. and J. Modrak, 2009. Relationships between batch sizes, sequencing and lead-times. Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics Signal Processing, Systems Modeling and Control, July 2-5, 2009, Milan, Italy, pp: 380-383.

Modrak, V. and R.S. Pandian, 2010. Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem. Tehnicki Vjesnik, 17: 273-278.

Modrak, V. and V. Moskvich, 2011. Impacts of RFID implementation on cost structure in networked manufacturing. Int. J. Prod. Res., 50: 3847-3859.
CrossRef  |  

Naderi, B. and R. Ruiz, 2008. The distributed permutation flowshop scheduling problem. http://www.upv.es/deioac/Investigacion/Naderi_Ruiz_DPFSP.pdf.

Nagarajan, V. and M. Sviridenko, 2009. Tight bounds for permutation flow shop scheduling. Math. Operat. Res., 34: 417-427.
Direct Link  |  

Nowicki, E., 1993. An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times. Eur. J. Operat. Res., 70: 342-349.

Pan, Q.K. and R. Ruiz, 2011. An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega, 40: 166-180.

Pan, Q.K., L. Wang and B.H. Zhao, 2007. An improved iterated greedy algorithm for the no-wait ow shop scheduling problem with makespan criterion. The Int. J. Adv. Manufactur. Technol., 38: 778-786.

Pan, Q.K., L. Wang and L. Gao, 2011. A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. Applied Soft Comput. J., 11: 5270-5280.

Poggi, M. and D. Sotelo, 2012. A linear time approximation algorithm for permutation flow shop scheduling. Theor. Comput. Sci., 416: 87-94.
CrossRef  |  

Rabanimotlagh, A., 2011. An efficient ant colony optimization algorithm for multiobjective flow shop scheduling problem. World Acad. Sci. Eng. Technol., 51: 127-133.

Rajendran, R.C. and Z. Hans, 2004. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur. J. Operat. Res., 155: 426-438.
CrossRef  |  Direct Link  |  

Salmasi, N., R. Logendran and M.R. Skandari, 2010. Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Comput. Operat. Res., 37: 199-212.
CrossRef  |  

Seda, M., 2007. Mathematical models of flow shop and job shop scheduling problems. World Acad. Sci. Eng. Technol., Vol. 31.

Semanco, P. and V. Modrak, 2011. Hybrid GA-based improvement heuristic with makespan criterion for flow-shop scheduling problems. Commun. Comput. Inf. Sci., 220: 11-18.
Direct Link  |  

Semanco, P., V. Modrak, R.S. Pandian and P. Knuth, 2011. Using genetic algorithm for elimination of exceptional elements in the stage of PFA. J. Eng. Applied Sci., 6: 122-126.

Sethi, S.P., C. Sriskandarajah, G. Sorger, J. Blazewicz and W. Kubiak, 1992. Sequencing of parts and robot moves in a robotic cell. Int. J. Flexible Manuf. Syst., 4: 331-358.
Direct Link  |  

Sethi, S.P., C. Sriskandarajah, S. van de Velde, Y. Wang and H. Hoogeveen, 1999. Minimizing makespan in a pallet-constrained flowshop. J. Scheduling, 2: 115-133.
CrossRef  |  

Shanthikumar, J.G. and Y.B. Wu, 1985. Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems. Eur. J. Operat. Res., 19: 125-141.
Direct Link  |  

Stutzle, T. and H. Hoos, 1997. The MAX-MIN Ant System and local search for the traveling salesman problem. Proceedings of the IEEE International Conference on Evolutionary Computation, April 13-16, 1997, Indianapolis, IN., pp: 309-314.

Sule, D.R., 1982. Sequencing n jobs on two machines with setup, processing and removal times separated. Naval Res. Logist. Q., 29: 517-519.
CrossRef  |  

Suliman S.M.A., 2000. A two-phase heuristic approach to the permutation flow-shop scheduling problem. In. J. Prod. Econ., 64: 143-152.
CrossRef  |  

Sun, L., X. Cheng and Y. Liang, 2010. Solving job shop scheduling problem using genetic algorithm with penalty function. Int. J. Intell. Inf. Process., 1: 65-77.
Direct Link  |  

Taillard, E., 1993. Benchmarks for basic scheduling problems. Eur. J. Operat. Res., 47: 278-285.
CrossRef  |  Direct Link  |  

Taillard, E.D., 1990. Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Operat. Res., 47: 65-74.
CrossRef  |  Direct Link  |  

Tsung-Che, C., C. Hsueh-Chien and F. Li-Chen, 2011. NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Exp. Syst. Appl., 38: 5986-5999.
CrossRef  |  

Tzeng, Y.R. and C.L. Chen, 2011. A hybrid EDA with ACS for solving permutation flow shop scheduling. Int. J. Adv. Manuf. Technol., 19: 1-9.
Direct Link  |  

Wagner, H.M., 1959. An integer linear-programming model for machine scheduling. Naval Res. Logist. Quart., 6: 131-140.
CrossRef  |  

Wang, B., 1997. Integrated Product, Process and Enterprise Design. 1st Edn., Springer, London, ISBN-10: 0412620200, Pages: 504.

Wang, L. and W. Shen, 2007.. Process Planning and Scheduling for Distributed Manufacturing. Springer, London, ISBN: 1846287510, Pages: 429.

Wang, L.P., Q.K. Tasgetiren and M. Fatih, 2011. A hybrid harmony search algorithm for the locking permutation flow shop scheduling problem. Comput. Ind. Eng., 61: 76-83.

Widmer, M. and A. Hertz, 1989. A new heuristic method for the flowshop sequencing problem. Eur. J. Operat. Res., 1: 186-193.
Direct Link  |  

Wittrock, R., 1985. Scheduling algorithms for flexible flow lines. IBM J. Res. Dev., 29: 401-412.
CrossRef  |  

Xiaofeng, L. and H. Zhao, 2009. Greedy algorithm solution of flexible flow shop scheduling problem. IJCSNS, 9: 177-180.
Direct Link  |  

Yalaoui, N., L. Amodeo, F. Yalaoui and H. Mahdi, 2010. Particle swarm optimization under fuzzy logic controller for solving a hybrid reentrant flow shop problem. Proceedings of the IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, April 19-23, 2010, Atlanta, GA., pp: 1-6.

Yamada, T. and C.R. Reevesm, 1998. Solving the Csum permutation flowshop scheduling problem by genetic local search. Proceedings of the IEEE International Evolutionary Computation Proceedings, May 4-9, 1998, Anchorage, AK., pp: 230-234.

Ying, K.C. and C.J. Liao, 2004. Ant colony system for permutation flowshop sequencing. Comput. Operat. Res., 31: 791-801.
CrossRef  |  

Zhongyi, M., M. Younus and L. Yongjin, 2011. Automated planning and scheduling system for the composite component manufacturing workshop. Eng. Lett., 19: 75-83.
Direct Link  |  

Zobolas, G.I., C.D. Tarantilis and G. Ioannou, 2009. Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput. Operat. Res., 36: 1249-1267.