Mostrar el registro sencillo del ítem

Reprogramación de producción en cadenas de suministro colaborativas: Una revisión de la literatura

dc.contributor.authorAcevedo Chedid, Jaimespa
dc.contributor.authorSalas Navarro, Katherinne Paolaspa
dc.contributor.authorOspina Mateus, Holmanspa
dc.contributor.authorSantander Mercado, Alcidesspa
dc.date.accessioned2019-01-24T21:39:38Z
dc.date.available2019-01-24T21:39:38Z
dc.date.issued2017-02-21
dc.identifier.issn07981015spa
dc.identifier.urihttp://hdl.handle.net/11323/2213spa
dc.description.abstractEn este trabajo se pretende hacer una revisión de la literatura sobre reprogramación de la producción en cadenas de suministro colaborativas, a través de una investigación exhaustiva y análisis Cienciométrico para identificar el comportamiento de las publicaciones en los últimos años, que permita identificar los autores, áreas de conocimiento, países e instituciones más desatacados en el área. Finalmente, se presentan líneas de investigación con mayor tendencia para desarrollar nuevas investigaciones que contribuyan a la literatura y o mejorar las existentes.spa
dc.description.abstractThis paper aims to review the literature on the reprogramming of production in collaborative supply chains, through a thorough investigation and Scientometric analysis to identify the behavior of publications in recent years, which allow the identification of authors, areas Of the knowledge, countries and institutions most unrelated in the area. Finally, research lines are presented with a greater tendency for new research that contributes to the literature and the improvement of stocks.eng
dc.language.isospa
dc.publisherEspaciosspa
dc.rightsAtribución – No comercial – Compartir igualspa
dc.subjectCollaborative supply chainspa
dc.subjectMetaheuristicspa
dc.subjectProduction reschedulingspa
dc.titleReprogramación de producción en cadenas de suministro colaborativas: Una revisión de la literaturaspa
dc.typeArtículo de revistaspa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.identifier.instnameCorporación Universidad de la Costaspa
dc.identifier.reponameREDICUC - Repositorio CUCspa
dc.identifier.repourlhttps://repositorio.cuc.edu.co/spa
dc.relation.referencesAdhitya, A., Srinivasan, R., Karimi, I.A. (2004). A heuristic reactive scheduling strategy for recovering from refinery supply chain disruptions, Laboratory for Intelligent Applications in Chemical Engineering Department of Chemical and Biomolecular Engineering, National University of Singapore. Agarwal, R., Ergun, O., Orlin, J., Potts, C. (2004). Solving Parallel Machine Scheduling Problems with Variable Depth Local Search, ÄOzlem Ergun, oergun@isye.gatech.edu, 404-894-2369. Aggoune, R. (2004). Minimizing the makespan for the flow shop scheduling problem with availability constraints, European Journal of Operational Research, Vol. 153, pp. 534-543. Agnetis, A., Detti, P., Meloni, C., Pacciarelli, D. (2001). Set-up coordination between two stages of a supply chain. Annals of Operations Research, Vol. 107(1-4), pp. 15-32. Akrami, B., Karimi, B., Moattar-Hosseini, S.M. (2006). Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case. Applied Mathematics and Computation, Vol. 183, pp. 634-45. Anand, Mendelson, H. (1997). Information and Organization for Horizontal Multimarket Coordination. Management Science. Vol. 43(12), pp. 1609-1627. Anghinolfi, D., Paolucci, M. (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, Computers & Operations Research, Vol. 34, pp. 3471-3490. Anis Allouche, M. (2010). Manager’s Preferences Modeling Within Multi-Criteria Flowshop Scheduling Problem: A Metaheuristic Approach. Unité de Recherche en Gestion Industrielle et Aide à la Décision, Faculté des Sciences Economiques et de Gestion, Université de Sfax, Sfax. Tunisia. Armentano, V.A., Arroyo, J.E.C. (2004). An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem. Journal of Heuristics, Vol. 10: pp. 463-481. Arshinder, Kanda,A., Deshmukh, S. G. (2008). Supply chain coordination: Perspectives, empirical studies andre search directions. International Journal of Production Economics, Vol. 115, pp. 316-335. Battaia, O., Dolgui, A. (2013). A taxonomy of line balancing problems and their solution approaches. International Journal of Production Economics. Vol. 142 (2), pp. 259-277. Behnamian, J., Ghomi, F. (2010). Parallel Machines Scheduling with Dual Criteria and Sequencedependent Setups: Cooperative Metaheuristics, Proceedings of the 2010 IEEE IEEM. Ben-Daya, M., Al-Fawzan, M. (1998). A tabusearch approach for the flow shop scheduling problem. European Journal of Operational Research, Vol. 109, pp. 88-95. Berning, G., Brandenburg, M., Gürsoy, K., Kussi, J.S., Mehta, V., Tölle, F. (2004). Integrating collaborative planning and supply chain optimization for the chemical process industry (I) - methodology. Computers and Chemical Engineering, Vol. 28 (6–7), pp. 913-927. Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C., (2002). A GRASP for Job Shop Scheduling. In: Essays and Surveys in Metaheuristics, Ribeiro, Celso C., Hansen, Pierre (Eds.), Kluwer Academic Publishers. Blazewicz, J., Pesch, E., Sterna, M., Werner, F. (2005). Metaheuristic Approaches for the TwoMachine Flow-Shop Problem with Weighted Late Work Criterion and Common Due Date. Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, Vol. 41, pp. 157-183. Britto, R., Delgadillo, G., Caballero, J. (2007). Production Programming in Manufacturing Systems (Workshop Type) with a Combined Mobile Bottleneck and Taboo Search Algorithm, Ing. Univ. Bogotá (Colombia), Vol. 11 (2), pp. 203-224. Cai, B., Wang, S., Hu, H. (2011). An Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem, World Academy of Science, Engineering and Technology, Vol. 58. Chambers, J.B., Barnes, J.W. (1996). Flexible job shop scheduling by tabu search .graduate program in operations research and industrial engineering. The University of Texas at Austin, technical report series ORP96-09. Chambers, J.B., Barnes, J.W. (1996). Reactive search for flexible job shop scheduling. graduate program in operations research and industrial engineering. The University of Texas at Austin, technical report series ORP98-100. Chan, F.T.S., Chung, S.H., Chan, P.L.Y. (2005). An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Systems with Applications, Vol. 29 (2), pp. 364-371. Chang, Y., Lee, C. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, Vol. 158 (2), pp. 470-487. Chen, F. (1999). Decentralized Supply Chains subject to Information Delays, Management Science, Vol. 45(8), pp. 1076-1090. Chen, J.M., Chen, T.H. (2005). The Multi-item Replenishment Problem in a Two-Echelon Supply Chain: The Effect of Centralization versus Decentralization. Computers & Operations Research, Vol. 32, pp. 3191-3207. Chen, P. (2000). Integrating production and transportation scheduling in a make-to-order environment. Ph.D. thesis, University of Cornell. Chen, Z.-L., Pundoor, G. (2006). Order assignment and scheduling in a supply chain. Oper. Res, Vol. 54, pp. 555-572. Chen, Z.-L., Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operations, Management Sci, Vol. 51, pp. 614-628. Cheng-Hsiang Liu, Bor-Yuh Leu, Sheng-Yuan Hsu. (2012). Scheduling of parallel machines with job delivery coordination, International Journal of Innovative Computing, Information and Control, Volume 8, Number 1(B). Cheng-Hsiang Liu, Tzu-Ling Wu, Pei-Shiun Lin (2010). A Hybrid Genetic Algorithm-based Approach to Solve Parallel Machine Scheduling with Job Delivery Coordination, Proceedings of the International MultiConference of Enfineers and Computer Scjentists, Vol. 3, Hong Kong. Ching-Jong Liao, Cian-Ci Shyu, Chao-Tang Tseng. (2009). A least flexibility first heuristic to coordinate setups in a two- or three-stage supply chain, Int. J. Production Economics, Vol. 117, pp. 127–135. Chiou, C., Chen, W., Liu, C., Wu, M. (2012). A genetic algorithm for scheduling dual flow shops. Expert Systems with Applications. Vol. 39, pp. 1306-1314. Chi-Shiang Su, Jason Chao-Hsien Pan, Tsung-Shin Hsu (2009). Theoretical Computer Science, Vol. 410, pp. 2581-2591. Chung-Lun Li, Jinwen Ou. (2006). Coordinated Scheduling of Customer Orders with Decentralized Machine Locations, Department of Logistics The Hong Kong Polytechnic University Hung Hom, Kowloon, Hong Kong. Cochran, J.K., Horng, S.M., Fowler, J.W. (2003). A multipopulation genetic algorithm to solve multi-objective scheduling problems for parallel machines” Computers and Operations Research, Vol. 30, pp.1087-1102. Crauwels, H. (1995). Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs, European Journal of Operational Research, Vol. 90, pp. 200- 213. Crauwels, H. (1995). Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs, European Journal of Operational Research, Vol. 90, pp. 200- 213. Dannenbring, D., (1977). An evaluation of flow shop sequencing heuristics. Management Science, Vol. 23, pp. 1174-1182. Dorn, J., (1995). Iterative Improvement Methods for Knowledge-based Scheduling. AI Comunications, Vol. 8(1), pp. 20-34. Duan, J., Pan, Q., Li, J., Bao, K. (2010). Harmony Search Algorithm. Sixth International Conference on Natural Computation. Durfee, E. H. (1999). Distributed problem solving and planning, in Multi-Agent Systems: A Modern Approach to Distributed Artificial Intelligence. Cambridge, MA: MIT Press, ch. 3. Erenguc, S. S., Simpson, N. C., Vakharia, A. J. (1999). Integrated production/ distribution planning in supply chains: An invited review. Eur. J. Oper. Res. Vol. 115, pp. 219-236. Feldmann, M., Biskup, D. (2003). Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches, Computers & Industrial Engineering, Vol. 44, pp. 307-323. Fernandes, S., Lourenço, H. (2007). A simple optimized search heuristic for the job-shop scheduling problem, Universidade do Algarve, Faro, Portugal - Univertitat Pompeu Fabra, Barcelona, Spain. Fowler, J.W., Horng, S., Cochran, J.K. (2003). A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups. International Journal of Industrial Engineering, Vol. 10(3), pp. 232-43. Framinan, J.M., Leisten, R. (2008). A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria. OR Spectrum, Vol. 30(4), pp. 787-804. Franca, P., Gendreau, M., Laporte, G., Mnller, F. (1996). A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. International Journal of Production Economics, Vol. 43, pp. 79-89. Gagne, C., Gravel, M., Price, W.L. (2005). Using Metaheuristic Compromise Programming for the Solution of Multiple Objective Scheduling Problems”. Journal of the Operational Research Society, Vol. 56(6), pp. 687-698. Gangadhran, R., Rajendran, C. (1994). A Simulated Annealing Heuristic for Scheduling in a Flow-Shop with Bicriteria. Computers and Industrial Engineering, Vol. 27, pp. 473-476. Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research, Vol. 35, pp. 2892-2907. Gendreau, M., Laporte, G., Morais-Guimaraes, E. (2001). A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. European Journal of Operational Research, Vol. 133, pp. 183-189. Gomez A., Cuevas R., De la Fuente D., Parreno J., Priore P. (2008). New Metaheuristic for the Job Shop Scheduling Problem with PSO, Department Administration de Empresas, Oviedo University, Asturias, Spain. Gonçalves, J., de Magalhães, J., Resende, M. (2002). A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem, Gong, H., Tang, L. (2008). Two-machine flowshop scheduling problem with transportation and blocking features, Chinese control and decision conference (CCDC, 2008), National 863 HighTech Research and Development Program of China through approved. Gordon, V., Strusevich, V. (2009). Single machine scheduling and due date assignment with positionally dependent processing times, European Journal of Operational Research Vol. 198, pp. 57-62. Gravel, M., Price, W.L., Gagne C. (2000). Scheduling jobs in an alcan aluminium foundry using a genetic algorithm. International Journal of Production Research, Vol. 38, pp. 3031-41. Grosan, C. (2009). A Multiobjective Metaheuristic For Job-Shop Scheduling, Studia Univ. Babes Bolyai, Informatica, Volume LIV, Number 1. Guinet, A. (1993). Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. International Journal of Production Research, Vol. 31, pp. 1579-1594. Gupta, J., (1971). A functional heuristic algorithm for the flow shop scheduling problem. Operations Research Quarterly, Vol. 22, pp. 39-47. Haddock, J., O’Keefe, R. M., (1990). Using artificial intelligence to facilitate manufacturing systems simulation. Computers and Ind. Engng, Vol. 18(3), pp. 275-283. Hall, N. G., Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, Vol. 51, pp. 566-584. Hall, R. W. (1983). Zero Inventories. Dow Jones-Irwin, 1983, ISBN 0-87094-461-4. Handfield R. B., Eenest, L. N. (1999). Introduction to supply chain management, Prentice-Hall, Upper Saddle River. Holweg, M., Disney, S., Holmstro, J., Smaros, J. (2005). Supply Chain Collaboration. Making Sense of the Strategy Continuum. European Management Journal. Vol. 23, No. 2, pp. 170-181. Hongyan, X., Hong, H. (2010). Research on Job-Shop Scheduling Problem Based on SelfAdaptation Genetic Algorithm, School of Management, Harbin University of Commerce, Harbin 150070, China. Hoogeveen, H., (2005). Multi-criteria scheduling. European journal of operational research Hsu, C., Sha, D. (2006). A hybrid particle swarm optimization for job shop. Computers & Industrial Engineering, Vol. 51(4), pp. 791-808. Hurink, E., Jurisch, B., Thole, M. (1994). Tabu search for the job shop scheduling problem with multi-purpose machine. Operations Research Spektrum, Vol. 15, pp. 205-215. Hurink, J., Knust, S. (2001). List scheduling in a parallel machine environment with precedence constraints and setup times. Operations Research Letters, Vol. 29, pp. 231-239. Husseinzadeh, A., Karimi, B., Jenabi, M. (2008). A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, Computers & Operations Research, Vol. 35, pp. 1084-1098. Jain, A.S., Meeran, S. (1999). A State-of-the-Art Review of Job-Shop Scheduling Techniques. European Journal of Operational Research, Vol. 113, pp. 390-434. AT&T Labs Research Technical Report TD-5EAL6J. Janiak, A., Kozan, E., Lichtenstein, M., Oguz, C. (2007). Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion, Int. J. Production Economics, Vol. 105, pp. 407-424. Jenabi, M., Fatemi-Ghomi S., Torabi, S., Karimi B. (2007). Two hybrid meta-heuristics for the finite horizon ELSP in flexible flowlines with unrelated parallel processors. Applied Mathematics and Computation, Vol. 186(1), pp. 230-45. Jia Hua Weng, Hiroki Okubo, Hisashi Onari. (2000). Flexible Assembly Job Shop Scheduling Based on Tabu Search, Dept. of Industrial & Management Systems Engineering, Waseda University. Johnson, S.M., (1954). Optimal two- and three stage production schedules with set up times included. Naval Research Logistics Quarterly, Vol. 1, pp. 61-68. Jou, C. (2005). A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines. Computers & Industrial Engineering, Vol. 48, pp. 39-54. Jula, P., Rafey, A. (2010). Coordinated scheduling of a single machine with sequence dependent setup times and time window constraints, International Journal of Production Research, Vol. 00, No. 00. Kaczmarczyk, W., Sawik, T., Schaller, A., Tirpak, TM. (2004). Optimal versus heuristic scheduling of surface mount technology lines. International Journal of Production Researc, Vol. 42(10), pp. 2083-110. Kelly, J.D., Zyngier, D., (2008). Hierarchical Decomposition Heuristic for Scheduling: Coordinated Reasoning for Decentralized And Distributed Decision-Making Problems. Computers and Chemical Engineering, Vol. 32, pp. 2684-2705. Kerr, R. M., Ebsary, R. W. (1998) Implementation of an expert system for production scheduling. European journal of operational research, Vol. 33, pp.17-29. Khalouli, S., Ghedjati, F., Hamzaoui, A. (2010). The meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop, Engineering Applications of Artificial Intelligence, Vol. 23, pp. 765-771. Kim, C., Shin, H. (2003). Scheduling jobs on parallel machines: a restricted tabu search approach. International Journal of Advanced Manufacturing Technology, Vol. 22, pp. 278-287. Kim, D., Kim, K., Jang, W., Chen, F. (2002). Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer Integrated Manufacturing, Vol. 18, pp. 223-231. Kjenstad, D. (1998). Coordinated supply chain scheduling, Norwegian university of Science and Technology, Department of Production and Quality Engineering. Krishnan, M., Karthikeyan, T., Chinnusamy, T. R., Venkatesh Raja, K. (2012). A Novel Hybrid Metaheuristic Scatter Search-Simulated Annealing Algorithm for Solving Flexible Manufacturing System Layout, European Journal of Scientific Research, Vol.73 No.1, pp. 52-61. Kumar, R., Tiwari, M. K., Shankar, R. (2008). Scheduling of flexible manufacturing systems: an ant colony optimization approach, Proc. Instn Mech. Engrs Part B: J. Engineering Manufacture, Vol. 217. Kunpeng Li, Appa Iyer Sivakumar, Viswanath Kumar Ganesan. (2008). Analysis and algorithms for coordinated scheduling of parallel machine manufacturing and 3PL transportation. Int. J. Production Economics. Vol. 115, pp. 482-491. Kurz, M., Askin, R. (2001). Heuristic scheduling of parallel machines with sequencedependent set-up times. International Journal of Production Research, Vol. 39, pp. 3747-3769. Kurz, M.E., Askin, R.G. (2004). Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research, Vol. 159, pp. 66-82. Lapierre, S.D., Ruiz, A.B. (2007). Scheduling logistic activities to improve hospital supply systems. Computers and Operations Research, Vol. 34 (3), pp. 624-641. Lee, C.Y. (1997). Minimizing the makespan in the two-machine flow-shop scheduling problem with an availability constraint, Operational Research Letters, Vol. 20, pp. 129-139. Lee, C.Y., Chen, Z.L. (2001). Machine scheduling with transportation considerations, Journal of Scheduling, Vol. 4, pp. 4-24. Lee, H. L., Whang, S. (1999). Decentralized Multi-Echelon Supply Chains: Incentive and Information, Management Science, Vol. 45(5), pp. 633-640. Lee, H., Billington, C. (1992). Managing Supply Chain Inventory: Pitfalls and Opportunities. Sloan management review. Lee, Y. H., Jeong, C. S., Moon, C. (2002). Advanced planning and scheduling with outsourcing in manufacturing supply chain. Computers & Industrial Engineering, Vol. 43, pp. 351-374. Lee, Y., Pinedo, M. (1997). Scheduling jobs on parallel machines with sequence dependent setup times. European Journal of Operational Research, Vol. 100, pp. 464-474. Lejeune, M.A. (2006). A variable neighborhood decomposition search method for supply chain management planning problems. European Journal of Operational Research, Vol. 175 (2), pp. 959-976. Li, D. C., She, I. S. (1994). Using unsupervised learning technologies to induce scheduling knowledge for FMSs. Int. J. Prod. Res., Vol. 32(9), pp. 2187-2199. Li, J., Li, W., Karimi, I.A., Srinivasan, R. (2007). Improving the robustness and efficiency of crude scheduling algorithms. AIChE Journal, Vol. 53 (10), pp. 2659-2680. Li, K. P., Ganesan, V. K., Sivakumar, A. I. (2005). Synchronized scheduling of assembly and multi-destination air transportation in a consumer electronicssupply chain. International Journal of Production Research, Vol. 43, pp. 2671-2685. Li, K. P., Ganesan, V. K., Sivakumar, A. I. (2006). Scheduling of single stage assembly with air transportation in a consumer electronic supply chain. Computers and Industrial Engineering, Vol. 51, pp. 264-278. Li, K. P., Sivakumar, A. I., Ganesan, V. K. (2008). Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronic supply chain. European Journal of Operational Research, Vol. 187, pp. 442-455. Li, K. P., Sivakumar, A. I., Mathirajan, M., Ganesan, V. K. (2004). Solution methodology for synchronizing assembly manufacturing and air transportation of consumer electronics supply chain. International Journal of Business, Vol. 9, pp. 361-380. Li, k., Appa Iyer, S., Fu, Q., Jin, X. (2007). A Case Study for Synchronized Scheduling of manufacturing and air transportation in Consumer Electronics Supply Chain, Proceedings of the 2007 IEEE IEEM. Li, Q., Liang, L., Qiao, W. (2011). A Hybrid Robust Scheduling for Single Machine Subject to Random Machine Breakdown. Fourth International Workshop on Advanced Computational Intelligence Wuhan, Hubei, China. Lin, C.H., Liao, C.J. (2003). Makespan minimization subject to flowtime optimality on identical parallel machines, Computers and Operations Research, Vol. 31, pp. 1655-1666. Liouane, N., Saad, I., Hammadi, S., Borne, P. (2007). Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production, International Journal of Computers, Communications & Control Vol. II (2007), No. 2, pp. 174-184. Logendran, R., McDonell, B., Smucker, B. (2007). Scheduling unrelated parallel machines with sequence-dependent setups. Computers & Operations Research, Vol. 34, pp. 3420-3438. Luh, P., Feng, W. (2003). From Manufacturing Scheduling to Supply Chain Coordination: The Control of Complexity and Uncertainty, The Fourth International Conference on Control and Automation (ICCA'03), 10-12 June 2003, Montreal, Canada. Ma Fei，Wu Meng-Na, Sun Bao-Feng，Yang Hua. (2009). The Coordination of Production and Distribution Scheduling in Mass Customization, 2009 International Conference on Management Science & Engineering (16th) September 14-16, Moscow, Russia. Majazi, V., Mohammadi, G. (2012). Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints, Computers and Mathematics with Applications. Mansouri, S. (2006). A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain, Computers & Industrial Engineering, Vol. 50, pp. 105-119. Martí, R. (2003) (a). Procedimientos metaheurísticos en optimización combinatoria. Matemátiques, Vol. 1. Martí, R. (2003). Algoritmos heurísticos en optimización combinatoria. Universidad de Valencia, Departamento de Estadística e Investigación Operativa. Mastrolilli, M., Gambardella, L. M. (2000). Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, Vol. 3(1), pp. 3-20. Mazzini, R., Armentano, V. (2001). A heuristic for single machine scheduling with early and tardy costs, European Journal of Operational Research, Vol. 128, pp. 129-146. Mendes, A., Muller, F., Franca P., Moscato, P. (2002). Comparing meta-heuristic approaches for parallel machine scheduling problems. Faculdade de Engenharia Elétrica e de Computação Universidade Estadual de Campinas - UNICAMP C.P. Campinas - SP - Brazil. Mendes, A., Muller, F., Franca P., Moscato, P. (2002). Comparing meta-heuristic approaches for parallel machine scheduling problems. Faculdade de Engenharia Elétrica e de Computação Universidade Estadual de Campinas - UNICAMP C.P. Campinas - SP - Brazil. Mezmaz, M., Melab, N., Talbi, E.G. (2006). A Parallel Exact Hybrid Approach for Solving MultiObjective Problems on the Computational Grid, Laboratoire d’Informatique Fondamentale de Lille UMR CNRS 8022, INRIA Futurs - DOLPHIN Project, IEEE. Monahan, J. P. (1984). A Quantity Discount Pricing Model to Increase Vendor Profits, Management Science, Vol. 30(6), pp. 720-726. Monch, L., Balasubramanian, H., Fowler, J., Pfund, M. (2005). Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times, Computers & Operations Research, Vol. 32, pp. 2731-2750. Moon, C., Kim, J., Hur, S. (2002). Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain. Computers & Industrial Engineering, Vol. 41, pp. 331-349. Moon-Won Park, Yeong-Dae Kim. (1997). Search Heuristics for a Parallel Machine scheduling Problem with Ready Times and Due Dates, Computers ind. Engng, Vol. 33, pp. 793-796. Naderi, B., Fatemi Ghomi, S., Aminnayeri, M. (2010). A high performing metaheuristic for job shop scheduling with sequence-dependent setup times, Applied Soft Computing, Vol. 10, pp. 703-710. Naso, D., Surico, M., Turchiano, B., Kaymak, U. (2007). Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete. European Journal of Operational Research, Vol. 177 (3), pp. 2069-2099. Nash, J. (1050) “The bargaining problem. Econometrica”, Vol. 18, pp. 155-162. Nowicki, E., Smutncki, C. (1996). A fast Tabu search algorithm for the permutation flow-shop problem. European Journal Operational Research, Vol. 91, pp. 160-175. Nowicki, E., Smutncki, C. (1996). A fast Tabu search algorithm for the permutation flow-shop problem. European Journal Operational Research, Vol. 91, pp. 160-175. Ogbu, F.A., Smith, D.K. (1990). The application of the simulated annealing algorithm to the solution of the n/m/cmax flow shop problem. Computers & Operations Research, Vol. 17 (3), pp. 243-253. Ogbu, F.A., Smith, D.K. (1991). Simulated annealing for the permutation flow-shop problem. Omega, Vol. 19, pp. 64-67. Ortiz, M., Neira, D., Jimenez, G., Hernández, H. (2016). Solving flexible Job-Shop Scheduling Problem with Transfer barches, Set up times and multiple resources in Apparel Industry. Lecture Notes in Computer Science, Vol. 9713, pp. 47-58 Osman, I. H., Kelly, J. P. (1996). Meta-Heuristics: Theory and Applications. 39 Kluwer Academic Publishers. Osman, I.H., Potts, C.N. (1989). Simulated annealing for permutation flow-shop scheduling. Omega 17 (6), 551-557. Ovallos-Gazabón, D., Villalobos-Toro, B., De la Hz-Escorcia, S., Maldonado-Pérez, D. (2016). Gamificación para la gestión de la innovación a nivel organizacional. Una revisión del estado del arte. Revista Espacios, Vol. 37(8), pp. 2. Ow, P.S., Morton, T.E. (1989). The single machine early/tardy problem. Management Science, Vol. 35, pp. 177-191. Palmer, D., (1965). Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operations Research Quarterly, Vol. 16, pp. 101- 107. Parviz Fattahi, Mohammad Saidi Mehrabad, Mir B. Aryanezhad (2006). An Algorithm for multiobjective job shop scheduling problem, Journal of Industrial Engineering International, Islamic Azad University, South Tehran Branch, Vol. 2, No. 3, pp. 43-53. Pauli, J. (1995). A hierarchical approach for the FMS schduling problem. European Journal of Operational Research, Vol. 86(1), pp. 32-42. Piersma, N., Van Dijk, W. (1996). A Local Search Heuristic for Unrelated Parallel Machine Scheduling with Efficient Neighborhood Search, Mathl. Comput. Modelling, Vol. 24, No. 9, pp. 11-19. Pinedo, M. (2002). Scheduling: Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs, NJ. Ping, Y., Minghai, J. (2011). An Improved PSO Search Method for the Job Shop Scheduling Problem, Chinese Control and Decision Conference (CCDC). Ping, Y., Minghai, J. (2011). An Improved PSO Search Method for the Job Shop Scheduling Problem, IEEE. Quadt, D., Kuhn, H. (2007). Batch scheduling of jobs with identical process times on flexible flow lines. International Journal of Production Economics, Vol. 105, pp. 385-401. R. Zhang, Wu, C. (2006). A hybrid immune simulated annealing algorithm for the job shop scheduling problem, Applied Soft Computing, Vol. 10, no. 1, pp. 79-89. Reeves, C. (1993). Improving the efficiency of tabu search for machine sequencing problems, Journal of the operational research society, Vol. 44, pp. 375-382. Reeves, C. (1995). Heuristics for scheduling a single machine subject to unequal job release times, European Journal of Operational Research, Vol. 80, pp. 397-403. Reeves, C.R. (1995). A genetic algorithm for flow shop sequencing. Computers and Operations Research, Vol. 22 (1), pp. 5-13. Restrepo, J. (2010). Application the palmer´s heuristic for sequencing n jobs trough m machines: a study case. Scientia et Technica Año XVII, No 46. Universidad Tecnológica de Pereira. Rivera, J.C. (2007). Estrategias heurísticas adaptativas para la solución del problema de programación de proyectos con recursos limitados (rcpsp). Universidad Nacional de Colombia - Sede Medellín. Ruiz-Torres, A.J., Ho, J.C., Lopez, F.J. (2006). Generating Pareto schedules with outsource and internal parallel resources. International Journal of Production Economics, Vol. 103 (2), pp. 810-825. Saharidis, G. (2011). Supply Chain Optimization: Centralized vs Decentralized Planning and Scheduling. University of Thessaly, Department of Mechanical Engineering. Sait Sadiq, M., Youssef, H. (1999). Iterative Computer Algorithms with Applications in Engineering. Solving Combinatorial Optimization Problems. IEEE computer Society. Salas, K., Acosta Villa, C., Sandoval Cortés, L., Pacheco, G., Mercado Caruso, N. (2016). Análisis estratégico de cluster de servicios logísticos. Revista Espacios, Vol. 37 (28), pp. 5. Salas Navarro, K., Chedid, J.A., Caruso, N.M., Sana, S.S. (2016). An Inventory model of threelayer supply chain of Wood and furniture industry in the Caribbean region of Colombia. International Journal of Systems Science: Operations and Logistics, Vol 4, pp. 1-18. Sana, S.S., Chedid, J.A., Navarro, K.S. (2014). A three layer supply chain model with multiple suppliers, manufacturers and retailers for multiple items, Applied Mathematics and Computation, Vol. 229, pp. 139-150 Sarmiento, A. M., Nagi, R. (1999). A review of integrated analysis of production-distribution systems. IIE Trans, Vol. 31, pp. 1061-1074. Selvarajah, E., Steiner, G. (2005). Batch scheduling in a two-level supply chain A focus on the supplier. European Journal of Operational Research. Sevaux, M., Orensen, K. (2005). VNS/TS for a parallel machine scheduling problem, MEC-VNS: 18th Mini Euro Conference on VNS. Sevkli, M., Aydin, M. (2006). Variable Neighbourhood Search for Job Shop Scheduling Problems, Journal Of Software, Vol. 1, No. 2. Shahvari, O., Salmasi, N., Logendran, R. (2009). A Meta-Heuristic Algorithm for Flexible Flow Shop Sequence Dependent Group Scheduling Problem, Proceedings of the 2009 International Conference on Value Chain Sustainability. Shapley, L. (1953) Avalue for n-person games in Kuhn, W., Tucker, W., editors, “Contributions to the Theory of Games II”, Princeton University Press, Princeton, pp. 307-317. Shi, D., He, J., Wang, L. (2009). Job Shop Scheduling Problem with an Novel Particle Swarm Optimization based on Tabu Search, International Conference on Artificial Intelligence and Computational Intelligence. Smith, R. G. (1980). The Contract Net Protocol: High-level Communication and Control in the Distributed Problem Solver, IEEE Transactions on Computers, Vol. C-29, No. 12, pp. 1104-1113. Sortrakul, N., Nachtmann, H.L., Cassady, C.R. (2005). Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine, Computers in Industry, Vol. 56, pp. 161-168. Stewart, I., Fenn, P. (2006). Strategy: the motivation for innovation. Construction Innovation, Vol. 6, pp, 173-185. Stutzle, T. (1998). An ant approach to the flow shop problem. In: Proceedings of the Sixth European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany, Verlag Mainz, pp. 1560-1564. Suresh, V., Chaudhuri, D. (1996). Bicriteria scheduling problem for unrelated parallel machines” Computers & Industrial Engineering, Vol. 30, pp. 77-82. Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, Vol. 47, pp. 65-74. Tang, J., Zhang, G., Lin, B. (2010). Hybrid Genetic Algorithm for Flow Shop Scheduling Problem, International Conference on Intelligent Computation Technology and Automation. Tang, L., Wang, X. (2010). An Improved Particle Swarm Optimization Algorithm for the Hybrid Flow-shop Scheduling to Minimize Total Weighted Completion Time in Process Industry. IEEE transactions on control systems technology, Vol. 18, N°. 6. Tavakkoli-Moghaddama, R., Safaei, N., Sassani, F. (2009). A memetic algorithm for the flexible flow line scheduling problem with processor blocking, Computers & Operations Research, Vol. 36, pp. 402-414. Thomas, D. J., Griffin, P. M. (1996). Coordinated supply chain management. European Journal of Operational Research, Vol. 94, pp. 1-15. Toloie, A., Ahmad, S. (2011). Scheduling in flexible job-shop manufacturing system by improved tabu search, African Journal of Business Management, Vol. 5(12), pp. 4863-4872. Torabi, S. A., Fatemi Ghomi, S. M. T., Karimi, B. (2005). A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains. European Journal of Operational Research. Torabi, S., Jenabi, M., Mansouri, A. (2008). Hybrid Genetic Algorithms for the Lot Production and Delivery Scheduling Problem in a Two-Echelon Supply Chain, A. Fink and F. Rothlauf (Eds.): Advances in Computational Intelligence, SCI 144, pp. 253-275. Trentesaux, D. Distributed control of production systems. Engineering Applications of Artificial Intelligence, Vol. 22 (7), pp. 971-978. Tseng M M, Jiao (1996). Design for mass customization?. Annals of the CIRP, Vol. 45(1), pp. 153-6. Valente, J. (2008). Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time, Computers & Industrial Engineering, Vol. 55, pp. 663-675. Valente, J., Alves, R. (2007). Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties, Computers & Operations Research, Vol. 35, pp. 3696-3713. Valente, J., Schaller, J. (2011). Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problema, Computers & Operations Research, Vol. 39, pp. 2223-2231. Van Den Heever, S.A., Grossmann, I.E. (2003). A strategy for the integration of production planning and reactive scheduling in the optimization of a hydrogen supply network. Computers and Chemical Engineering, Vol. 27 (12), pp. 1813-1839. Varadharajan, T.K., Rajendran, C. (2005). Amulti-objective simulated-annealing algorithm for scheduling in flowshop to minimize the makespan and total flowtime of jobs”. European Journal of Operational Research, Vol. 167(3), pp. 772-795. Velez, M., López, J. (2011). A variable neighborhood search algorithm to minimize the total weighted tardiness on a batch processing machine, 1PDepartamento de Ingeniería de Production, Universidad EAFIT, Ingeniería Industrial-Año. Vol. 10, Nº1: pp. 5-18, Medellín, Colombia. Verderame, P.M., Elia, J.A., Li, J., Floudas, C.A. (2010). Planning and scheduling under uncertainty: A revire across multiple sectors. Industrial Engineering Chemistry Research, Vol. 49 (9), pp. 3993-4017. Vergara, F. E., Khouja, M., Mickalewicz, Z. (2002). An evolutionary algorithm for optimizing material flow in supply chains. Computers & Industrial Engineering, Vol. 43, pp. 407-421. Vianna, Y., Vianna, M., Medina, B., & Tanaka, S. (2014). Gamificacion, Inc - Recreating Companies Through Games. MJV Press. Wang Xu, Jia Yan-Min, Yu Tian-Lai (2008). Research on Dynamic Scheduling Operation Method in Supply Chain Based on Ant Colony Optimization, The IEEE International Conference on Industrial Informatics, DCC, Daejeon, Korea. Wang, L., Zheng, D. (2001). An effective hybrid optimization strategy for job-shop scheduling problems, Computers & Operations Research, Vol. 28, pp. 585-596. Wang, W., Cheng, T. C. E. (2009). Production Scheduling with Supply and Delivery Considerations to Minimize the Makespan, School of Economics and Management, Nanjing University of Science and Technology, Nanjing, China Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. Witt, A., Voß, S. (2007). Job Shop Scheduling with Buffer Constraints and Jobs Consuming Variable Buffer Space, W. Dangelmaier et al. (Eds.), LNBIP, Vol. 46, pp. 295-307. Woeginger, G.J. (1994). Heuristics for parallel machine scheduling with delivery times, Acta Informatica, Vol. 31, pp. 503-512. Xu, D., Yin, Y. (2011). On single-machine scheduling with flexible maintenance activities. Int J Adv Manuf Technol. Vol. 56, pp. 1139-1145. Yamada, T., Reeves, C. (1997). Permutation flowshop scheduling by genetic local search. Proceedings of the 2nd IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems (GALESIA ‘97), London, UK:IEE, pp. 232-238. Yun-Chia Liang, Yu-Ming Hsiao, Chia-YunTien (2011). Metaheuristics for drilling operation scheduling in Taiwan PCB industries, Int. J. Production Economics, Department of Industrial Engineering and Management, Yuan Ze University. Yun-Chia Liang, Yu-Ming Hsiao,Chia-Yun Tien. (2012). Metaheuristics for drilling operation scheduling in Taiwan PCB industries, SciVerse ScienceDirect. Zhang, C. Y., Li, P. G., Rao, Y. Q., Guan, Z. L. (2008). A very fast TS/SA algorithm for the job shop scheduling problem, Computers & Operations Research, Vol. 35, no. 1, pp. 282-294. Zhi-Long Chen. (2010). Integrated Production and Outbound Distribution Scheduling: Review and Extensions, Operations Research, Vol. 58, No. 1, pp. 130-148. Zhong, W., Dosa, G., Tan, Z. (2007). On the machine scheduling problem with job delivery coordination. European Journal of Operational Research, Vol. 182 (3), pp. 1057-1072. Zobolas, G.I., Tarantilis, C.D., Ioannou, G. (2009). Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Computers & Operations Research, Vol. 36, pp. 1249-1267. Zribi, N., El Kamel, A., Borne, P. (2006). Total Tardiness in a Flexible Job-shop, IMACS Multiconference on Computational Engineering in Systems Applications (CESA), October 4-6, 2006, Beijing, China.spa
dc.title.translatedReactive scheduling in collaborative supply chain: A literature reviewspa
dc.type.coarhttp://purl.org/coar/resource_type/c_6501spa
dc.type.contentTextspa
dc.type.driverinfo:eu-repo/semantics/articlespa
dc.type.redcolhttp://purl.org/redcol/resource_type/ARTspa
dc.type.versioninfo:eu-repo/semantics/acceptedVersionspa
dc.type.coarversionhttp://purl.org/coar/version/c_ab4af688f83e57aaspa
dc.rights.coarhttp://purl.org/coar/access_right/c_abf2spa


Ficheros en el ítem

Thumbnail
Nombre:
Reprogramación de producción en.pdf
Tamaño:
532.5Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

  • Artículos científicos [3154]
    Artículos de investigación publicados por miembros de la comunidad universitaria.

Mostrar el registro sencillo del ítem