References
- Arditi, D.; Tokdemir, O. B.; Suh, K. 2001. Effect of learning on line-of-balance scheduling, International Journal of Project Management 19(5): 265–277. http://dx.doi.org/10.1016/S0263-7863(99)00079-4.
- Bożejko, W.; Wodecki, M. 2002. Solving the flow shop problem by parallel tabu search, in Proc. of International Conference on Parallel Computing in Electrical Engineering (PARELEC ‘02) 2002, PR 01730: 189–194. http://dx.doi.org/10.1109/PCEE.2002.1115237
- Bożejko, W.; Wodecki, M. 2004. Parallel genetic algorithm for the flow shop scheduling problem, in Proc. of the 5th International Conference “Parallel Processing and Applied Mathematics” (PPAM 2003), 7–10 September, 2003, Czestochowa, Poland. Lecture Notes in Computer Science3019: 566–571.
- Bożejko, W.; Wodecki, M. 2007. On the theoretical properties of swap multimoves, Operations Research Letters 35(2): 227–231. http://dx.doi.org/10.1016/j.orl.2006.03.002.
- Bożejko, W.; Wodecki, M. 2008. Parallel scatter search algorithm for the flow shop sequencing problem, in Proc. of the 7th International Conference on Parallel Processing and Applied Mathematics (PPAM'07), 9–12 September, 2007, Gdansk, Poland. Lecture Notes in Computer Science4967: 180–188.
- Bożejko, W.; Hejducki, Z.; Wodecki, M. 2012. Applying metaheuristic strategies in construction projects management, Journal of Civil Engineering and Management 18(5): 621–630. http://dx.doi.org/10.3846/13923730.2012.719837.
- Chrzanowski, Jr E. N.; Johnston, D. W. 1996. Application of linear scheduling, Journal of Construction Engineering and Management 112(4): 476–491. http://dx.doi.org/10.1061/(ASCE)0733-9364(1986)112:4(476).
- El-Rayes, K.; Moselhi, O. 2001. Optimizing resource utilization for repetitive construction projects, Journal of Construction Engineering and Management 127(1): 18–27. http://dx.doi.org/10.1061/(ASCE)0733-9364(2001)127:1(18).
- Glover, F.; Laguna, M. 1997. Tabu search. Massachusetts, USA: Kluwer Academic Publishers. 382 p. http://dx.doi.org/10.1007/978-1-4615-6089-0
- Grabowski, J.; Wodecki, M. 2004. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Computers & Operations Research 31(11): 1891–1909. http://dx.doi.org/10.1016/S0305-0548(03)00145-X.
- Gupta, J.; Stafford, Jr E. F. 2006. Flowshop scheduling research after five decades, European Journal of Operational Research 169(3): 699–711. http://dx.doi.org/10.1016/j.ejor.2005.02.001.
- Gupta, D. 2012. Branch and bound technique for three stage flow shop scheduling problem including breakdown interval and transportation time, Journal of Information Engineering and Applications 2(1): 24–29.
- Hamerlink, D. J.; Rowings, J. E. 1998. Linear scheduling model: development of controlling activity path, Journal of Construction Engineering and Management 124(4): 263–268. http://dx.doi.org/10.1061/(ASCE)0733-9364(1998)124:4(263).
- Harris, R. B.; Ionnou, P. G. 1998. Scheduling projects with repeating activities, Journal of Construction Engineering and Management 124(4): 269–278. http://dx.doi.org/10.1061/(ASCE)0733-9364(1998)124:4(269).
- Hegazy, T. 1999. Optimization of construction time – cost trade- off analyses using genetic algorithms, Canadian Journal of Civil Engineering 26(6): 685–697. http://dx.doi.org/10.1139/l99-031.
- Ishubuchi, M.; Masaki, S.; Tanaka, H. 1995. Modified simulated annealing for the flow shop sequencing problems, European Journal of Operational Research 81(2): 388–398. http://dx.doi.org/10.1016/0377-2217(93)E0235-P.
- Johnston, D. W. 1984. Linear scheduling method for highway construction, Journal of Construction Division 107(2): 247–261.
- Karwat, B. 2012. Optimization of production schedules in the steel production system, Archives of Civil and Mechanical Engineering 12(2): 240–252.
- Lamoudan, T.; El Khoukhi, F.; El HilailiAlaoui, A.; Boukachour, J. 2011. Flow shop scheduling problem with transportation times, two-robots and inputs/outputs with limited capacity, International Journal of Intelligent Computing Research 2(1/2/3/4): 244–253.
- Lucko, G.; PeñaOrozco, A. A. 2009. Float types in linear schedule analysis with singularity functions, Journal of Construction Engineering and Management 135(5): 368–377. http://dx.doi.org/10.1061/(ASCE)CO.1943-7862.0000007.
- Mattila, K.; Abraham, D. 1998. Resource leveling of linear schedules using integer linear programming, Journal of Construction Engineering and Management 124(3): 232–244. http://dx.doi.org/10.1061/(ASCE)0733-9364(1998)124:3(232).
- Mattila, K. G.; Park, A. 2003. Comparison of linear scheduling model and repetitive scheduling method, Journal of Construction Engineering and Management 129(1): 56–64. http://dx.doi.org/10.1061/(ASCE)0733-9364(2003)129:1(56).
- Moselhi, O.; Lorterapong, P. 1995. Fuzzy vs probabilistic scheduling, in Proc. of the 12th Conference “Automation and Robotics in Construction” (ISARC), 1995, Warsaw, Poland, 441–448.
- Nawaz, M.; Enscore, E. E.; Ham, I. 1983. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA 11(1): 91–95. http://dx.doi.org/10.1016/0305-0483(83)90088-9.
- Nowicki, E.; Smutnicki, C. 1996. A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research 91(1): 160–175. http://dx.doi.org/10.1016/0377-2217(95)00037-2.
- O'Brien, J. J. 1969. Scheduling handbook. New York: McGraw Hill. 605 p.
- Reeves, C. R.; Yamada, T. 1998. Genetic algorithms, path relinking and the flowshop sequencing problem, Evolutionary Computation 6(1): 45–60. http://dx.doi.org/10.1162/evco.1998.6.1.45.
- Rogalska, M.; Bożejko, W.; Hejducki, Z. 2008. Time/cost optimization using hybrid evolutionary algorithm in construction project scheduling, Automation in Construction 18(1): 24–31. http://dx.doi.org/10.1016/j.autcon.2008.04.002.
- Taillard, E. 1993. Benchmarks for basic scheduling problems, European Journal of Operational Research 64(22): 278–285. http://dx.doi.org/10.1016/0377-2217(93)90182-M.
- Wodecki, M.; Bożejko, W. 2002. Solving the flow shop by parallel simulated annealing, in Proc. of the 4th International Conference on Parallel Processing and Applied Mathematics (PPAM 2001), 9–12 September, 2001, Nalęczów, Poland. Lecture Notes in Computer Science2328: 236–244.
- Wodecki, M. 2009. A block approach to earliness-tardiness scheduling problems, International Journal on Advanced Manufacturing Technology 40: 797–807. http://dx.doi.org/10.1007/s00170-008-1395-7.
- Wolpert, D. H.; Macready, W. G. 1997. No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation 1(1): 67–82. http://dx.doi.org/10.1109/4235.585893.
- Zavadskas, E. K.; Turskis, Z.; Tamošaitiene, J. 2010. Risk assessment of construction project, Journal of Civil Engineering and Management 16(1): 33–46.