Secuenciación con Almacenes Limitados. Una Revisión de la Literatura

• Andrés, Carlos ^[2] ; Maheut, Julien ^[1]
  1. [1] Universidad Politécnica de Valencia

     Universidad Politécnica de Valencia

     Valencia, España

     
  2. [2] Grupo de Investigación en Reingeniería, Organización, Trabajo en Grupo y Logistica Empresarial (ROGLE)
• Localización: Dirección y organización: Revista de dirección, organización y administración de empresas, ISSN 1132-175X, Nº. 66, 2018, págs. 17-33
• Idioma: español
• DOI: 10.37610/dyo.v0i66.533
• Títulos paralelos:
  • Scheduling with limited buffers. A literature review
• Enlaces
  • Texto completo
• Dialnet Métricas: 2 Citas
• Resumen
  • español

    Tradicionalmente, en la aproximación formal a la secuenciación de producción denominada en inglés Theory of Scheduling (o simplemente scheduling), se suele obviar la limitación de capacidad entre los diferentes recursos de cara a establecer el programa de producción. Sin embargo, el paradigma Lean Manufacturing ha dejado patente que la limitación de capacidad física en los sistemas productivos es una característica que influye en los resultados de los programas de producción, por lo que las configuraciones empezando a ser objeto de estudio en la dirección de operaciones. En este artículo se hace una revisión de las principales características de la secuenciación con almacenes limitados que se han abordado bajo la teoría de secuenciación y se resumen las referencias más importantes publicadas durante los últimos años. Finalmente, se presentan una serie de conclusiones con el objetivo de clarificar algunas líneas de interés para los investigadores del tema.Palabras clave: Programación de la producción, secuenciación, capacidad limitada, almacén limitado, secuenciación con bloqueo, secuenciación sin esperas.

  • English

    Usual approach to production scheduling, named Theory of Scheduling (or Scheduling), considers infinite capacity assumption between all the diferents resources in order to establish production program. However, lean manufacturing paradigm demonstrates that capacity limitations have a great impact over production schedules and consequently there is an increasing interest to study scheduling problems with capacity in recent years. This paper summarizes the principal contributions in scheduling with limited capacity and presents conclussions to give some promising research areas related to real scheduling problems. Keywords: production programming, scheduling, limited capacity, limited buffer, blocking scheduling, no-wait scheduling.

• Referencias bibliográficas
  • ABADI, I. N. K., HALL, N. y SRISKANDARAJAH, C. (2000). «Minimizing Cycle Time in a Blocking Flowshop». Operations Research. 48, 177-180
  • ABDOLLAHPOUR, S. y REZAEIAN, J. (2015). «Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach...
  • AGNETIS, A., PACCIARELLI, D. y ROSSI, F. (1997). «Batch scheduling in a two-machine flow shop with limited buffer». Discrete Applied Mathematics....
  • ALMEDER, C. Y HARTL, R. F. (2010). «A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited...
  • ALLAHVERDI, A. (2016). «A survey of scheduling problems with no-wait in process». European Journal of Operational Research. 255 (3), 665-686.
  • BAUTISTA, J., CANO, A., COMPANYS, R. y RIBAS, I. (2011). «A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem». IEEE...
  • BAUTISTA, J., CANO, A., COMPANYS, R. y RIBAS, I. (2012). «Solving the Fm block Cmax problem using Bounded Dynamic Programming». Engineering...
  • BELAÏD, R., T’KINDT, V. y ESSWEIN, C. (2012). «Scheduling batches in flowshop with limited buffers in the shampoo industry». European Journal...
  • BOLAT, A. (1997). «Sequencing jobs for an automated manufacturing module with buffer». European Journal of Operational Research. 96, 622-635
  • BRIZUELA, C.A., ZHAO, Y. y SANNOMIYA, N. (2001). «No-wait and blocking job-shops: Challenging problems for GA’s». 2001 IEEE International...
  • BRUCKER, P., HEITMANN, S. y HURINK, J. (2003). «Flow-shop problems with intermediate, buffers». OR Spectrum. 25, 549-574
  • BRUCKER, P., HEITMANN, S., HURINK,J. y NIEBERG, T., (2006). «Job-shop scheduling with limited capacity buffers». OR Spectrum 28, 151-176
  • BRUCKER, P. y KAMPMEYER, T. (2008). «Cyclic job shop scheduling problems with blocking». Annals of Operations Research, 159 (2008), 161-181
  • CARAFFA, V., IANES, S.P., BAGCHI, T. y SRISKANDARAJAH, C. (2001). «Minimizing makespan in a blocking flowshop using genetic algorithms». International...
  • COMPANYS, R. y COROMINAS, A. (1996). «Organización de la Producción II. Dirección de Operaciones 4». Barcelona. Ed. UPC
  • COMPANYS, R., RIBAS, I. y MATEO, M. (2010). «Note on the behaviour of an improvement heuristic on permutation and blocking flowshop scheduling»....
  • DENG, G., XU, Z., y GU, X. (2012). «A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop...
  • DUTTA, S.K. y CUNNINGHAM, A.A. (1975). «Sequencing two-machine flow-shops with finite intermediate storage ». anagement Science, 21(9), 989-996
  • EDDALI, M., JARBOUI, B. Y SIARRY., P. (2016). «Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem»....
  • FERNANDEZ- VIAGAS, V. LEISTEN, R. y FRAMINAN, J. M. (2016). «A computational evaluation of constructive and improvement heuristics for the...
  • FRAMINAN, J. M., GONZALEZ, P. L., y RUIZ-USANO, R. (2003). «The Conwip production control system: Review and research issues». Production...
  • GENDREAU, M., HERTZ, A. y LAPORTE, G. (1992). «New insertions and postoptimization Procedures for the Travelling Salesman Problem», Operations...
  • GOLDRATT, E. M. y COX, J. (1984). «The Goal: An ongoing improvement process». New York: North River Press.
  • GONG, H., TANG, L. y DUIN, C.W. (2010). «A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking...
  • GONZALEZ, P. L., FRAMINAN, J. M. y PIERREVAL, H. (2012). «Token-based pull production control systems: an introductory overvie». Journal of...
  • GRABOWSKI, J. y PEMPERA, J. (2007) «The permutation flow shop problem with blocking. A tabu search approach». Omega. 35(3), 302-311.
  • GRÖFLIN, H. y KLINKERT, A. (2009). «A new neighborhood and tabu search for the Blocking Job Shop». Discrete Applied Mathematics. 157(17),...
  • HALL, N.G., POSNER, M.E. y POTTS, C. N. (1997). «Preemptive scheduling with finite capacity input buffers». Annals of Operations Research....
  • HALL, N.G., POSNER, M.E. y POTTS, C. N. (1998a). «Scheduling with finite capacity input buffers». Operations Research. 46, 154-159.
  • HALL, N.G., POSNER, M.E. y POTTS, C. N. (1998b). «Scheduling with finite capacity output buffers». Operations Research. 46, 84-97.
  • HEITMANN, S. (2007). «Job-shop scheduling with limited buffer capacities». Tesis Doctoral. Universidad de Osnabrück.
  • HSIEH, Y., YOU, P. y LIOU, C. (2009). «A note of using effective immune based approach for the flow shop scheduling with buffers». Applied...
  • JAEGLER, Y., JAEGLER, A., BURLAT, P., LAMOURI, S. y TRENTESAUX, D. (2017). « The ConWip production control system: a systematic review and...
  • JOHNSON, S. M. (1954). «Optimal two and three stage production schedules with set-up time included». Naval Research Logistics Quaterly, 1,...
  • KHORASANIAN, D. y MOSLEHI, G., (2012). «An iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow...
  • KHORASANIAN, D. y MOSLEHI, G. (2017). «Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine,...
  • KNOPF, F. C. (1985). «Sequencing a generalized two-stage flowshop with finite intermediate storage». Computers & Chemical Engineering....
  • KHOSLA, I. (1995). «The scheduling problem where multiple machines compete for a common local buffer». European Journal of Operational Research....
  • LAND, M. J. (2009). «Cobacabana (control of balance by card-based navigation): A card-based system for job shop control». International Journal...
  • LEINSTEN, R. (1990). «Flowshop sequencing problems with limited buffer storage». International Journal of Production Research. 28, 2085-2100.
  • LEVNER, E. M. (1969). «Optimal planning of parts machining on a number of machines». Automation and Remote Control. 12, 1972-1978
  • LI, J. y PAN, Q. (2015). «Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony...
  • LIANG, J.J., PAN, Q., TIEJUN, C. y WANG, L. (2011). «Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm...
  • LIN, S. y YING, K. (2013). « Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm». Omega. 41(2),...
  • LIU, B., WANG, L. y JIN, Y. (2008). «An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers». Computers &...
  • LIU, S.Q. y KOZAN, E. (2009a). «Scheduling a flow shop with combined buffer conditions». International Journal of Production Economics. 117,...
  • LIU, S.Q. y KOZAN, E. (2009b). «Scheduling trains as a blocking parallel-machine job shop scheduling problem», Computers and Operations Research....
  • LIU, S.Q. y KOZAN, E. (2016). «Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements». Computers...
  • LUH, P.B., GOU, L., ZHANG, Y., NAGAHORA, T., TSUJI, M., YONEDA, K., HASEGAWA, T., KYOYA, Y. y KANO, T. (1998). «Job shop scheduling with group-dependent...
  • MALEKI-DAROUNKOLAEI, A., MODIRI, M., TAVAKKOLI-MOGHADDAM, R. y SEYYEDI, I. (2012). «A three-stage assembly flow shop scheduling problem with...
  • MASCIS, A. y PACCIARELLI, D., (2002). «Job-shop scheduling with blocking and no-wait, constraints». European Journal of Operational Research,...
  • MCCORMICK, S.T., PINEDO, M. I., SHENKER, S. y WOLF, B., (1989). «Sequencing in an assembly line with blocking to minimize cycle time». Operations...
  • MOSLEHI, G., y KHORASANIAN, D. (2013). «Optimizing blocking flow shop scheduling problem with total completion time criterion». Computers...
  • MOSLEHI, G., y KHORASANIAN, D. (2014). « A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop...
  • NAWAZ, M., ENSCORE, E. E. y HAM, I., (1983). «A heuristic algorithm for the m-machine, n-job flowshop sequencing problem». Omega 11(1),91-95
  • NORMAN, B. A. (1999). «Scheduling flowshops with finite buffers and sequence- dependent setup times». Computers & Industrial Engineering....
  • NOWICKI, E. (1999). «The permutation flow shop with buffers: a tabu search approach». European Journal of Operational Research, 116, 205–219.
  • PAN, Q.K., WANG, L. y GAO, L. (2011). «A chaotic harmony search algorithm for the flow shop scheduling problema with limited buffers». Applied...
  • PAN, Q.K. y WANG, L. (2012). «Effective heuristics for the blocking flowshop scheduling problem with makespan minimization». Omega, 40, 218–229
  • PAPADIMITRIOU, C. H. y KANELLAKIS, P.C. (1978). «Flowshop scheduling with limited temporary storage». Journal of ACM. 27, 533-549.
  • PINEDO, M. (2010). «Scheduling. Theory, algorithms and systems». Ed Springer. New York
  • PRANZO, M. (2004). «Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times»....
  • PRANZO, M. y PACCIARELLI, D. (2015). «An iterated greedy metaheuristic for the blocking job shop scheduling problem». journal of Heuristics....
  • QIAN , B., WANG, L., HUANG, D.X. y WANG, X. (2009). «An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers»....
  • RIBAS, I., COMPANYS, R. y TORT-MARTORELL, X. (2011). «An iterated greedy algorithm for the flowshop scheduling problem with blocking». Omega...
  • RIBAS, I. y COMPANYS, R. (2013). «A competitive variable neighbourhood search algorithm for the blocking flow shop problem». European Journal...
  • RIBAS, I. y COMPANYS, R. (2015). «Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization»....
  • RIBAS, I., COMPANYS, R. y TORT-MARTORELL, X. (2017). «Efficient heuristics for the parallel blocking flow shop scheduling problem». Expert...
  • RONCONI, D. y ARMENTANO, V. (2001). «Lower boundings schemes for flowshops with blocking in process». Journal of the Operational Research...
  • RONCONI, D. (2004). «A note on constructive heuristics for the flowshop problem with blocking». International Journal of Production Economics,...
  • RONCONI, D. (2005). «A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking». Annals of Operations Research, 53-65
  • RONCONI, D. P. y ENRIQUES, L.R.S. (2009). «Some heuristic algorithms for total tardiness minimization in a flowshop withblocking». 37(2),...
  • ROSSI, A. y LANZETTA, M. (2013). «Scheduling flow lines with buffers by ant colony digraph». Expert Systems with Applications. 40, 3328-3340
  • SAWIK, T. (2000). «Mixed Integer Programming for Scheduling Flexible Flow Lines with Limited Intermediate Buffers». Mathematical and Computer...
  • SAWIK, T. (2002). «An Exact Approach for Batch Scheduling in Flexible Flow Lines with Limited Intermediate Buffers». Mathematical and Computer...
  • SMUTNICKI, C. (1998). «A two-machine permutation flow shop scheduling problem with buffers». OR Spektrum. 20, 229-235
  • SPEARMAN, M. L., HOPP, W. J. H., y WOODRUFF, D. L. (1989). «A hierarchical control architecture for Constant Work-in-Process (CONWIP) production...
  • SUGIMORI, Y., KUSUNOKI, K., CHOR, F. y UCHIKAWA, S. (1977). «Toyota production system and Kanban system Materialization of just-in-time and...
  • SURI, R. (1998). «Quick response manufacturing: A company-wide approach to lead time reduction». Portland, OR: Productivity Press.
  • TAILLARD, E. (1993). «Benchmarks for basic scheduling problems», European Journal of Operational Research, 64(2), 278-285.
  • TANG, L. y XUAN, H. (2006). «Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers»....
  • TASGETIREN, M. F., PAN, Q., KIZILAY, D. y GAO, K. (2016). «A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem...
  • TASGETIREN, M. F., KIZILAY, D., PAN, Q., y SUGANTHAN, P. N. (2017). «Iterated greedy algorithms for the blocking flowshop scheduling problem...
  • THORNTON, H.W. Y HUNSUCKER, J.L. (2004). «A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate...
  • WANG, L. ZHANG, L. y ZHENG, D., (2006). «An effective hybrid genetic algorithm for flow shop scheduling with limited buffers». Computers &...
  • WANG, X. y TANG, L. (2009). «A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers». Computers &...
  • WANG, L., PAN, Q., SUGANTHAN,P.N., WANG, W. y WANG, Y. (2010a). «A novel hybrid discrete differential evolution algorithm for blocking flow...
  • WANG, L., PAN, Q., y TASGETIREN, M. (2010b). «Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms»....
  • WANG, L., PAN, Q., y TASGETIREN, M. (2011). « A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem»....
  • WARDONO B. y FATHI, Y. (2004) «A tabu search algorithm for the multi-stage parallel machine problems with limited buffer capacities». European...
  • WITT, A., y VOSS, S., (2007). «Simple heuristics for scheduling with limited intermediate storage». Computers & Operations Research 34,...
  • WITT, A., y VOSS, S., (2010). «Job Shop scheduling with buffer constraints and Jobs consuming variable buffer space». Advanced manufacturing...
  • WITTROCK, R. J. (1988). «An adaptable scheduling algorithm for flexible flow lines». Operations Research. 36, 445-453
  • YAURIMA, V., BURTSEVA, L. y TCHERNYKH, A. (2009). «Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints...