Robotic Cells: Configurations, Conjectures and Cycle Functions

Nadia Brauner () and Gerd Finke ()
Additional contact information
Nadia Brauner: Laboratoire Leibniz-IMAG
Gerd Finke: Laboratoire Leibniz-IMAG

A chapter in Operations Research Proceedings 2005, 2006, pp 721-726 from Springer

Abstract: Summary Robotic cells consist 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. 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 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.

Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-32539-0_113

Ordering information: This item can be ordered from
http://www.springer.com/9783540325390

DOI: 10.1007/3-540-32539-5_113

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().