Article

An Algorithm for Minimising Due Times Violations in Flexible Package Production Scheduling

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

This paper includes part of the strategies used to solve a scheduling problem developed for a company that produces flexible packaging, presented in a quite general form though. 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). This approach generates acceptable results for most of the cases in the real application. However, there were some cases in which the Algorithm did not work properly. The present work includes an Algorithm that improves the results generated in (2) for some special cases that arose in the real application.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

... In this paper, we present some ideas for acquiring such libraries, with little hand coded knowledge and unlabeled example cases. An example from the fl exible packaging domain, as described in (Ibañez et al., 2003) and (Ibañez et al., 2001), is given to illustrate the algorithm. ...
... Intuitively, whenever a set of new actions appears in an action sequence, this set of actions can be considered as a decomposition for some new (and previously unknown) non-primitive one that represents the observation. For example, consider the simple plan library presented in fi gure 1, which represents a simple plan library within the fl exible packaging domain (see Ibañez et al., 2003). Initially the system has an empty library that contains only the End Event. ...
Article
Full-text available
In the context of Computer Aided Process Planning (CAPP), feature recognition as well as the generation of manufacturing process plans are very diffi cult problems. The selection of the best manufacturing process plan usually involves not only measurable factors, but also idiosyncrasies, preferences and the know-how of both the company and the manufacturing engineer. In this scenario, mixed-initiative techniques such as plan recognition, where both human users and intelligent agents interact proactively, are useful tools for improving engineer’s productivity and quality of process plans. In order to be effective, these intelligent agents must learn autonomously this preferences and know-how. The problem of learning plan libraries for plan recognition has gained much importance in recent years, because of the dependence of the existing plan recognition techniques on them, and the diffi culty of the problem. Even when there is considerable work related to the plan recognition process itself, less work has been done on the generation of such plan libraries. In this paper, we present some preliminary ideas for a new approach for acquiring hierarchical plan libraries automatically, based only on a few simple assumptions and with little given knowledge.
Article
We have previously developed an adaptation of the simulated annealing for multi-objective combinatorial optimization (MOCO) problems to construct an approximation of the e$cient set of such problem. In order to deal with large-scale problems, we transform this approach to propose an interactive procedure. The method is tested on the multi-objective knapsack problem and the multi-objective assignment problem. Scope and purpose Meta-heuristics methods are intensively used with success to solve optimization problems and especially combinatorial problems (Pirlot. EJOR 1996;92:493}511). In the case of a single objective problem, such methods compute an approximation to the unique optimal solution. Recently, some meta-heuristics have been adapted to treat multi-objective problems. These methods construct an approximation of the set of all e$cient solutions. For large-scale multi-objective combinatorial problems, the number of e$cient solutions may become very large. In order to help a decision maker to make a choice between these solutions, an interactive procedure is developed in this paper.
Selected work for the International Journal of Production Economics (IJPE) topic "Operation Management
  • F Ibañez
  • D Diaz
  • R Forradellas
Ibañez F., Diaz D., Forradellas R.,"Scheduling for flexible package production", Proceedings IEPM'2001. Vol. 1, 385-400, Quebec, Canada, 2001. Selected work for the International Journal of Production Economics (IJPE) topic "Operation Management"
Scheduling for Flexible Package Production Minimising Due Times Violations
  • F Ibañez
  • D Diaz
  • R Forradellas
Ibañez F., Diaz D., Forradellas R.," Scheduling for Flexible Package Production Minimising Due Times Violations", Eighth International Workshop on Project Management and Scheduling, EURO Working Group, (PMS 2002), www.adeit.uv.es/pms2002/, Valencia, Spain, 2002.
Solving multi-objective production scheduling problems using metaheuristics
  • J Teghem
  • Ph
  • Fortemps
  • D Tuyttens
  • T Loukil
Teghem J., Ph. Fortemps, Tuyttens D., T. Loukil "Solving multi-objective production scheduling problems using metaheuristics", Proceedings IEPM'2001. Vol. 1, 385-400, 2001.