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

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, f...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Ibáñez, Francisco S., Diaz, Daniel, Forradellas, Raymundo Quilez, Zavalla, Germán
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2004
Materias:
Ciencias Informáticas
Applications
scheduling problems
Constraints satisfaction
Production
Flexible packaging
ARTIFICIAL INTELLIGENCE
Intelligent agents
Scheduling
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22545
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22545
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Applications
scheduling problems
Constraints satisfaction
Production
Flexible packaging
ARTIFICIAL INTELLIGENCE
Intelligent agents
Scheduling
spellingShingle Ciencias Informáticas
Applications
scheduling problems
Constraints satisfaction
Production
Flexible packaging
ARTIFICIAL INTELLIGENCE
Intelligent agents
Scheduling
Ibáñez, Francisco S.
Diaz, Daniel
Forradellas, Raymundo Quilez
Zavalla, Germán
A weight-based algorithm to deal with due dates in flexible package production scheduling
topic_facet Ciencias Informáticas
Applications
scheduling problems
Constraints satisfaction
Production
Flexible packaging
ARTIFICIAL INTELLIGENCE
Intelligent agents
Scheduling
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
format Objeto de conferencia
Objeto de conferencia
author Ibáñez, Francisco S.
Diaz, Daniel
Forradellas, Raymundo Quilez
Zavalla, Germán
author_facet Ibáñez, Francisco S.
Diaz, Daniel
Forradellas, Raymundo Quilez
Zavalla, Germán
author_sort Ibáñez, Francisco S.
title A weight-based algorithm to deal with due dates in flexible package production 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 weight-based algorithm to deal with due dates in flexible package production scheduling
publishDate 2004
url http://sedici.unlp.edu.ar/handle/10915/22545
work_keys_str_mv AT ibanezfranciscos aweightbasedalgorithmtodealwithduedatesinflexiblepackageproductionscheduling
AT diazdaniel aweightbasedalgorithmtodealwithduedatesinflexiblepackageproductionscheduling
AT forradellasraymundoquilez aweightbasedalgorithmtodealwithduedatesinflexiblepackageproductionscheduling
AT zavallagerman aweightbasedalgorithmtodealwithduedatesinflexiblepackageproductionscheduling
AT ibanezfranciscos weightbasedalgorithmtodealwithduedatesinflexiblepackageproductionscheduling
AT diazdaniel weightbasedalgorithmtodealwithduedatesinflexiblepackageproductionscheduling
AT forradellasraymundoquilez weightbasedalgorithmtodealwithduedatesinflexiblepackageproductionscheduling
AT zavallagerman weightbasedalgorithmtodealwithduedatesinflexiblepackageproductionscheduling
bdutipo_str Repositorios
_version_ 1764820465995481090

Ejemplares similares