• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Mathematical Model for Cyclic Scheduling ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Communication dans un congrès avec actes
Title :
A Mathematical Model for Cyclic Scheduling With Assembly Tasks and Work-In-Process Minimization
Author(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]
Conference title :
IEEE International Symposium on Assembly and Manufacturing, ISAM 2009
City :
Suwon
Country :
Corée du Sud
Start date of the conference :
2009-11-17
HAL domain(s) :
Informatique [cs]/Recherche opérationnelle [cs.RO]
English abstract : [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 ...
Show more >
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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-00755755/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-00755755/document
  • Open access
  • Access the document
Thumbnail
  • document
  • Open access
  • Access the document
Thumbnail
  • 2009_11_ISAM.pdf
  • Open access
  • Access the document
Université de Lille

Mentions légales
Accessibilité : non conforme
Université de Lille © 2017