| Cyclic scheduling in robotic cells: about Agnetis' conjecture for the classical case | |
Abstract/OtherAbstract
:
|
Robotic cells consists of a flow-shop with a circular layout and a single transporter, a robot, for the material handling. A single part is to be produced and the objective is to minimize the production rate. Different cell configurations have been studied, depending on the travel times of the empty robot: additive, constant or just triangular. A k-cycle is a production cycle where exactly k parts enter and leave the system. Ideally, one would like to determine, for a given instance, an optimal k-cycle. Consider the set S_K of all k-cycles up to size K where S_K contains, for every instance, an optimal solution and K is minimal. The cycle function K=K(config, m) depends on the cell configuration and the number of machines. Some of these functions are known and there are conjectures about others. We give new results invalidating in particular the so-called Agnetis' Conjecture for the classical robotic cell configuration. |
Authors
:
|
Brauner, Nadia, Finke, Gerd |
Contributors
:
|
- |
Publication Detail
:
|
Publisher : HAL - CCSD Type : - Format : - |
Date Detail
:
|
2006-06-28 |
Subject
:
|
Computer Science/Discrete Mathematics, Mathematics/Combinatorics, complexité, Recherche Operationnelle |
Coverage
:
|
- |
Relation
:
|
http://hal.inria.fr/docs/00/08/27/59/PDF/CLLeib120.pdf |
Source
:
|
- |
Copyright Information
:
|
- |
Other Details
:
|
Languages : EN |
Export Citation
:
|
APA/MLA Format Download EndNote Download BibTex |
Previous Document: The impact of emotional and cognitive changes after stroke : a longitudinal community-based study
Next Document: Metabolic interventions in acute myocardial infarction