A weight-based algorithm to deal with due dates in flexible package production scheduling

Autores
Ibáñez, Francisco S.; Diaz, Daniel; Forradellas, Raymundo Quilez; Zavalla, Germán
Año de publicación
2004
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
This paper is an extension of a previous paper published in [2]. In this problem it is necessary to schedule several jobs that involve four process and for each one of them there is a group of machines available (of similar characteristics). Each activity is performed on just one machine. Besides, for our application, the scheduling must try to verify certain conditions. For each process (and consequently for all the activities that perform this process) there is a list of attributes. The problem is not only to assign each activity to a starting time and to a specific machine, but also to try to verify conditions that depend on the values of the attributes of the activities. Moreover, there are criteria to choose a particular machine An approach to solve this problem was presented first in [1]. As mentioned there, some due dates could not be fulfilled on time. An approach to decrease the quantity of due dates violations was presented in [2]. Roughly speaking, the algorithm presented in [1] is entirely dedicated to verify as many conditions as possible disregarding due dates violations. By the other hand, the algorithm shown in [2] was focussed to reduce the numer of due dates violations paying the price of decreasing the fulfillment of conditions. Roughl speaking, the first approach favour the company whereas the second one is more convenient for the customers. The present work includes an algorithm which allows to assign weights to set an appropriate trade-off between due date violations reduction and fulfillment of conditions
Eje: V - Workshop de agentes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Applications
scheduling problems
Constraints satisfaction
Production
Flexible packaging
ARTIFICIAL INTELLIGENCE
Intelligent agents
Scheduling
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/22545

id SEDICI_8b5cb49b22805175e6d5e1df33a4fa53
oai_identifier_str oai:sedici.unlp.edu.ar:10915/22545
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A weight-based algorithm to deal with due dates in flexible package production schedulingIbáñez, Francisco S.Diaz, DanielForradellas, Raymundo QuilezZavalla, GermánCiencias InformáticasApplicationsscheduling problemsConstraints satisfactionProductionFlexible packagingARTIFICIAL INTELLIGENCEIntelligent agentsSchedulingThis paper is an extension of a previous paper published in [2]. In this problem it is necessary to schedule several jobs that involve four process and for each one of them there is a group of machines available (of similar characteristics). Each activity is performed on just one machine. Besides, for our application, the scheduling must try to verify certain conditions. For each process (and consequently for all the activities that perform this process) there is a list of attributes. The problem is not only to assign each activity to a starting time and to a specific machine, but also to try to verify conditions that depend on the values of the attributes of the activities. Moreover, there are criteria to choose a particular machine An approach to solve this problem was presented first in [1]. As mentioned there, some due dates could not be fulfilled on time. An approach to decrease the quantity of due dates violations was presented in [2]. Roughly speaking, the algorithm presented in [1] is entirely dedicated to verify as many conditions as possible disregarding due dates violations. By the other hand, the algorithm shown in [2] was focussed to reduce the numer of due dates violations paying the price of decreasing the fulfillment of conditions. Roughl speaking, the first approach favour the company whereas the second one is more convenient for the customers. The present work includes an algorithm which allows to assign weights to set an appropriate trade-off between due date violations reduction and fulfillment of conditionsEje: V - Workshop de agentes y sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI)2004info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/22545enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:06Zoai:sedici.unlp.edu.ar:10915/22545Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:07.179SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A weight-based algorithm to deal with due dates in flexible package production scheduling
title A weight-based algorithm to deal with due dates in flexible package production scheduling
spellingShingle A weight-based algorithm to deal with due dates in flexible package production scheduling
Ibáñez, Francisco S.
Ciencias Informáticas
Applications
scheduling problems
Constraints satisfaction
Production
Flexible packaging
ARTIFICIAL INTELLIGENCE
Intelligent agents
Scheduling
title_short A weight-based algorithm to deal with due dates in flexible package production scheduling
title_full A weight-based algorithm to deal with due dates in flexible package production scheduling
title_fullStr A weight-based algorithm to deal with due dates in flexible package production scheduling
title_full_unstemmed A weight-based algorithm to deal with due dates in flexible package production scheduling
title_sort A weight-based algorithm to deal with due dates in flexible package production scheduling
dc.creator.none.fl_str_mv Ibáñez, Francisco S.
Diaz, Daniel
Forradellas, Raymundo Quilez
Zavalla, Germán
author Ibáñez, Francisco S.
author_facet Ibáñez, Francisco S.
Diaz, Daniel
Forradellas, Raymundo Quilez
Zavalla, Germán
author_role author
author2 Diaz, Daniel
Forradellas, Raymundo Quilez
Zavalla, Germán
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Applications
scheduling problems
Constraints satisfaction
Production
Flexible packaging
ARTIFICIAL INTELLIGENCE
Intelligent agents
Scheduling
topic Ciencias Informáticas
Applications
scheduling problems
Constraints satisfaction
Production
Flexible packaging
ARTIFICIAL INTELLIGENCE
Intelligent agents
Scheduling
dc.description.none.fl_txt_mv This paper is an extension of a previous paper published in [2]. In this problem it is necessary to schedule several jobs that involve four process and for each one of them there is a group of machines available (of similar characteristics). Each activity is performed on just one machine. Besides, for our application, the scheduling must try to verify certain conditions. For each process (and consequently for all the activities that perform this process) there is a list of attributes. The problem is not only to assign each activity to a starting time and to a specific machine, but also to try to verify conditions that depend on the values of the attributes of the activities. Moreover, there are criteria to choose a particular machine An approach to solve this problem was presented first in [1]. As mentioned there, some due dates could not be fulfilled on time. An approach to decrease the quantity of due dates violations was presented in [2]. Roughly speaking, the algorithm presented in [1] is entirely dedicated to verify as many conditions as possible disregarding due dates violations. By the other hand, the algorithm shown in [2] was focussed to reduce the numer of due dates violations paying the price of decreasing the fulfillment of conditions. Roughl speaking, the first approach favour the company whereas the second one is more convenient for the customers. The present work includes an algorithm which allows to assign weights to set an appropriate trade-off between due date violations reduction and fulfillment of conditions
Eje: V - Workshop de agentes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)
description This paper is an extension of a previous paper published in [2]. In this problem it is necessary to schedule several jobs that involve four process and for each one of them there is a group of machines available (of similar characteristics). Each activity is performed on just one machine. Besides, for our application, the scheduling must try to verify certain conditions. For each process (and consequently for all the activities that perform this process) there is a list of attributes. The problem is not only to assign each activity to a starting time and to a specific machine, but also to try to verify conditions that depend on the values of the attributes of the activities. Moreover, there are criteria to choose a particular machine An approach to solve this problem was presented first in [1]. As mentioned there, some due dates could not be fulfilled on time. An approach to decrease the quantity of due dates violations was presented in [2]. Roughly speaking, the algorithm presented in [1] is entirely dedicated to verify as many conditions as possible disregarding due dates violations. By the other hand, the algorithm shown in [2] was focussed to reduce the numer of due dates violations paying the price of decreasing the fulfillment of conditions. Roughl speaking, the first approach favour the company whereas the second one is more convenient for the customers. The present work includes an algorithm which allows to assign weights to set an appropriate trade-off between due date violations reduction and fulfillment of conditions
publishDate 2004
dc.date.none.fl_str_mv 2004
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/22545
url http://sedici.unlp.edu.ar/handle/10915/22545
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615809573322752
score 13.070432