Untitled

Sriskandarajah, Chelliah; Hall, Nicholas G.; Kamoun, Hichem

doi:10.1023/a:1018952722784

Cited by 54 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…s.t : (x; y) ∈ S (11) x ∈ D x , y ∈ D y (12) where, f is known as a real-valued function, S is called feasible set (commonly determined by add ups of limits), and D x and D y are the domain amounts of x and y, consecutively. This issue could be divided into limitations only including the x or variables of master problem and limits that integrate the x and y, variables of slave problem.…”

Section: Solving Methodology 41 Logic-based Benders' Decomposition (L...mentioning

confidence: 99%

“…Sriskandar [12] conducted a research project on the m-machine robotic cell in several part-types form. The authors categorized problems of part sequencing along with all cycles of one-unit robot move as: (i) independent of the sequence; (ii) with formulation capability as the problem of traveling salesman (TSP); (iii) having formulation capability as a TSP and unary NP-hard; and (iv) unary NP-hard, without a TSP structure.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell

et al. 2021

View full text Add to dashboard Cite

The present research addresses the single transportation robot used to alleviate problems of robotic cell scheduling of the machines. For the purpose of minimizing the make-span, a model of mixed-integer linear programming (MILP) has been suggested. Since the inefficiency exists in NP-hard, a decomposition algorithm posed by Bender was utilized to alleviate the problem in real life situations. The proposed algorithm can be regarded as an efficient attempt to apply optimality Bender’s cuts regarding the problem of parallel machine robotic cell scheduling in order to reach precise resolutions for medium and big sized examples. The numerical analyses have demonstrated the efficiency of the proposed solving approach.

show abstract

Section: Solving Methodology 41 Logic-based Benders' Decomposition (L...mentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Another direction for future research is towards finding optimal multiple part-type cycles in dual gripper constant travel-time cells with parallel machines. Studies on additive travel-time simple cells with single gripper robots have been published by Hall et al (1997, Kamoun et al (1999), andSriskandarajah et al (1998). For additive travel-time simple cells with dual gripper robots, given the demand ratios of the parts, an analysis for a subclass of cyclic solutions has been recently done by Sriskandarajah et al (2004).…”

Section: Conclusion and Recommendations For Future Studymentioning

confidence: 99%

Throughput Optimization in Constant Travel‐Time Dual Gripper Robotic Cells with Parallel Machines

Geismar

Dawande

Sriskandarajah

2006

Production and Operations Management

Self Cite

View full text Add to dashboard Cite

Constant travel‐time robotic cells with a single gripper robot and with one or more machines at each processing stage have been studied in the literature. By contrast, cells with a dual gripper robot, although more productive, have so far received scant attention, perhaps due to their inherent complexity. We consider the problem of scheduling operations in dual gripper robotic cells that produce identical parts. The objective is to find a cyclic sequence of robot moves that minimizes the long‐run average time to produce a part or, equivalently, maximizes the throughput. We provide a structural analysis of cells with one or more machines per processing stage to obtain first a lower bound on the throughput and, subsequently, an optimal solution under conditions that are common in practice. We illustrate our analysis on two cells implemented at a semiconductor equipment manufacturer and offer managerial insights for assessing the potential productivity gains from the use of dual gripper robots.

show abstract

“…Problemas de piezas distintas son analizados en McCormick et al (1989), Sriskandarajah y Sethi (1989), Sethi et al (1992), Logendran y Sriskandarajah (1996), Hall et al (1997), Hall et al (1998), Sriskandarajah et al (1998), Kamoun et al (1999, Lebacque y Brauner (2005), Kamalabadi et al (2007), Kamalabadi et al (2008), Batur et al (2012), Geismar et al (2012) y Abdulkader et al (2013).…”

Section: Capítulo 1: Marco Teóricounclassified

Programación de actividades en celdas robotizadas de tipo flowshop con buffers finitos y piezas distintas

Pendones

View full text Add to dashboard Cite

In this dissertation it is solved a problem of optimization in automated systems of production based on robotic cells where the time of completion of parts Cmax is minimized and where there are buffers between pairs of machines for the storage of the parts in process. The adopted approach provides great flexibility to the algorithms developed in this work, allowing them to adapt easily to the numerous configurations that can appear in real industrial environments. This is possible due to the fact that many of the parameters associated with the different characteristics that shape the definition of the problem can be defined by the user, permitting to solve: problems with equal or different parts; problems with different numbers of machines; problems with different numbers of parts; to assign individually different values of capacity of the buffers (admitting the null value as a possible value); different robot times defined for every operation of load of each part in every machine, for every operation of discharge of each part in every machine, and for every operation of transport (or travel) of each part between every pair of stations; and the possibility of assimilating the capacity of complete turn of the robot. Two exact procedures are practiced, encoded BB and BBP, and two inexact procedures based on the separation of the processes of determination of the sequence of parts and the sequence of movements of the robot, encoded SEP and SEPA. Additionally two procedures of annotation are practiced: a lower bound based on the times of the machines and a lower bound based on the times of the robot. En esta tesis se resuelve un problema de optimización en sistemas automatizados de producción basados en celdas robotizadas donde se minimiza el tiempo de terminación de las piezas Cmax y donde se tienen buffers entre pares de máquinas para el almacenamiento de las piezas en proceso. El enfoque adoptado provee de gran flexibilidad a los algoritmos desarrollados en este trabajo permitiendo que éstos fácilmente se puedan adaptar a las numerosas configuraciones que pueden presentarse en entornos industriales reales. Esto es posible a partir de que muchos de los parámetros asociados a las distintas características que conforman la definición del problema pueden ser definidos por el usuario, permitiendo resolver: problemas con piezas iguales o distintas; problemas con distintos números de máquinas; problemas con distintos números de piezas; asignar individualmente distintos valores de capacidad de los buffers (admitiéndose el valor nulo como un valor posible); distintos tiempos del robot definidos para cada operación de carga de cada pieza en cada máquina, para cada operación de descarga de cada pieza en cada máquina, y para cada operación de transporte (o viaje) de cada pieza entre cada par de estaciones; y la posibilidad de asimilar la capacidad de giro completo del robot. Se ensayan dos procedimientos exactos, codificados BB y BBP, y dos procedimientos no exactos basados en la separación de los procesos de determinación de la secuencia de piezas y la secuencia de movimientos del robot, codificados SEP y SEPA. Adicionalmente se ensayan dos procedimientos de acotación: una cota inferior basada en los tiempos de las máquinas y una cota inferior basada en los tiempos del robot.

show abstract

Untitled

Cited by 54 publications

References 27 publications

A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell

A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell

Throughput Optimization in Constant Travel‐Time Dual Gripper Robotic Cells with Parallel Machines

Programación de actividades en celdas robotizadas de tipo flowshop con buffers finitos y piezas distintas

Contact Info

Product

Resources

About