论文信息 - Part sequencing in three-machine no-wait robotic cells

Part sequencing in three-machine no-wait robotic cells

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.

Alessandro Agnetis | Dario Pacciarelli | D. Pacciarelli | A. Agnetis

[1] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[2] Vladimir Kats,et al. A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling , 1997, Oper. Res. Lett..

[3] Alessandro Agnetis,et al. Scheduling no-wait robotic cells with two and three machines , 2000, Eur. J. Oper. Res..

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Wieslaw Kubiak,et al. Sequencing of parts and robot moves in a robotic cell , 1989 .

[6] Yves Crama,et al. Cyclic Scheduling of Identical Parts in a Robotic Cell , 1997, Oper. Res..

[7] Eugene Levner,et al. An improved algorithm for a cyclic robotic scheduling problem , 1998 .

[8] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[9] Hans Röck,et al. The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[10] Vadim E. Levit,et al. An improved algorithm for cyclic flowshop scheduling in a robotic cell , 1997 .

[11] Chelliah Sriskandarajah,et al. Scheduling in Robotic Cells: Classification, Two and Three Machine Cells , 1997, Oper. Res..