- -

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

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

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

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: ResourceSetups.pdf
Tamaño: 409.4Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir
[Cerrado]
Nombre: fulltext.pdf
Tamaño: 467.5Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Ruiz García, Rubén es_ES
dc.contributor.author Andrés Romano, Carlos es_ES
dc.date.accessioned 2014-02-25T14:58:29Z
dc.date.issued 2011-11
dc.identifier.issn 0268-3768
dc.identifier.uri http://hdl.handle.net/10251/35964
dc.description.abstract [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. es_ES
dc.description.sponsorship 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.
dc.language Inglés es_ES
dc.publisher Springer Verlag (Germany) es_ES
dc.relation.ispartof International Journal of Advanced Manufacturing Technology es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Resources es_ES
dc.subject Scheduling es_ES
dc.subject Sequence-dependent setups es_ES
dc.subject Total completion time es_ES
dc.subject Unrelated parallel machines es_ES
dc.subject Job sequences es_ES
dc.subject Linear combinations es_ES
dc.subject Mixed-integer programs es_ES
dc.subject Model performance es_ES
dc.subject Objective functions es_ES
dc.subject Production line es_ES
dc.subject Real problems es_ES
dc.subject Scheduling problem es_ES
dc.subject Sequence dependent setups es_ES
dc.subject Sequence-dependent setup time es_ES
dc.subject Set-up time es_ES
dc.subject Integer programming es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.subject.classification ORGANIZACION DE EMPRESAS es_ES
dc.title Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times es_ES
dc.type Artículo es_ES
dc.embargo.lift 10000-01-01
dc.embargo.terms forever es_ES
dc.identifier.doi 10.1007/S00170-011-3318-2
dc.relation.projectID info:eu-repo/grantAgreement/GVA//IMIDIC%2F2008%2F137/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//DPI2008-03511/ES/SMPA: SECUENCIACION MULTIOBJETIVO PARALELA AVANZADA: AVANCES TEORICOS Y PRACTICOS/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/Generalitat Valenciana//IMIDIC%2F2009%2F198/ES/OSC: Optimización integral de la cadena de suministro/ /
dc.relation.projectID info:eu-repo/grantAgreement/GVA//IMIDIC%2F2010%2F175/
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Organización de Empresas - Departament d'Organització d'Empreses es_ES
dc.description.bibliographicCitation 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-2 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1007/s00170-011-3318-2 es_ES
dc.description.upvformatpinicio 777 es_ES
dc.description.upvformatpfin 794 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 57 es_ES
dc.description.issue 5 es_ES
dc.relation.senia 214894
dc.contributor.funder Ministerio de Ciencia e Innovación
dc.contributor.funder Instituto de la Pequeña y Mediana Industria de la Generalitat Valenciana
dc.description.references Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. OMEGA Int J Manag Sci 27(2):219–239 es_ES
dc.description.references Allahverdi 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–1032 es_ES
dc.description.references Balakrishnan N, Kanet JJ, Sridharan SV (1999) Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput Oper Res 26(2):127–141 es_ES
dc.description.references Biggs 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–62 es_ES
dc.description.references Chen J-F (2006) Unrelated parallel machine scheduling with secondary resource constraints. Int J Adv Manuf Technol 26(3):285–292 es_ES
dc.description.references Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel machine scheduling research. Eur J Oper Res 47(3):271–292 es_ES
dc.description.references Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326 es_ES
dc.description.references Grigoriev E, Sviridenko M, Uetz M (2007) Unrelated parallel machine scheduling with resource dependent processing times. Math Program Ser A and B 110(1):209–228 es_ES
dc.description.references Guinet A (1991) Textile production systems: a succession of non-identical parallel processor shops. J Oper Res Soc 42(8):655–671 es_ES
dc.description.references Guinet A, Dussauchoy A (1993) Scheduling sequence dependent jobs on identical parallel machines to minimize completion time criteria. Int J Prod Res 31(7):1579–1594 es_ES
dc.description.references Horn WA (1973) Minimizing average flow time with parallel machines. Oper Res 21(3):846–847 es_ES
dc.description.references Kass GV (1980) An exploratory technique for investigating large quantities of categorical data. Appl Stat 29(2):119–127 es_ES
dc.description.references Kim 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–231 es_ES
dc.description.references Lam K, Xing W (1997) New trends in parallel machine scheduling. Int J Oper Prod Manage 17(3):326–338 es_ES
dc.description.references Lee YH, Pinedo M (1997) Scheduling jobs on parallel machines with sequence dependent setup times. Eur J Oper Res 100(3):464–474 es_ES
dc.description.references Marsh JD, Montgomery DC (1973) Optimal procedures for scheduling jobs with sequence-dependent changeover times on parallel processors. AIIE Technical Papers, pp 279–286 es_ES
dc.description.references Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia-Pac J Oper Res 18(2):193–242 es_ES
dc.description.references Morgan JA, Sonquist JN (1963) Problems in the analysis of survey data and a proposal. J Am Stat Assoc 58:415–434 es_ES
dc.description.references Ng 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–174 es_ES
dc.description.references Nowicki E, Zdrzalka S (1990) A survey of results for sequencing problems with controllable processing times. Discrete Appl Math 26(2–3):271–287 es_ES
dc.description.references Pinedo M (2002) Scheduling: theory, algorithms, and systems, 2nd edn. Prentice Hall, Upper Saddle es_ES
dc.description.references Rabadi G, Moraga RJ, Al-Salem A (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. J Intell Manuf 17(1):85–97 es_ES
dc.description.references Radhakrishnan 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–2252 es_ES
dc.description.references Ruiz R, Sivrikaya Şerifoğlu F, Urlings T (2008) Modeling realistic hybrid flexible flowshop scheduling problems. Comput Oper Res 35(4):1151–1175 es_ES
dc.description.references Sivrikaya-Serifoglu F, Ulusoy G (1999) Parallel machine scheduling with earliness and tardiness penalties. Comput Oper Res 26(8):773–787 es_ES
dc.description.references Webster ST (1997) The complexity of scheduling job families about a common due date. Oper Res Lett 20(2):65–74 es_ES
dc.description.references Weng 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–226 es_ES
dc.description.references Yang W-H, Liao C-J (1999) Survey of scheduling research involving setup times. Int J Syst Sci 30(2):143–155 es_ES
dc.description.references Zhang 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–47 es_ES
dc.description.references Zhu 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–305 es_ES


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

Mostrar el registro sencillo del ítem