A Mathematical Model for Cyclic Scheduling With Assembly Tasks and Work-In-Process Minimization

Amar M.A, Ben; Camus, Hubert; Korbaa, O.

Type de document :

Communication dans un congrès avec actes

Titre :

A Mathematical Model for Cyclic Scheduling With Assembly Tasks and Work-In-Process Minimization

Auteur(s) :

Amar M.A, Ben [Auteur]
Laboratoire d'Automatique, Génie Informatique et Signal [LAGIS]
Camus, Hubert [Auteur]
LAGIS-OSL
Korbaa, O. [Auteur]
Laboratoire d'Automatique, Génie Informatique et Signal [LAGIS]

Titre de la manifestation scientifique :

IEEE International Symposium on Assembly and Manufacturing, ISAM 2009

Ville :

Suwon

Pays :

Corée du Sud

Date de début de la manifestation scientifique :

2009-11-17

Discipline(s) HAL :

Informatique [cs]/Recherche opérationnelle [cs.RO]

Résumé en anglais : [en]

In this paper, we deal with the cyclic scheduling problem. More precisely, we consider the cyclic job shop with assembly tasks. Such a problem is made of several jobs, each job consisting of tasks (assembly/disassembly ...
Lire la suite >In this paper, we deal with the cyclic scheduling problem. More precisely, we consider the cyclic job shop with assembly tasks. Such a problem is made of several jobs, each job consisting of tasks (assembly/disassembly tasks and transformation tasks) being assigned to machines in a cyclic way. This kind of scheduling problem is well fitted to medium and large production demands, since the cyclic behavior can avoid the scheduling of the whole tasks by considering only a small temporal window (cycle). Thus, cyclic scheduling is a heuristic to solve the scheduling problems whose complexity is NP-hard in the general case. Many methods have been proposed to solve the cyclic scheduling problem. Among them, we focus on the mathematical programming approach. We will propose here a mathematical model for cyclic scheduling with assembly tasks and Work-In-Process minimization, and we illustrate this approach with an example from literature.Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Collections :