masterThesis
Aplicación de la meta-heurística colonia de hormigas para la resolución de problemas multi-objetivo de programación de la producción en Flowshops híbridos (flexibles)
Fecha
2012-04-08Registro en:
Alfieria A. Workload simulation and optimisation in multi-criteria hybrid flowshop
scheduling: a case study International Journal of Production Research. Vol. 47, No. 18, 15
September 2009, 5129–5145.
Allaoui Hami, Lamouri Samir, Lebbar Maria. A robustlness framework for a stochastic
hybrid flow shop to minimize the makespan. 2006. IEEE.
Allaoui Hami, Artiba Abdelhakim. Scheduling two-stage hybrid flow shop with availability
constraints. Computers & Operations Research 33 (2006) 1399–1419
Allaoui Hami, Artiba A. Integrating simulation and optimization to schedule a hybrid flow
shop with maintenance constraints. Computers & Industrial Engineering 47 (2004) 431–
450. Science Direct.
Amin-Naseri Mohammad Reza, Beheshti-Nia Mohammad Ali. Hybrid flow shop
scheduling with parallel batching. International Journal of Production Economics 117
(2009) 185–196. Science Direct.
Barichard V., Ehrgott M., Gandibleux X., T'Kindt V . Multiobjective Programming and
Goal Programming. Theoretical Results and Practical Applications.Springer. 2009
Bagchi, T. (1999). Multiobjective scheduling by genetic algorithms. Kluwer Academic
Publishers.
Brah, S. A., & Hunsucker, J. L. (1991). Branch and bound algorithm for the flowshop with
multiple processors. European Journal of Operation Research, 51, 88–99.
Behnamian J., Ghomi Fatemi, M. Zandieh. A multi-phase covering Pareto-optimal front
method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid
metaheuristic. Expert Systems with Applications. Science Direct.
Behnamian J., Ghomi Fatemi, M. Zandieh. Hybrid flowshop scheduling with machine and
resource-dependent processing times. Applied Mathematical Modelling. Science Direct 17
pags.
Blum, C., Sampels, M., 2002. Ant colony optimization for FOP shop scheduling:a case
study on different pheromone representations. Proceedings of the 2002 Congress on
Evolutionary Computation (CEC’02), vol.2. IEEE Computer Society Press, Los Alamitos,
pp.1558–1563.
Botta-Genoulaz Valérie. Hybrid Flow shop scheduling with precedence constraints and
time lags to minimize maximum lateness. International Journal of Production Economics
64 (2000) 101-111. Science Direct
Botta-Genoulaz Valérie. Considering Bills of material in Hybrid Flow shop Scheduling
Problems. Proceedings of the 1997 IEEE International Symposium on Assembly and Task
Planning Marina del Rey, CA - August 1997.
Caricato P., Grieco A., Serino D. Tsp-based scheduling in a batch-wise hybrid flow-shop.
Robotics and Computer-Integrated Manufacturing 23 (2007) 234–241. Science Direct.
Caricato Pierpaolo, Grieco Antonio, Nucci Francesco. Simulation and mathematical
programming for a multi-objective configuration problem in a Hybrid Flow Shop.
Proceedings of the 2008 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch,
O. Rose, T. Jefferson, J. W. Fowler eds.
Chang Junlin, Yan Weiwu. Shao Huihe. Scheduling a two-stage no-wait hybrid flowshop
with separated setup and removal times. Proceeding of the 2004 American Control
Conference Boston, Massachusetts June 30. July 2, 2004.
Chang Junlin, Ma Guangfu, Ma Xiaoping. A New Heuristic for Minimal Makespan in NoWait
Hybrid Flowshops. Proceedings of the 25th Chinese Control Conference. 7-11
August, 2006, Harbin, Heilongjiang.
Chen, B. (1995). Analysis of classes of heuristics for scheduling a two-stage flowshop with
parallel machines at one stage. Journal of the Operational Research Society, 46, 234–244.
Chen, B. (1994). Scheduling multiprocessor flowshops. In Advances in optimization and
approximation. Dordrecht: Kluwer.
Choi, S.-W., Y.-D. Kim, and G.-C. Lee. 2005. Minimizing total tardiness of orders with
reentrant lots in a hybrid flow shops. International Journal of Production Research 43:2149-
2167
Choi Hyun-Seon, Lee Dong-Ho Scheduling algorithms to minimize the number of tardy
jobs in two-stage hybrid flow shops. Computers & Industrial Engineering 56 (2009) 113–
120. Science Direct.
Choi Hyun-Seon, Kim Ji-Su, Lee Dong-Ho. 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. 2010. Science Direct.
Coello-Coello, C.A., Lamont G. B., & Van-Veldhuizen D. A. Evolutionary Algorithms for
Solving Multi-Objective Problems. Second Edition. Springer. 2007.
Davis, Lawrence (Editor). "Handbook of Genetic Algorithms", Van-Nostrand Reinhold,
1991. 385 p.
Dauzère-Pérès, S., 1994. A connected neighborhood structure for the multiprocessor jobshop
scheduling problem. Management Report Series, vol. 180. Erasmus University
Rotterdam, Rotterdam School of Management, Rotterdam.
Dauzère-Pérès, S., Paulli, J., 1994. Solving the general job-shop scheduling problem.
Management Report Series, vol. 182. Erasmus University Rotterdam, Rotterdam School of
Management, Rotterdam
Dauzère-Pérès, S., Paulli, J., 1997. An integrated approach for modelling and solving the
general multiprocessor job-shop scheduling problem using tabu search. Annals of
Operations Research 70, 281-306.
Dessouky, M., Dessouky, M., & Verma, S. (1998). Flowshop scheduling with identical jobs
and uniform parallel machines. European Journal of Operational Research, 109, 620–631.
Díaz Adenso. Optimización Heurística y Redes Neuronales. Editorial Paraninfo. 1996.
Dugardin Frédéric, Yalaoui Farouk, Amodeo Lionel. New multi-objective method to solve
reentrant hybrid flow shop scheduling problem. European Journal of Operational Research
203 (2010) 22–31. Science Direct.
Dauzère-Pérès, S., 1994. A connected neighborhood structure for the multiprocessor jobshop scheduling problem. Management Report Series, vol. 180. Erasmus University
Rotterdam, Rotterdam School of Management, Rotterdam.
Dauzère-Pérès, S., Paulli, J., 1994. Solving the general job-shop scheduling problem.
Management Report Series, vol. 182. Erasmus University Rotterdam, Rotterdam School of
Management, Rotterdam
Dauzère-Pérès, S., Paulli, J., 1997. An integrated approach for modelling and solving the
general multiprocessor job-shop scheduling problem using tabu search. Annals of
Operations Research 70, 281-306.
De la cruz, Jair J. and Carlos D. Paternina-Arboleda. An Ant Colony System approach for
heterogeneous vehicle routing problems with time windows and multiple products. III
Colombian congress and 1st international Andean conference on Operational Research.
Cartagena, Colombia, 2004.
De la cruz, Jair J., Adriana Mendoza, Astrid Del Castillo y Carlos D. Paternina-Arboleda.
Análisis comparativo de las aproximaciones heurísticas Ant-Q, recocido simulado y
búsqueda tabu en la solución del problema del agente viajero. Revista Ingeniería &
Desarrollo, (14) Universidad del Norte, 2004.
Dessouky, M., Dessouky, M., & Verma, S. (1998). Flowshop scheduling with identical jobs
and uniform parallel machines. European Journal of Operational Research, 109, 620–631.
Dorigo, M. Optimization, learning and natural algorithms [in Italian]. PhD thesis,
Dipartimento di Elettronica, Politecnico di Milano, Milan, 1992.
Dorigo, M. & Gambardella, L. M.. Ant colonies for the travelling salesman problem.
BioSystems, 43(2):73–81, 1997.
Dorigo, M., Maniezzo, V., & Colorni, A. Positive feedback as a search strategy. Technical
report 91-016, Dipartimento di Elettronica, Politecnico di Milano, Milan, 1991a.
Dorigo, M., Maniezzo, V., & Colorni, A. The ant system: An autocatalytic optimizing
process. Technical report 91-016 revised, Dipartimento di Elettronica, Politecnico di
Milano, Milan, 1991b
Dorigo, M., Maniezzo, V., & Colorni, A. Ant system: Optimization by a colony of
cooperating agents. IEEE Transactions on Systems, Man. and Cybernetics–Part B,
26(1):29–41, 1996
Dorigo, M., & Stützle, T. Ant Colony Optimization. Asco Typesetters, Hong Kong, 2004.
Dugardin Frédéric, Yalaoui Farouk, Amodeo Lionel. Multiobjective scheduling of a
reentrant hybrid flowshop.
Feng Haodi, Lu Shenpeng, Li Xiuqian. Genetic Algorithm for Hybrid Flow-shop
Scheduling with Parrel Batch Processors. 2009 WASE International Conference on
Information Engineering.
Gao Cong, Tang Lixin. Scheduling Hybrid Flow Shop for Minimizing Total Weight
Completion Time. Proceedings of the IEEE International Conference on Automation and
Logistics August 18 - 21, 2007, Jinan, China.
Gholami M., Zandieh M., Alem-Tabriz A. Scheduling hybrid flow shop with sequencedependent setup times and machines with random breakdowns. Springer-Verlag London
Limited 2008.
Grangeon Nathalie, Tanguy Alain, Tchernev Nikolay. Generic Simulation Model for
Hybrid Flow-Shop. Computers & Industrial Engineering 37 (1999) 207-210.
Guinet A., & Solomon M. M. (1996). Scheduling hybrid Flowshops to minimize maximum
tardiness or maximum completion-times.
Gupta, J. (1988). Two stage hybrid flowshop scheduling problem. Journal of the Operations
Research Society, 38, 359–364.
Gupta J., & Tunc E. A. (1994). Scheduling a 2-stage hybrid Flowshop with separable setup
and removal times.
Gupta Jatinder N.D., Krüger Karin, Lauff Volker, Werner Frank, Sotskov Yuri N.
Heuristics for hybrid flow shops with controllable processing times and assignable due
dates. Computers & Operations Research 29 (2002) 1417-1439. Science Direct.
Haouari, M., & M’Hallah, R. (1997). Heuristic algorithms for the two-stage hybrid
flowshop problem. Operations Research Letters, 21, 43–53.
Hentous H., Benhammadi F. Heuristics Resolution of a Constrained Hybrid Flow Shop
Problem. 2006. IEEE.
Hmida Abir Ben, Huguet Marie-Jose, Lopez Pierre, Haouari Mohamed. Adaptation of
Discrepancy-based Methods for Solving Hybrid Flow Shop Problems. 2006. IEEE.
Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operational Research,
167, 592–623.
Hossein-Hojjati Seyed Mohammad, Sahraeyan Amin. Minimizing Makespan Subject to
Budget Limitation in Hybrid Flow Shop. 2009. IEEE.
Hu Yanhai. Ma Dengzhe. Ye Feifan. Scheduling Hybrid Flow Shop Containing MultiFunctional Machines. 2006. IEEE.
Huang Rong-Hwa & Yang Chang-Lin. Ant colony system for job shop scheduling with
time Windows. International Journal Advanced Manufacturing Technology. 39:151–157
DOI 10.1007/s00170-007-1203-9. Springer-Verlag London Limited 2007.
Janiak Adam, Kozan Erhan, Lichtenstein Maciej, Oguz Ceyda. Metaheuristic approaches to
the hybrid flow shop scheduling problem with a cost-related criterion. International Journal
of Production Economics 105 (2007) 407–424. Science Direct
Johnson, D. S., Aragon, C. R., McGeoch, Lyle A., Schevon, C. Optimization by Simulated
Annealing: An Experimental Evaluation. Operations Research; Nov/Dec 1989; 37, 6;
ABI/INFORM Global pag. 865.
Jiang Shujun, Tang Lixin. Lagrangian Relaxation algorithms for re-entrant hybrid flowshop
scheduling. 2008 International Conference on Information Management, Innovation
Management and Industrial Engineering. IEEE.
Jing Xiao, Li Zheng. A MILP-based batch scheduling for two-stage hybrid flowshop with
sequence-dependent setups in semiconductor assembly and test Manufacturing. 6th annual
IEEE Conference on Automation Science and Engineering. Marriott Eaton Centre Hotel.
Toronto, Ontario, Canada, August 21-24, 2010.
Jouglet Antoine, Oguz Ceyda, Sevaux Marc. Hybrid Flow-Shop: a Memetic Algorithm
Using Constraint-Based Scheduling for Efficient Search. Springer Science + Business
Media B.V. 2009.
Jungwattanakit Jitti, Reodecha Manop, Chaovalitwongse Paveena, Werner Frank.
Algorithms for flexible flow shop problems with unrelated parallel machines, setup times,
and dual criteria. 13 pags.
Jungwattanakit Jitti, Reodecha Manop, Chaovalitwongse Paveena, Werner Frank.
Sequencing algorithms for flexible flow shop problems with unrelated parallel machines,
setup times, and dual criteria. 23 pags.
Jungwattanakit Jitti, Reodecha Manop, Chaovalitwongse Paveena, Werner Frank. An
Evaluation of Sequencing Heuristics for Flexible Flowshop Scheduling Problems with
Unrelated Parallel Machines and Dual Criteria. 23 pags.
Jungwattanakit Jitti, Reodecha Manop, Chaovalitwongse Paveena, Werner Frank. A
comparison of scheduling algorithms for flexible flow shop problems with unrelated
parallel machines, setup times, and dual criteria. Computers & Operations Research 36
(2009) 358 – 378. Science Direct.
Kahramana Cengiz, Engin Orhan, Kaya I˙hsan, Öztürk R. Elif. Multiprocessor task
scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach. Applied
Soft Computing 10 (2010) 1293–1300. Science Direct
Karimi N., Zandieh M., Karamooz H.R. Bi-objective group scheduling in hybrid flexible
flowshop: A multi-phase approach. Expert Systems with Applications 37 (2010) 4024–
4032. Science Direct
Khalouli Safa, Ghedjati Fatima, Hamzaoui Abdelaziz. A meta-heuristic approach to solve a
JIT scheduling problem in hybrid flow shop Engineering Applications of Artificial
Intelligence. Science Direct.
Khalouli Safa, Ghedjati Fatima, Hamzaoui Abdelaziz. An integrated ant colony
optimization algorithm for the hybrid flow shop scheduling problema. 2009. IEEE.
Khalouli Safa, Ghedjati Fatima, Hamzaoui Abdelaziz. Ant Colony Optimization for
Solving a Bi-Criteria Hybrid Flow Shop Problem. 2008. IEEE.
Kirkpatrick, S., Gelatt, C.D., Vecchi P.M. Optimization by Simulated Annealing. Science,
220, 671-680. 1983.
Kulcsár Gyula, Erdélyi Ferenc and Hormyák Olivér. Multi-Objective Optimization and
Heuristic Approaches for solving scheduling problems. University of Miskolc, Department
of Information Engineering. Egyetem Road, Miskolc-Egyetemváros 3515, Hungary.
Kyparisis George J., Koulamas Christos. Flexible flow shop scheduling with uniform
parallel machines. European Journal of Operational Research 168 (2006) 985–997. Science
Direct.
Lee C. Y., & Vairaktarakis G. L. (1994). Minimizing makespan in hybrid Flowshops.
Lei, D. and Wu, Z., 2006, Crowding-measure-based multiobjective evolutionary algorithm
for job shop scheduling. The International Journal of Advanced Manufacturing
Technology, 30 (1-2), 112-117
Li Tieke, Li Yan. Constructive Backtracking Heuristic for Hybrid Flowshop Scheduling
with Limited Waiting Times. 2007. IEEE.
Li Tieke, Xiao Yongjun, Wang Haifeng Dynamic Constraint Satisfaction Approach to
Hybrid Flowshop Rescheduling. Proceedings of the IEEE International Conference on
Automation and Logistics August 18 - 21, 2007, Jinan, China.
Lin Hung-Tso, Liao Ching-Jong. A case study in a two-stage hybrid flow shop with setup
time and dedicated machines. Int. J. Production Economics 86 (2003) 133–143. Science
Direct.
Li Lin, Wang Lele, Huo Jiazhen. Hybrid flowshop scheduling with setup times for cold
treating process in Baoshan Iron & Steel Complex. 2010. IEEE.
Linn, R., & Zhang, W. (1999). Hybrid flowshop scheduling: A survey. Computers and
Industrial Engineering, 37, 57–61.
Ling-li Zeng, Feng-xing Zou, Zheng Gao, Xiao-hong Xu. Dynamic Scheduling of Multitask for Hybrid Flow-shop Based on Idle Time Windows. 2009 IEEE.
Ling-li Zeng, Feng-xing Zou, Zheng Gao, Xiao-hong Xu. Dynamic Scheduling of Multitask for Hybrid Flow-shop Based on Energy Consumption. Proceedings of the 2009 IEEE
International Conference on Information and Automation June 22-25, 2009, Zhuhai/Macau,
China.
Liu Feng, Zhang Xiang-ping, Zou Feng-xing, Zeng Ling-li. Immune Clonal Selection
Algorithm for Hybrid Flow-shop Scheduling Problem. 2009. IEEE
Liu Siyi, Cui Jianshuang, Li Yan. Heuristic-Tabu Algorithm for Hybrid Flowshop
Scheduling with Limited Waiting Time. 2008 International Symposium on Computational
Intelligence and Design.
Liu Xiang, Zou Fengxing, Zhang Xiangping. Mathematical Model and Genetic
Optimization for Hybrid Flow Shop Scheduling Problem Based on Energy Consumption.
2008. IEEE.
Logendran Rasaratnam, Carson Sara, Hanson Erik. Group schedulingin flexible flow shops.
International Journal of Production Economics 96 (2005) 143–155. Science Direct.
Logendran Rasaratnam, DeSzoeke Paula, Barnard Faith. Sequence-dependent group
scheduling problems in flexible flow shops. International Journal of Production Economics
102 (2006) 66–86. Science Direct.
Mahdavi I., Mojarad M. S., Javadi B., Tajdin A. A Genetic Approach for Solving a Hybrid
Flow Shop Scheduling Problem. 2008. IEEE.
Montoya-Torres, J. R., & Vargas-Nieto, F. (2008). Production scheduling in the apparel
industry using an evolutionary algorithm. Submitted.
Montoya-Torres, J. R. Modelos y Métodos de Programación de Operaciones. Editorial
Lulu. 2010.
Montoya-Torres, J.R., Vargas-Nieto, F. (in press). Solving a bi-criteria hybrid flowshop
scheduling problem occurring in apparel manufacturing. International Journal of
Information Systems and Supply Chain Managment
Montoya-Torres, J. R., Aponte A., & Rosas P. Applying GRASP to solve the multi-item
threeechelon uncapacitated facility location problem. Journal of the Operational Research
Society (2010), 1–10.
Moreno J. Marcos, Moreno Jose A. Heurísticas en Optimización. Dirección General de
Universidades. Gobierno de Canarias. 1999.
Moscato, P., Cotta C. Una introducción a los algoritmos meméticos. Inteligencia Artificial,
Revista Iberoamericana de Inteligencia Artificial. No.19 (2003), pp. 131-148.
Negenman, Ebbe G. Local search algorithms for the multiprocessor Flow shop scheduling
problem. European Journal of Operational Research 128 (2001) 147-158
Nowicki, E., Smutnicki, C., 1996b. A fast tabu search algorithm for the permutation Flowshop problem. European Journal of Operational Research 91, 160-175
Oguz Ceyda, Ercan M. Fikret. A Genetic Algorithm for Hybrid Flow-Shop Scheduling
With Multiprocessor Tasks. Journal of Scheduling 8: 323–351, 2005. Springer Science +
Business Media, Inc. Manufactured in the Netherlands.
Oguz Ceyda, Ercan M. Fikret, Cheng T.C. Edwin, Fung Y.F. Heuristic algorithms for
multiprocessor task scheduling in a two-stage hybrid flow-shop. European Journal of
Operational Research 149 (2003) 390–403. Science Direct.
Oguz Ceyda, Zinder Yakov, Do Van Ha, Janiak Adam, Lichtenstein Maciej. Hybrid flowshop scheduling problems with multiprocessor task systems. European Journal of
Operational Research 152 (2004) 115–131. Science Direct.
Orhan Engin, Alper Döyen. A new approach to solve hybrid flow shop scheduling
problems by artificial immune system. Future Generation Computer Systems 20 (2004)
1083–1095. Science Direct.
Osman, I.H. & Christofides N. Capacitated clustering problems by hybrid simulated
annealing and tabu search, International Transactions in Operational Research, 1, 317-
336.
Pacheco-Espejel, A. y Cruz-Estrada M. C. Metodología crítica de la investigación. CECSA.
2006.
Paternina-Arboleda, Carlos D. y Tapas K. Das. A Multi-Agent Reinforcement Learning
Approach to Obtaining Dynamic Control Policies for Stochastic Lot Scheduling Problem.
In press, Simulation Modelling Practice and Theory. 2005
Paternina-Arboleda, Carlos D., Montoya-Torres, J. R., Herrera-Hernández, M. C., &
Acero-Domínguez, M. (2008). Scheduling jobs on a k-stage flexible flowshop. Annals of
Operations Research, 164(1), 29–40
Pinedo, M. Scheduling: Theory, algorithms, and systems. Springer. 2008. Reeves, C.R.
Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific
Publications. 1993.
Reza Hejazi, S., S. Saghafian (2005) Flowshpo-scheduling problems with makespan
criterion: a review. International Journal of Production Research, 43(14), 2895-2929
Ribas Imma, Rainer Leisten, Framiñan Jose M. Review and classification of hybrid flow
shop scheduling problems from a production system and a solutions procedure perspective.
Computers & Operations Research 37 (2010) 1439–1454. Science Direct.
Ruíz Ruben, Vazquez-Rodriguez Jose Antonio. The hybrid flowshop schedulling problem.
European Journal of Operational Research 205 (2010) 1–18. Science Direct.
Santos, D. L., Hunsucker, J. L., & Deal, D. E. (1995). Global lower bounds for flowshops
with multiple processors. European Journal of Operational Research, 80, 112–120.
Shiau Der-Fang, Cheng Shu-Chen, Huang Yueh-Min. Proportionate flexible flow shop
scheduling via a hybrid constructive genetic algorithm. Expert Systems with Applications
34 (2008) 1133–1143. Science Direct.
Sipper, D. y Bulfin, R. Production, Planning, Control and Integration. Mc Graw Hill
(1997).
Solano-Charris, E. L. (2008). Tesis: Programación de Talleres de Producción Seriales
Híbridos (Flexibles) con múltiples objetivos mediante el uso de Metaheurísticas: Colonias
de Hormigas. Universidad del Norte, Barranquilla. Maestría en Ingeniería Industrial.
Solano-Charris, E. L., Montoya-Torres, J. M., & Paternina-Arboleda, C. D. (2009). Multicriteria Optimization Evolving Artificial Ants as a Computational Intelligence Technique.
Proceedings of the IEEE Conference on Computational Intelligence and Games. 2009.
Solano-Charris, E. L., Montoya-Torres, J. M., & Paternina-Arboleda, C. D. (2009). Ant
colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling
problem. Journal of Intelligent Manufacturing. (DOI: 10.1007/s10845-009-0370-y).
Su Zhixiong, Li Tieke. Genetic Algorithm for Minimizing the Makespan in Hybrid Flow
Shop Scheduling Problem. This work was supported by the National Natural Science
Foundation of China under Grant Nos. 70371057 and 70771008.
Tang Lixin, Liu Wenxin, Liu Jiyin. A neural network model and algorithm for the hybrid
flow shop scheduling problema in a dynamic environment. Journal of Intelligent
Manufacturing, 16, 361–370, 2005 Springer Science Business Media, Inc. Manufactured in
The Netherlands.
T’kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling: Theory, models and
algorithms. Berlin: Springer.
T’kindt, V., Gupta, J. N. D., & Billaut, J. C. (2003). Two-machine flowshop-scheduling
with a secondary criterion. Computers and Operations Research, 30, 505–526.
Tzung-Pei Hong, Pei-Ying Huang, Gwoboa Horng and Chan-Lon Wang. Three Algorithms
for Flexible Flow-shop Scheduling. American Journal of Applied Sciences 4 (11): 889-896,
2007. ISSN 1546-9239. 2007 Science Publications.
Uetake Toshifumi, Tsubone Hitoshi, Ohba Masaaki. A production scheduling system in a
hybrid flow shop. International. Journal of Production Economics 41 (1995) 395-398.
Urlings Thijs, Ruiz Rubén, Sivrikaya Funda. Genetic algorithms for complex hybrid
flexible flowline problems. March 7, 2007. 32 pags.
Urlings Thijs, Ruiz Rubén. Genetic algorithms with different representation schemes for
complex hybrid flexible flow line problems. Int. J. Metaheuristics, Vol. 1, No. 1, 2010.
Pags 30-54.
Urlings Thijs, Ruiz Rubén, Stutzle Thomas. Shifting representation search for hybrid
flexible flowline problems. European Journal of Operational Research 207 (2010) 1086–
1095. Science Direct.
Vob Stefan, Witt Andreas. Hybrid flow shop scheduling as a multi-mode multi-project
scheduling problem with batching requirements: A real-world application. Int. J.
Production Economics 105 (2007) 445–458. Science Direct.
Wang K. & Choi S.H.. A Decomposition-Based Algorithm for Flexible Flow Shop
Scheduling with Stochastic Processing Times. Proceedings of the World Congress on
Engineering and Computer Science 2009 Vol II. WCECS 2009, October 20-22, 2009, San
Francisco, USA
Widmer, M., Hertz A. A new heuristic method for the flow shop sequencing problem.
Eurpean Journal of Operational Research, 41, 186-193, 1989.
Xiao Wendong, Hao Peifeng, Zhang Sen, Xu Xinhe. Hybrid Flow Shop Scheduling Using
Genetic Algorithms. Proceedingso fthe 3rd World Congress on Intelligent Control and
Automation June 28-JuI. 2, 2000, Hefei, P.R. China.
Xiaofeng Li Hai Zhao. Greedy Algorithm Solution of Flexible Flow Shop Scheduling
Problem. IJCSNS International Journal of Computer Science and Network Security, VOL.9
No.11, November 2009.
Xie Xie, Tang Lixin. Analysis of a Heuristics for Scheduling Two-Stage Hybrid Flow
Shop. 2009 International Joint Conference on Computational Sciences and Optimization.
Yagmahan, Betul, Mutlu Yenisey, Mehmet. A multi-objective ant colony system algorithm
for flow shop scheduling problem. Expert Systems with Applications. 2010. Science Direct
Yang Jaehwan. Minimizing total completion time in two-stage hybrid flow shop with
dedicated machines. Computers & Operations Research. 2010. Science Direct.
Yalaoui Naim, Amodeo Lionel, Yalaoui Farouk, Mahdi Halim. Particle Swarm
Optimization under Fuzzy Logic Controller for solving a Hybrid Reentrant Flow Shop
problem. 2010. IEEE
Yaurima Víctor, Burtseva Larisa, Tchernykh Andrei. Hybrid flowshop with unrelated
machines, sequence-dependent setup time, availability constraints and limited buffers.
Computers & Industrial Engineering 56 (2009) 1452–1463. Science Direct
Yaurima Víctor, Burtseva Larisa, Tchernykh Andrei. Hybrid Flowshop with Unrelated
Machines, Sequence Dependent Setup Time and Availability Constraints: An Enhanced
Crossover Operator for a Genetic Algorithm. R. Wyrzykowski et al., (Eds.): PPAM 2007,
LNCS 4967, pp. 608–617, 2008. Springer-Verlag Berlin Heidelberg 2008.
Yokohama Masao. Hybrid Flow-shop scheduling with assembly operations. International
Journal of Production Economics 73 (2001) 103-116. Science Direct.
Yuan Kun, Sauer Nathalie, Sauvey Christophe. Application of EM algorithm to hybrid flow
shop scheduling problems with a special blocking. 2009. IEEE.
Zandieh M., Mozaffari E., Gholami M.. A robust genetic algorithm for scheduling realistic
hybrid flexible flow line problems. Springer Science+Business Media, LLC 2009.J Intell
Manuf. DOI 10.1007/s10845-009-0250-5
Zandieh M., S.M.T. Ghomi Fatemi, Husseini S.M. Moattar. An immune algorithm
approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied
Mathematics and Computation 180 (2006) 111–127. Science Direct
Zandieh, M. Dorri Behrouz, Khamseh A. R.. Robust metaheuristics for group scheduling
with sequence-dependent setup times in hybrid flexible flow shops. Springer-Verlag
London Limited 2008.
Zhihong Jing, Zan Yanga, Takahiro Ito. Metaheuristic algorithms for the multistage hybrid
flowshop scheduling problem. Int. J. Production Economics 100 (2006) 322–334. Science
Direct.
Zhan Yong, Qiu Changhua. Genetic Algorithm Application to the Hybrid Flow Shop
Scheduling Problem. Proceedings of 2008 IEEE International Conference on Mechatronics
and Automation.
Zhonghua Han, Haibo Shi, Chang Liu. Differential Evolution Algorithm for the
Earliness/Tardiness Hybrid Flow-shop Scheduling Problem. 2009 Third International
Symposium on Intelligent Information Technology Application
159399
TE05808
Autor
Solano Charris, Elyn Lizeth
Montoya Torres, Jairo Rafael
Institución
Resumen
Con el fin de mejorar los niveles de competitividad, las empresas de manufactura y de servicio están obligadas a la implementación constante de procedimientos formales que les permitan optimizar sus procesos. En ese sentido, en lo referente a las operaciones de manufactura, la logística de producción, y más específicamente la programación de operaciones, juega un papel importante en cuanto al uso eficiente de los recursos.
La programación de operaciones (scheduling, en inglés) es una rama de la optimización combinatoria que consiste en la asignación de recursos para la realización de un conjunto de actividades con el fin de optimizar uno o varios objetivos. Debido a la complejidad intrínseca en la mayoría de los problemas de programación de la producción, los cuales son del tipo NP-duro (esto es, el tiempo que requieren para resolver un caso particular de un problema crece en el peor de los casos de manera exponencial con respecto al tamaño del problema), los métodos exactos convencionales de resolución tales como: programación lineal, entera y mixta, entre otros, no son eficientes en términos del tiempo de cálculo para llegar a la solución óptima.
Por lo tanto, se hace necesario el uso de enfoques alternativos para resolver este tipo de problemas en un tiempo razonablemente corto para el tomador de decisiones, sobre todo aquellas que se toman diariamente. Dentro de estos enfoques se encuentran las metaheurísticas, que consisten en procedimientos formales desarrollados con el fin de superar esta dificultad que se presenta con los métodos tradicionales. Los procedimientos meta-heurísticos más comunes para la resolución de problemas combinatorios son: los algoritmos genéticos, la búsqueda tabú, la colonia de hormigas y el recocido simulado entre otros.