Part sequencing in three machine no-wait robotic cells (1998) [5 citations — 0 self]
Download:
|
|
by Alessandro Agnetis, Dario Pacciarelli
Operations Research Letters
http://www.inf.uniroma3.it/research/tech-rep/dia-37-98.ps
Add To MetaCart
Abstract:
A no--wait robotic cell is an automated flow shop in which a robot is used to move the parts from a machine to the next. Parts are not allowed to wait. We analyze the complexity of the part sequencing problem in a robotic cell with three machines, for different periodical patterns of robot moves, when the objective is productivity maximization. 2
Citations
| 7715 | Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 10 | Sequencing of parts and robot moves in a robotic cell – Sethi, Sriskandarajah, et al. - 1992 |
| 8 | Sequencing a one-state variable machine: A solvable case of the traveling salesman problem – Gilmore, Gomory - 1964 |
| 7 | Scheduling no-wait robotic cells with two and three machines – Agnetis - 2000 |
| 6 | Scheduling in robotic cells: classification, two and three machine cells – Hall, Kamoun, et al. - 1997 |
| 5 | Cyclic scheduling of identical parts in a robotic cell – Crama, Klundert - 1997 |
| 5 | The Three{Machine No{Wait Flow Shop Is NP{Complete – Rock - 1984 |
| 4 | A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling – Kats, Levner - 1997 |
| 3 | Scheduling in robotic cells: classi cation, two and three machine cells – Hall, Kamoun, et al. - 1997 |
| 3 | An improved algorithm for a cyclic robotic scheduling problem – Levner, Kats, et al. - 1997 |
