Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines

This paper deals with a realistic cyclic scheduling problem in the food industry environment in which parallel machines are considered to process perishable jobs with given release dates, due dates and deadlines. Jobs are subject to post-production shelf life limitation and must be delivered to reta...

Descripción completa

Detalles Bibliográficos
Autores: Shirvani, Nargess, Ruiz García, Rubén, Shadrokh, Shahram
Tipo de recurso: artículo
Fecha de publicación:2014
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/60177
Acceso en línea:https://riunet.upv.es/handle/10251/60177
Access Level:acceso abierto
Palabra clave:Parallel machine scheduling
Perishable products
Partial weighted earliness/tardiness
Due date
Deadline
Release date
Iterated greedy algorithm
ESTADISTICA E INVESTIGACION OPERATIVA
id ES_8277e9a4e6e5a307201ea9d92beb12e1
oai_identifier_str oai:riunet.upv.es:10251/60177
network_acronym_str ES
network_name_str España
repository_id_str
spelling Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlinesShirvani, NargessRuiz García, RubénShadrokh, ShahramParallel machine schedulingPerishable productsPartial weighted earliness/tardinessDue dateDeadlineRelease dateIterated greedy algorithmESTADISTICA E INVESTIGACION OPERATIVAThis paper deals with a realistic cyclic scheduling problem in the food industry environment in which parallel machines are considered to process perishable jobs with given release dates, due dates and deadlines. Jobs are subject to post-production shelf life limitation and must be delivered to retailers during the corresponding time window bounded by due dates and deadlines. Both early and tardy jobs are penalized by partial weighted earliness/tardiness functions and the overall problem is to provide a cyclic schedule of minimum cost. A mixed integer programming model is proposed and a heuristic solution beside an iterated greedy algorithm is developed to generate good and feasible solutions for the problem. The proposed MIP, heuristic and iterated greedy produce a series of solutions covering a wide range of cases from slow optimal solutions to quick and approximated schedules.Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "RESULT - Realistic Extended Scheduling Using Light Techniques" with reference DPI2012-36243-C02-01 co-financed by the European Union and FEDER funds and by the Universitat Politecnica de Valencia, for the project MRPIV with reference PAID/2012/202.ElsevierUniversitat Politècnica de ValènciaMinisterio de Economía y CompetitividadRepositorio Institucional de la Universitat Politècnica de València Riunet20142014-10-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/60177reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengUniversitat Politècnica de València https://doi.org/10.13039/501100004233 PAID-2012-202Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 DPI2012-36243-C02-01 REALISTIC EXTENDED SCHEDULING USING LIGHT TECHNIQUESopen accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/601772026-06-13T07:49:27Z
dc.title.none.fl_str_mv Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
title Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
spellingShingle Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
Shirvani, Nargess
Parallel machine scheduling
Perishable products
Partial weighted earliness/tardiness
Due date
Deadline
Release date
Iterated greedy algorithm
ESTADISTICA E INVESTIGACION OPERATIVA
title_short Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
title_full Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
title_fullStr Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
title_full_unstemmed Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
title_sort Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
dc.creator.none.fl_str_mv Shirvani, Nargess
Ruiz García, Rubén
Shadrokh, Shahram
author Shirvani, Nargess
author_facet Shirvani, Nargess
Ruiz García, Rubén
Shadrokh, Shahram
author_role author
author2 Ruiz García, Rubén
Shadrokh, Shahram
author2_role author
author
dc.contributor.none.fl_str_mv Universitat Politècnica de València
Ministerio de Economía y Competitividad
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Parallel machine scheduling
Perishable products
Partial weighted earliness/tardiness
Due date
Deadline
Release date
Iterated greedy algorithm
ESTADISTICA E INVESTIGACION OPERATIVA
topic Parallel machine scheduling
Perishable products
Partial weighted earliness/tardiness
Due date
Deadline
Release date
Iterated greedy algorithm
ESTADISTICA E INVESTIGACION OPERATIVA
description This paper deals with a realistic cyclic scheduling problem in the food industry environment in which parallel machines are considered to process perishable jobs with given release dates, due dates and deadlines. Jobs are subject to post-production shelf life limitation and must be delivered to retailers during the corresponding time window bounded by due dates and deadlines. Both early and tardy jobs are penalized by partial weighted earliness/tardiness functions and the overall problem is to provide a cyclic schedule of minimum cost. A mixed integer programming model is proposed and a heuristic solution beside an iterated greedy algorithm is developed to generate good and feasible solutions for the problem. The proposed MIP, heuristic and iterated greedy produce a series of solutions covering a wide range of cases from slow optimal solutions to quick and approximated schedules.
publishDate 2014
dc.date.none.fl_str_mv 2014
2014-10-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/60177
url https://riunet.upv.es/handle/10251/60177
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Universitat Politècnica de València https://doi.org/10.13039/501100004233 PAID-2012-202
Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 DPI2012-36243-C02-01 REALISTIC EXTENDED SCHEDULING USING LIGHT TECHNIQUES
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869412048750772224
score 15,300719

Similares en LA Referencia