Abstract
A flexible manufacturing cell consisting of two machining centres, several automated storage/retrieval stations, and a mobile transporting robot is considered. The problem is to schedule jobs on machines so as to minimize the makespan, with the effects of transportation and set-ups to be taken into account. The problem is studied with the aid of a graph model, and an exact algorithm of cubic complexity is derived based on the Gilmore-Gomory algorithm for the travelling salesman problem.
| Original language | English |
|---|---|
| Pages (from-to) | 1447-1455 |
| Number of pages | 9 |
| Journal | Journal of the Operational Research Society |
| Volume | 46 |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 1995 |
| Externally published | Yes |
Keywords
- Flexible manufacturing systems
- Modelling
- Networks and graphs
- Scheduling
- Sequencing
Fingerprint
Dive into the research topics of 'Flowshop scheduling of robotic cells with job-dependent transportation and set-up effects'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver