Good Production Cycles for Circular Robotic Cells

In this paper, we study cyclic production for throughput optimization in robotic flow-shops. We are focusing on simple production cycles. Robotic cells can have a linear or a circular layout: most classical results on linear cells cannot be extended to circular cells, making it difficult to quantify the potential gain brought by the latter configuration. Moreover, though the problem of finding the best one part production cycle is polynomial for linear cells, it is NP-hard for circular cells. We consider the special case of circular balanced cells. We first consider three basic production cycles, and focus on one which is specific to circular cells, for which we establish the expression of the cycle time. Then, we provide a counterexample to a classical conjecture still open in this configuration. Finally, based on computational experiments, we make a conjecture on the dominance of a family of cycle, which could lead to a polynomial algorithm for finding the best 1-cycle for circular balanced cells

Notes on feasibility and optimality conditions of small-scale multifunction robotic cell scheduling problems with pickup restrictions

Optimization of robotic workcells is a growing concern in automated manufacturing systems. This study develops a methodology to maximize the production rate of a multifunction robot (MFR) operating within a rotationally arranged robotic cell. An MFR is able to perform additional special operations while in transit between transferring parts from adjacent processing stages. Considering the free-pickup scenario, the cycle time formulas are initially developed for small-scale cells where an MFR interacts with either two or three machines. A methodology for finding the optimality regions of all possible permutations is presented. The results are then extended to the no-wait pickup scenario in which all parts must be processed from the input hopper to the output hopper, without any interruption either on or between machines. This analysis enables insightful evaluation of the productivity improvements of MFRs in real-life robotized workcells.Mehdi Foumani, Indra Gunawan, Kate Smith-Miles, M. Yousef Ibrahi

Scheduling in flexible robotic manufacturing cells

Cataloged from PDF version of article.The focus of this thesis is the scheduling problems arising in robotic cells which consist of a number of machines and a material handling robot. The machines used in such systems for metal cutting industries are highly flexible CNC machines. Although flexibility is the key term that affects the performance of these systems, the current literature ignores this. As a consequence, the problems considered in the current literature are either too limiting or the provided solutions are suboptimal for the flexible systems. This thesis analyzes different robotic cell configurations with different sources of flexibility. This study is the first one to consider operation allocation problems and controllable processing times as well as some design problems and bicriteria models in the context of robotic cell scheduling. Also, a new class of robot move cycles is defined, which is overlooked in the existing literature. Optimal solutions are provided for solvable cases, whereas complexity analyses and efficient heuristic algorithms are provided for the remaining problems.Gültekin, HakanPh.D

Novel approaches to cyclic job-shop problems with transportation

Scheduling problems can be found in almost any field of application in the real world. These problems may not only have different characteristics but they also imply more or less complex requirements. One specific class within this domain is the cyclic job-shop problem. It occurs in various areas reaching from industrial production planning down to the systems architecture of computers. With manufacturers in particular, one can find increasing demand for effective solution methods in order to tackle these scheduling problems efficiently. This thesis will deal with the Cyclic Job-Shop Problem with Blocking and Transportation. It arises in modern manufacturing companies, where the products move automatically between the different workstations, for instance. The problem itself is not new to the research community, but hardly any work has been done in solving it. Within this thesis we will try to close this gap and present some first approaches, discussing the structure of the problem and how it can be solved. As a result, we will provide three different solution methods, including an integer programming formulation, which is solved with a commercial solver, a branch and bound algorithm and a tabu search heuristic. All algorithms are tested on a range of data sets and compared with each other. Additionally, we have worked on a polynomial solvable subproblem, which has gained more interest in the literature. As a result, a new polynomial algorithm, that outperforms the existing ones in theory as well as in empirical tests (except for some special cases) is presented. This thesis concludes with a discussion about ideas of how to improve the presented methods and some other extensions to the investigated problem

A Quantum Optimization Case Study for a Transport Robot Scheduling Problem

We present a comprehensive case study comparing the performance of D-Waves' quantum-classical hybrid framework, Fujitsu's quantum-inspired digital annealer, and Gurobi's state-of-the-art classical solver in solving a transport robot scheduling problem. This problem originates from an industrially relevant real-world scenario. We provide three different models for our problem following different design philosophies. In our benchmark, we focus on the solution quality and end-to-end runtime of different model and solver combinations. We find promising results for the digital annealer and some opportunities for the hybrid quantum annealer in direct comparison with Gurobi. Our study provides insights into the workflow for solving an application-oriented optimization problem with different strategies, and can be useful for evaluating the strengths and weaknesses of different approaches