Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times

[EN] A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. © 2011 Springer-Verlag London Limited.The authors are indebted to the referees and editor for a close examination of the paper, which has increased its quality and presentation. This work is partially funded by the Spanish Ministry of Science and Innovation, under the project "SMPA-Advanced Parallel Multiobjective Sequencing: Practical and Theoretical Advances" with reference DPI2008-03511/DPI. The authors should also thank the IMPIVA-Institute for the Small and Medium Valencian Enterprise, for the project OSC with references IMIDIC/2008/137, IMIDIC/2009/198, and IMIDIC/2010/175.Ruiz García, R.; Andrés Romano, C. (2011). Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. International Journal of Advanced Manufacturing Technology. 57(5):777-794. https://doi.org/10.1007/S00170-011-3318-2S777794575Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. OMEGA Int J Manag Sci 27(2):219–239Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985–1032Balakrishnan N, Kanet JJ, Sridharan SV (1999) Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput Oper Res 26(2):127–141Biggs D, De Ville B, and Suen E (1991) A method of choosing multiway partitions for classification and decision trees. J Appl Stat 18(1):49–62Chen J-F (2006) Unrelated parallel machine scheduling with secondary resource constraints. Int J Adv Manuf Technol 26(3):285–292Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel machine scheduling research. Eur J Oper Res 47(3):271–292Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326Grigoriev E, Sviridenko M, Uetz M (2007) Unrelated parallel machine scheduling with resource dependent processing times. Math Program Ser A and B 110(1):209–228Guinet A (1991) Textile production systems: a succession of non-identical parallel processor shops. J Oper Res Soc 42(8):655–671Guinet A, Dussauchoy A (1993) Scheduling sequence dependent jobs on identical parallel machines to minimize completion time criteria. Int J Prod Res 31(7):1579–1594Horn WA (1973) Minimizing average flow time with parallel machines. Oper Res 21(3):846–847Kass GV (1980) An exploratory technique for investigating large quantities of categorical data. Appl Stat 29(2):119–127Kim DW, Kim KH, Jang W, Chen FF (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robot Comput-Integr Manuf 18(3–4):223–231Lam K, Xing W (1997) New trends in parallel machine scheduling. Int J Oper Prod Manage 17(3):326–338Lee YH, Pinedo M (1997) Scheduling jobs on parallel machines with sequence dependent setup times. Eur J Oper Res 100(3):464–474Marsh JD, Montgomery DC (1973) Optimal procedures for scheduling jobs with sequence-dependent changeover times on parallel processors. AIIE Technical Papers, pp 279–286Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia-Pac J Oper Res 18(2):193–242Morgan JA, Sonquist JN (1963) Problems in the analysis of survey data and a proposal. J Am Stat Assoc 58:415–434Ng CT, Edwin Cheng TC, Janiak A, Kovalyov MY (2005) Group scheduling with controllable setup and processing times: minimizing total weighted completion time. Ann Oper Res 133:163–174Nowicki E, Zdrzalka S (1990) A survey of results for sequencing problems with controllable processing times. Discrete Appl Math 26(2–3):271–287Pinedo M (2002) Scheduling: theory, algorithms, and systems, 2nd edn. Prentice Hall, Upper SaddleRabadi G, Moraga RJ, Al-Salem A (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. J Intell Manuf 17(1):85–97Radhakrishnan S, Ventura JA (2000) Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times. Int J Prod Res 38(10):2233–2252Ruiz R, Sivrikaya Şerifoğlu F, Urlings T (2008) Modeling realistic hybrid flexible flowshop scheduling problems. Comput Oper Res 35(4):1151–1175Sivrikaya-Serifoglu F, Ulusoy G (1999) Parallel machine scheduling with earliness and tardiness penalties. Comput Oper Res 26(8):773–787Webster ST (1997) The complexity of scheduling job families about a common due date. Oper Res Lett 20(2):65–74Weng MX, Lu J, Ren H (2001) Unrelated parallel machines scheduling with setup consideration and a total weighted completion time objective. Int J Prod Econ 70(3):215–226Yang W-H, Liao C-J (1999) Survey of scheduling research involving setup times. Int J Syst Sci 30(2):143–155Zhang F, Tang GC, Chen ZL (2001) A 3/2-approximation algorithm for parallel machine scheduling with controllable processing times. Oper Res Lett 29(1):41–47Zhu Z, Heady R (2000) Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Comput Ind Eng 38(2):297–30

Metodologías de formación de familias considerando la minimización de los tiempos de cambio de partida. Aplicación a la secuenciación en empresas cerámicas.

En este artículo se presentan los resultados finales de un estudio realizado sobre la creación defamilias de piezas en empresas del sector cerámico. En este sector, la elevada personalización de los productos demandados por los clientes, ha llevado a la

Aplicación de metodologías de Evaluación ergonómica de puestos de trabajo en la planta de carrocerías de Ford España S.A.

El análisis ergonómico presenta un creciente interés social, tanto por la incidencia que tiene sobre la salud de los trabajadores la falta de adecuación de los puestos de trabajo, como por los logros en la mejora de las condiciones de los mismos que se c

A Multi Ant Colony Optimization algorithm for a Mixed Car Assembly Line

This paper presents an ant colony optimization algorithm to sequence the mixed assembly lines considering the inventory and the replenishment of components. This is a NP-problem that cannot be solved to optimality by exact methods when the size of the problem growth. Groups of specialized ants are implemented to solve the different parts of the problem. This is intended to differentiate each part of the problem. Different types of pheromone structures are created to identify good car sequences, and good routes for the replenishment of components vehicle. The contribution of this paper is the collaborative approach of the ACO for the mixed assembly line and the replenishment of components and the jointly solution of the problem

A review of lot streaming in a flow shop environment with makespan criteria

[EN] Purpose: This paper reviews current literature and contributes a set of findings that capture the current state-of-the-art of the topic of lot streaming in a flow-shop. Design/methodology/approach: A literature review to capture, classify and summarize the main body of knowledge on lot streaming in a flow-shop with makespan criteria and, translate this into a form that is readily accessible to researchers and practitioners in the more mainstream production scheduling community. Findings: The existing knowledge base is somewhat fragmented. This is a relatively unexplored topic within mainstream operations management research and one which could provide rich opportunities for further exploration. Originality/value: This paper sets out to review current literature, from an advanced production scheduling perspective, and contributes a set of findings that capture the current state-of-the-art of this topic.This work has been carried out as part of the project “Programación de la Producción con Partición Ajustable de Lotes en entornos de Planificación mixta Pedido/Stock (PP-PAL-PPS)”, ref. GVA/2013/034 funded by Consellería de Educación, Cultura y Deportes de la Generalitat Valenciana.Gómez-Gasquet, P.; Segura Andrés, R.; Andrés Romano, C. (2013). A review of lot streaming in a flow shop environment with makespan criteria. Journal of Industrial Engineering and Management. 6(3):761-770. https://doi.org/10.3926/jiem.553S7617706

Collaborative goods distribution using the IRP model

[EN] This paper presents a study of the impact that collaboration in inventory has on distribution costs in a network of one supplier and multiple customers. Freight transport is widely studied due to its impact on logistics costs and service levels of enterprises. Looking for network configurations that improve some of these aspects will always be attractive to both academics and businesses. The collaborative distribution system was proposed using the IRP model, and it was compared with the scenarios in which the both supplier or customers optimize their inventory levels. For the IRP model solution a genetic algorithm was used, from which it was obtained a collaborative distribution system with a better performance than if the optimization is made independently.[ES] Este artículo presenta un estudio sobre el impacto que tiene la distribución colaborativa sobre los costos en la toma de las decisiones del inventario entre un proveedor y múltiples clientes, utilizando el modelo IRP para definir el sistema de distribución. El transporte de mercancías es una actividad ampliamente estudiada debido al impacto tiene en los costos logísticos y en el nivel de servicio de las empresas. Buscar redes de distribución que mejoren alguno de estos aspectos siempre será atractivo tanto para académicos como para las empresas. El resultado producido por el modelo IRP fue comparado con los escenarios en que el proveedor y los clientes optimizan sus niveles de inventario. Para la solución del modelo IRP se utilizó un algoritmo genético, a partir del cual se logro obtener un sistema de distribución en colaboración con un mejor desempeño que el correspondiente cuando la optimización se hace de forma independienteLos autores agradecen a la Universidad Nacional de Colombia por el apoyo al proyecto Optimización de la distribución de mercancías utilizando un modelo genético multiobjetivo de n proveedores con m clientes , código Hermes: 29314. Proyecto del cual se deriva este artículo de investigación.Arango Serna, MD.; Andrés Romano, C.; Zapata-Cortés, JA. (2016). Distribución colaborativa de mercancías utilizando el modelo IRP. DYNA. 83(196):204-212. https://doi.org/10.15446/dyna.v83n196.52492S2042128319

Diseño de una planta de fabricación de puertas y de sus operaciones

Es una caso para trabajar en clase en el contexto de un Aprendizaje Basado en un Proyecto.A la empresa puertas andreu por su colaboraciónMaheut, JPD.; Andrés Bello, J.; Andrés Romano, C.; García Sabater, JP. (2021). Diseño de una planta de fabricación de puertas y de sus operaciones. http://hdl.handle.net/10251/17727

Productivity from the Viewpoint of Lighting Companies in Valencia

This work is licensed under a Creative Commons Attribution 3.0 License.[EN] In recent years, the lighting industry has abandoned the use of work measurement and standards time tools and everything the use of such tools implies. Seemingly, their use was considered politically incorrect, perhaps because of the way companies approached these tools in the past. Nevertheless, these tools are still useful for planning and managing productivity and are becoming increasingly necessary. By investigating lighting companies in the region of Valencia (Spain-Europe), this study analyses perceptions about productivity, work measurement and standards time and to explores how companies use these tools. A survey gathering responses from interviews with 42 lighting companies (of the 230 entrerprises) was used to collect data on these companies’ perceptions. This is considered a representative sample, been the error margin of 14% whith a confidence level of 95%. Data from these interviews were then analysed. This article presents results of this analysis.Estelles Miguel, S.; Andrés Romano, C.; Albarracín Guillem, JM.; Palmer Gato, ME. (2015). Productivity from the Viewpoint of Lighting Companies in Valencia. Business and Management Research. 4(4):43-53. doi:10.5430/bmr.v4n4p43S43534