1. Marco teórico y desarrollo conceptual
1.8 Bibliografía
[1] F. Becerra R., Gestión de la producción: una aproximación conceptual. Manizales: Universidad Nacional de Colombia, 2008.
[2] J. A. Domínguez-Machuca, G. S. García, M. A. Domínguez-Machuca, J.A. Ruiz, and G. M. J. Alvarez, Dirección de Operaciones: Aspectos estratégicos en la
Producción y los servicios. Madrid: Editorial McGraw-Hill, 1995.
[3] T. Kis, and A. Kóvács, “A cutting plane approach for integrated planning and scheduling”, Computers & Operations Research, vol. 39, pp. 320-327, 2012.
[4] N. Gaither, and G. Frazier, Administración de Producción y Operaciones. México D.F.: Internacional Thomson Editores, 2000.
[5] R. B. Chase, N. J. Aquilano, and F. R. Jacobs, Administración de Producción y
Operaciones: Manufactura y servicios. Bogotá: Editorial McGraw-Hill, 2000.
[6] I. Harjunkoski, R. Nystrӧm, and A. Horch, “Integration of scheduling and control— Theory or practice?”, Computers and Chemical Engineering, vol. 33, pp. 1909-1918, 2009.
[7] R. Schroeder, Administración de Operaciones: Toma de decisiones en la función de
Operaciones, tercera edición. México D.F.: Editorial McGraw-Hill, 1993.
[8] M. L. Pinedo, Planning and Scheduling in Manufacturing and Services. New York: Springer Science + Business Media, LLC, 2005.
[9] R. K. Phanden, A. Jain, and R. Verma, “A genetic algorithm-based approach for job shop scheduling”, Journal of Manufacturing Technology Management, vol. 23, iss. 7, pp. 937-946, 2012.
[10] F. J. Hwang, M. Y. Kovalyov, and B. M. T. Lin, “Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence”, Discrete
Optimization, vol. 9, pp. 29-39, 2012.
[11] B. M. T. Lin, C. Y. Lu, S. J. Shyu, and C. Y. Tsai, “Development of new features of ant colony optimization for flowshop scheduling”, International Journal of Production
Economics, vol. 112, pp. 742-755, 2008.
[12] B. Naderi, R. Tavakkoli-Moghaddam, and M. Khalili, “Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan”, Knowledge-Based
Systems, vol. 23, pp. 77-85, 2010.
[13] H. Allaoui, and A. Artiba, “Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints”, Computers & Industrial
Engineering, vol. 47, pp. 431-450, 2004.
[14] R. F. Tavares, and M. Godinho, “Literature review regarding ant colony optimization applied to scheduling problems: Guidelines for implementation and directions for future research”, Engineering Applications of Artificial Intelligence, vol. 26, pp. 150- 161, 2013.
[15] O. D. Castrillón-Gómez, J. A. Giraldo-García, and W. A. Sarache-Castro, Técnicas
Inteligentes y estocásticas en scheduling. Un enfoque en la producción y las operaciones. Manizales: Universidad Nacional de Colombia, 2010.
[16] M. K. Starr, “Modular production – a 45-year-old concept”, International Journal of
Operations & Production Management, vol. 30, no. 1, pp. 7-19, 2010.
[17] S. Wilson, and K. Platts, “How do companies achieve mix flexibility?”, International
Journal of Operations & Production Management, vol. 30, no. 9, pp. 978-1003,
2010.
[18] J. Miltenburg, Estrategia de Manufactura. Portland: Ed. Productivity Press, 1995. [19] M. Hekmatfar, S. M. T. Fatemi-Ghomi, and B. Karimi, “Two stage reentrant hybrid
flow shop with setup times and the criterion of minimizing makespan”, Applied Soft
Computing, vol. 11, pp. 4530-4539, 2011.
[20] H. S. Mirsanei, M. Zandieh, M. J. Moayed, and M. R. Khabbazi, “A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence- dependent setup times”, Journal Intelligent Manufacturing, vol. 22, pp. 965-978, 2011.
[21] Q. Niu, T. Zhou, M. Fei, and B. Wang, “An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems”, Mathematics and
Computers in Simulation, In Press, Accepted Manuscript. Available online 7
September 2012.
[22] Q. K. Pan, and R. Ruiz, “An estimation of distribution algorithm for lot-streaming flow shop problems with setup times”, Omega, vol. 40, pp. 166-180, 2012.
[23] M. Akhshabi, J. Haddadnia, and M. Akhshabi, “Solving flow shop scheduling problem using a parallel genetic algorithm”, Procedia Technology, vol. 1, pp. 351- 355, 2012.
[24] D. Shabtay, “The just-in-time scheduling problem in a flow-shop scheduling system”, European Journal of Operational Research, vol. 216, pp. 521-532, 2012. [25] H. Hentous, and B. Merabti, “A branch and bound heuristic for the flow shop
problem”, in 2010 Fourth International Conference on Sensor Technologies and
Applications, pp. 352-356, 2010.
[26] F. S. Yao, M. Zhao, and H. Zhang, “Two-stage hybrid flow shop scheduling with dynamic job arrivals”, Computers & Operations Research, vol. 39, pp. 1701-1712, 2012.
[27] S. Wang, and M. Liu, “A heuristic method for two-stage hybrid flow shop with dedicated machines”, Computers & Operations Research, vol. 40, pp. 438-450, 2013.
[28] P. Qiao, and C. Sun, “Research on hybrid flow-shop scheduling problem based on improved immune particle swarm optimization”, in 2011 2nd International
Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), pp. 4240-4243, Aug. 2011.
[29] M. Gholami, M. Zandieh, and A. Alem-Tabriz, “Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns”,
International Journal of Advanced Manufacturing Technology, vol. 42, pp. 189-201,
2009.
[30] E. Cevikcan, M. B. Durmusoglu, and M. Baskak, “Integrating parts design characteristics and scheduling on parallel machines”, Expert Systems with
Applications, vol. 38, pp. 13232-13253, 2011.
[31] C. Gicquel, L. Hege, M. Minoux, and W. van Canneyt, “A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited- wait constraints”, Computers & Operations Research, vol. 39, pp. 629-636, 2012. [32] H. S. Choi, J. S. Kim, and D. H. Lee, “Real-time scheduling for reentrant hybrid flow
shops: A decision tree based mechanism and its application to a TFT-LCD line”,
Expert Systems with Applications, vol. 38, pp. 3514-3521, 2011.
[33] S. W. Lin, and K. C. Ying, “Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm”, Omega, vol. 41, pp. 383-389, 2013. [34] M. Zandieh, and N. Karimi, “An adaptive multi-population genetic algorithm to solve
the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times”, Journal Intelligent Manufacturing, vol. 22, no. 6, pp. 979-989, 2010.
[35] F. Jabbarizadeh, M. Zandieh, and D. Talebi, “Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints”, Computers
& Industrial Engineering, vol. 57, pp. 949-957, 2009.
[36] M. R. Amin-Naseri, and M. A. Beheshti-Nia, “Hybrid flow shop scheduling with parallel batching”, International Journal of Production Economics, vol. 117, pp. 185- 196, 2009.
[37] K. R. Baker and D. Altheimer, “Heuristic solution methods for the stochastic flow shop problem”, European Journal of Operational Research, vol. 216, pp. 172-177, 2012.
[38] Z. Han, H. Shi, F. Qiao, and L. Yue, “DE solution for the earliness/tardiness case of hybrid flow-shop scheduling problem with priority strategy”, in Proceedings of the
2011 International Conference on Modelling, Identification and Control, pp. 12-17,
Jun. 2011.
[39] C. S. Huang, Y. C. Huang, and P. J. Lai, “Modified genetic algorithms for solving fuzzy flow shop scheduling problems and their implementation with CUDA”, Expert
Systems with Applications, vol. 39, pp. 4999-5005, 2012.
[40] H. M. Cho, S. J. Bae, J. Kim, and I. J. Jeong, “Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm”, Computers & Industrial
Engineering, vol. 61, pp. 529-541, 2011.
[41] S. M. H. Hojjati, and A. Sahraeyan, “Minimizing makespan subject to budget limitation in hybrid flow shop”, in International Conference on Computers &
Industrial Engineering, 2009. CIE 2009, pp. 18-22, Jul. 2009.
[42] N. Yalaoui, H. Mahdi, L. Amodeo, and F. Yalaoui, “A particle swarm optimization under fuzzy logic controller to solve a scheduling problem”, in 2011 International
Conference on Communications, Computing and Control Applications (CCCA), pp.
1-6, Mar. 2011.
[43] J. Yang, “Minimizing total completion time in two-stage hybrid flow shop with dedicated machines”, Computers & Operations Research, vol. 38, pp. 1045-1053, 2011.
[44] V. Yaurima, L. Burtseva, and A. Tchernykh, “Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers”, Computers & Industrial Engineering, vol. 56, pp. 1452-1463, 2009.
[45] R. Schroeder, Administración de Operaciones: Casos y conceptos contemporáneos. México D.F.: Editorial McGraw-Hill, 2004.
[46] L. H. Sun, L. Y. Sun, M. Z. Wang, and J. B. Wang, “Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines”,
[47] C. F. M. Toledo, R. R. R. de Oliveira, and P. Morelato-Franҫa, “A hybrid multi- population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging”, Computers & Operations Research, vol. 40, pp. 910- 919, 2013.
[48] S. H. Choi, and K. Wang, “Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach”, Computers & Industrial Engineering, vol. 63, pp. 362-373, 2012.
[49] W. J. Chen, “Scheduling with dependent setups and maintenance in a textile company”, Computers & Industrial Engineering, vol. 57, pp. 867-873, 2009.
[50] E. Safari, and S. J. Sadjadi, “A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown”, Expert
Systems with Applications, vol. 38, pp. 2020-2029, 2011.
[51] D. Rebaine, “Scheduling flexible flowshops with unit-time operations and minimum time delays”, Electronic Notes in Discrete Mathematics, vol. 36, pp. 1193-1200, 2010.
[52] W. Yu, Z. Liu, L. Wang, and T. Fan, “Routing open shop and flow shop scheduling problems”, European Journal of Operational Research, vol. 213, pp. 24-36, 2011. [53] R. Driessel, and L. Mönch, “Variable neighborhood search approaches for
scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times”, Computers & Industrial Engineering, vol. 61, pp. 336-345, 2011.
[54] F. Ángel-Bello, A. Álvarez, J. Pacheco, and I. Martínez, “A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times”, Computers and Mathematics with Applications, vol. 61, pp. 797-808, 2011. [55] S. W. Lin, Z. J. Lee, K. C. Ying, and C. C. Lu, “Minimization of maximum lateness
on parallel machines with equence-dependent setup times and job release dates”,
Computers & Operations Research, vol. 38, pp. 809-815, 2011.
[56] H. M. Hsu, Y. Hsiung, Y. Z. Chen, and M. C. Wu, “A GA methodology for the scheduling of yarn-dyed textile production”, Expert Systems with Applications, vol. 36, pp. 12095-12103, 2009.
[57] T. C. E. Cheng, S. R. Cheng, W. H. Wu, P. H. Hsu, and C. C. Wu, “A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based
learning considerations”, Computers & Industrial Engineering, vol. 60, pp. 534-541, 2011.
[58] A. Liu, Y. Yin, and J. Jiang, “Flow shop scheduling problems with general learning effect under dominant machines”, in 2010 International Conference on Computing,
Control and Industrial Engineering, pp. 280-283, 2010.
[59] A. B. Hmida, M. Haouari, M. J. Huguet, and P. Lopez, “Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search”, Computers &
Industrial Engineering, vol. 60, pp. 320-327, 2011.
[60] E. Vallada, and R. Ruiz, “A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times”, European Journal of
Operational Research, vol. 211, pp. 612-622, 2011.
[61] C. Jing, W. Huang, and G. Tang, “Minimizing total completion time for re-entrant flow shop scheduling problems”, Theoretical Computer Science, vol. 412, pp. 6712- 6719, 2011.
[62] P. C. Chang, and S. H. Chen, “Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times”, Applied Soft
Computing, vol. 11, pp. 1263-1274, 2011.
[63] C. Zhao, and H. Tang, “Two-machine flow shop scheduling with deteriorating jobs and chain precedence constraints”, International Journal of Production Economics, vol. 136, pp. 131-136, 2012.
[64] R. Tavakkoli-Moghaddam, F. Taheri, M. Bazzazi, M. Izadi, and F. Sassani, “Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints”, Computers &
Operations Research, vol. 36, pp. 3224-3230, 2009.
[65] S. Carpov, J. Carlier, D. Nace, and R. Sirdey, “Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage”, Computers &
Operations Research, vol. 39, pp. 736-745, 2012.
[66] A. Kasperski, A. Kurpisz, and P. Zielinski, “Approximating a two-machine flow shop scheduling under discrete scenario uncertainty”, European Journal of Operational
Research, vol. 217, pp. 36-43, 2012.
[67] X. Zhang, and S. van de Velde, “Approximation algorithms for the parallel flow shop problem”, European Journal of Operational Research, vol. 216, pp. 544-552, 2012.
[68] R. A. Gallego, A. H. Escobar, and R. A. Romero, Técnicas de Optimización
Combinatorial. Pereira: Universidad Tecnológica de Pereira, 2006.
[69] F. Yue-wen, Z. Feng-xing, X. Xiao-hong, C. Qing-zhu, and W. Jia-hua, “Hybrid flow- shop scheduling method based on multi-agent particle swarm optimization”, in
Proceeding of the IEEE International Conference on Information and Automation,
pp. 755-759, Jun. 2011.
[70] S. Zhang, “Large-scale flow shop scheduling based on genetic algorithm”, in 2010
2nd International Conference on Education Technology and Computer (ICETC), vol.
1, pp. 308-310, Jun. 2010.
[71] I. Mahdavi, Gh. M. Komaki, and V. Kayvanfar, “Aggregate hybrid flowshop scheduling with assembly operations”, in 2011 IEEE 18th International Conference
on Industrial Engineering and Engineering Management (IE&EM), pp. 663-667,
2011.
[72] D. W. Kim, K. H. Kim, W. Jang, and. F. F. Chen, “Unrelated parallel machine scheduling with setup times using simulated annealing”, Robotics and Computer
Integrated Manufacturing, vol. 18, pp. 223-231, 2002.
[73] B. Liu, L. Wang, Y. Liu, B. Qian, and Y. H. Jin, “An effective hybrid particle swarm optimization for batch scheduling of polypropylene processes”, Computers and
Chemical Engineering, vol. 34, pp. 518-528, 2010.
[74] P. Damodaran, and M. C. Vélez-Gallego, “A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times”, Expert Systems with Applications, vol. 39, pp. 1451-1458, 2012.
[75] I. Sariҫiҫek, and C. Ҫelik, “Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness”, Applied Mathematical Modelling, vol. 35, pp. 4117-4126, 2011.
[76] S. W. Choi, and Y. D. Kim, “Minimizing total tardiness on a two-machine re-entrant flowshop”, European Journal of Operational Research, vol. 199, pp. 375-384, 2009. [77] W. C. Lee, J. B. Lin, and Y. R. Shiau, “Deteriorating job scheduling to minimize the
number of late jobs with setup times”, Computers & Industrial Engineering, vol. 61, pp. 782-787, 2011.
[78] F. Jin, J. N. D. Gupta, S. Song, and C. Wu, “Single machine scheduling with sequence-dependent family setups to minimize maximum lateness”, Journal of the
[79] S. Khalouli, F. Ghedjati, and A. Hamzaoui, “A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop”, Engineering Applications of Artificial
Intelligence, vol. 23, pp. 765-771, 2010.
[80] C. W. Leung, T. N. Wong, K. L. Mak, and R. Y. K. Fung, “Integrated process planning and scheduling by an agent-based ant colony optimization”, Computers &
Industrial Engineering, vol. 59, pp. 166-180, 2010.
[81] C. Blum, “Ant colony optimization: Introduction and recent trends”, Physics of Life
Reviews, vol. 2, pp. 353-373, 2005.
[82] P. Gómez-Gasquet, “Un nuevo algoritmo genético basado en un sistema multiagente para la programación de la producción en un taller de flujo híbrido”, in
International Conference on Industrial Engineering & Industrial Management - CIO 2007, pp. 1675-1685, Sep. 2007.
[83] I. Mahdavi, M. S. Mojarad, B. Javadi, and A. Tajdin, “A genetic approach for solving a hybrid flow shop scheduling problem”, in IEEE International Conference on
Industrial Engineering and Engineering Management, 2008. IEEM 2008, pp. 1214-
1218, Dec. 2008.
[84] F. S. Serifoglu, and G. Ulusoy, “Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach”, Journal of the Operational Research
Society, vol. 55, pp. 504-512, 2004.
[85] H. Feng, S. Lu, and X. Li, “Genetic algorithm for hybrid flow-shop scheduling with parrel batch processors”, in WASE International Conference on Information
Engineering, 2009. ICIE '09, vol. 2, pp. 9-13, Jul. 2009.
[86] S. Bertel, and J. C. Billaut, “A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation”, European Journal of Operational
Research, vol. 159, pp. 651-662, 2004.
[87] J. C. Chen, C. C. Wu, C. W. Chen, and K. H. Chen, “Flexible job shop scheduling with parallel machines using genetic algorithm and grouping genetic algorithm”,
Expert Systems with Applications, vol. 39, pp. 10016-10021, 2012.
[88] J. Tang, G. Zhang, B. Lin, and B. Zhang, “Hybrid genetic algorithm for flow shop scheduling problem”, in 2010 International Conference on Intelligent Computation
[89] C. W. Chiou, W. M. Chen, C. M. Liu, and M. C. Wu, “A genetic algorithm for scheduling dual flow shops”, Expert Systems with Applications, vol. 39, pp. 1306- 1314, 2012.
[90] O. Engin, G. Ceran, and M. K. Yilmaz, “An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems”, Applied Soft Computing, vol. 11, pp. 3056-3065, 2011.
[91] E. M. Toro, M. Granada, and R. Romero, “Algoritmo memético aplicado a la solución del problema de asignación generalizada”, Revista Tecnura, vol. 8, no. 16, pp. 55-63, 2005.
[92] M. Solari, and E. Ocampo, “Aplicación de algoritmos genéticos en un sistema multiagente de planificación en una industria manufacturera”, in XXXII Conferencia
Latinoamericana de Informática (CLEI 2006), Ago. 2006.
[93] T. Uhlig, and O. Rose, “Solving scheduling problems with sequence-dependent process times by evolutionary algorithms”, in Proceedings of the 2010 Industrial
Engineering Research Conference, Jun. 2010.
[94] Y. Zhan, and C. Qiu, “Genetic algorithm application to the hybrid flow shop scheduling problem”, in Proceedings of the IEEE International Conference on
Mechatronics and Automation, 2008. ICMA 2008, pp. 649-653, Aug. 2008.
[95] Z. Su, and T. Li, “Genetic algorithm for minimizing the makespan in hybrid flow shop scheduling problem”, in International Conference on Management and Service
Science, 2009. MASS '09, pp. 1-4, Sep. 2009.
[96] P. Gómez-Gasquet, C. Andrés, and F. C. Lario, “An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan”,
Expert Systems with Applications, vol. 39, pp. 8095-8107, 2012.
[97] R. Rajkumar, and P. Shahabudeen, “Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs”,
International Journal of Computer Integrated Manufacturing, vol. 22, no. 10, pp.
987-998, 2009.
[98] R. Ruiz, and C. Maroto, “A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility”, European Journal of Operational
Research, vol. 169, pp. 781-800, 2006.
[99] M. Gendreau, and J. Y. Potvin, Handbook of Metaheuristics. Second Edition. New York: Springer Science+Business Media, LLC, 2010.
[100] P. Gómez-Gasquet, “Programación de la producción en un taller de flujo híbrido sujeto a incertidumbre: arquitectura y algoritmos. Aplicación a la industria cerámica”. Ph.D. Thesis, Universidad Politécnica de Valencia, España, 2010.
[101] P. J. Shiroma, and G. Niemeyer, “Production scheduling in the textile industry: a practical approach using evolutionary algorithms with domain-dependent information”, in Proceedings of the 24th Annual Conference of the IEEE Industrial
Electronics Society, 1998. IECON '98, vol. 1, pp. 269-273, 1998.
[102] G. C. Onwubolu, and M. Mutingi, “Genetic algorithm for minimizing tardiness in flow- shop scheduling”, Production Planning & Control, vol. 10, no. 5, pp. 462-471, 1999. [103] W. Xiao, P. Hao, S. Zhang, and X. Xu, “Hybrid flow shop scheduling using genetic
algorithms”, in Proceedings of the 3rd World Congress on Intelligent Control and
Automation, vol. 1, pp. 537-541, Jun. 2000.
[104] K. Mesghouni, and B. Rabenasolo, “Multi-period predictive production scheduling with uncertain demands”, in 2002 IEEE International Conference on Systems, Man
and Cybernetics, vol. 6, Oct. 2002.
[105] P. C. Chang, J. C. Hsieh, and Y. W. Wang, “Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times”,
Applied Soft Computing, vol. 3, pp. 139-148, 2003.
[106] G. Deng, and X. Gu, “A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion”, Computers &
Operations Research, vol. 39, pp. 2152-2160, 2012.
[107] K. Kianfar, S. M. T. Fatemi-Ghomi, and A. O. Jadid, “Study of stochastic sequence- dependent flexible flow shop via developing a dispatching rule and a hybrid GA”,
Engineering Applications of Artificial Intelligence, vol. 25, pp. 494-506, 2012.
[108] V. Botta-Genoulaz, “Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness”, International Journal of Production
Economics, vol. 64, pp. 101-111, 2000.
[109] T. C. E. Cheng, C. J. Hsu, Y. C. Huang, and W. C. Lee, “Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness”,
[110] H. S. Choi, and D. H. Lee, “Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops”, Computers & Insdustrial Engineering, vol. 56, pp. 113-120, 2009.