Scheduling of coupled tasks and one-machine no-wait robotic cells

Brauner, Nadia; Finke, Gerd; Lehoux-Lebacque, Vassilissa; Potts, Chris N.; Whitehead, J. D.

doi:10.1016/j.cor.2007.10.003

Cited by 32 publications

(21 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This motivates Brauner et al (2009) to link the problem to a class of cyclic production scheduling problems, namely the one-machine no-wait robotic cell problem. They showed that minimizing the makespan for the single-machine identical coupled task scheduling problem is equivalent to maximizing the throughput rate in a one-machine no-wait robotic cell with the characteristics of having an input station (IN ), an output station (OU T ), and one machine (M ).…”

Section: Cyclic Schedulingmentioning

confidence: 99%

“…The instances set includes a total number of 250 instances with 20 to 500 jobs, where the task processing times are in the range of 10 and 100, and the delay durations in the range of 300 and 1,300. Ahr et al (2004); Li and Zhao (2007); Brauner et al (2009);Blazewicz et al (2012) adopted a similar approach, i.e., taking values from a discrete uniform interval. The instances in Sherali and Smith (2005) consist of 8 to 14 jobs, with aj taken from the normal distribution with a mean of 30 time units and a standard deviation of 5 time units, i.e., N (30, 5).…”

Section: Previous Instance Generation Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Coupled Task Scheduling With Exact Delays: Literature Review and Models

2018

View full text Add to dashboard Cite

The coupled task scheduling problem concerns scheduling a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. While research on the problem dates back to the 1980s, interests in the computational complexity of variants of the problem and solution methodologies have been evolving in the past few years. This motivates us to present an up-to-date and comprehensive literature review on the topic. Aiming to provide a complete road map for future research on the coupled task scheduling problem, we discuss all the relevant studies and potential research opportunities. In addition, we propose several sets of benchmark instances for the problem in various settings and provide a detailed evaluation of all the available models with a view to facilitating future research on the solution methods.

show abstract

Section: Cyclic Schedulingmentioning

confidence: 99%

Section: Previous Instance Generation Schemesmentioning

confidence: 99%

Coupled Task Scheduling With Exact Delays: Literature Review and Models

2018

View full text Add to dashboard Cite

show abstract

“…The SFR used in this automated cell was a part of the computer-integrated manufacturing system CIM-2000 Mechatronics manufactured by DEGEM Systems Company. A real-life radar scheduling problem, which is equivalent to single machine SFRC with no-wait pick up scenario, was studied in [17]. They proved a radar system can be simulated by a no-wait SFRC due to the fact that the first task is a wave transmission and the second task is reflected wave receiving without delay.…”

Section: Related Researchmentioning

confidence: 99%

Notes on Feasibility and Optimality Conditions of Small-Scale Multifunction Robotic Cell Scheduling Problems With Pickup Restrictions

Foumani

Gunawan

Smith‐Miles

et al. 2015

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

 Abstract-Optimization of robotic workcells is a growing concern in automated manufacturing systems. This study develops a methodology to maximize the production rate of a multi-function robot (MFR) operating within a rotationally arranged robotic cell. A MFR is able to perform additional special operations while in transit between transferring parts from adjacent processing stages. Considering the free-pick up scenario, the cycle time formulas are initially developed for small-scale cells where a 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 pick up 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.

show abstract

“…Regardless of swap ability, the majority of the results related to no-wait pickup category can be found in the research by Hall and Sriskandarajah (1996), Kats and Levner (1997), Levner et al (1997), Agnetis (2000), Agnetis and Pacciarelli (2000), Liu and Jiang (2005), Brauner et al (2009), Che and Chu (2009) and Che et al (2011). Therefore, the authors begin with fundamental definitions and concepts of a cyclic production in section 2.…”

Section: Introductionmentioning

confidence: 99%

Analysis of flexible robotic cells with improved pure cycle

Foumani

Jenab²

2013

International Journal of Computer Integrated Manufacturing

View full text Add to dashboard Cite

In this paper, we study the robotic cell scheduling problem with two machines and identical parts. It is assumed that there are flexibility in the robot type, the pickup category, and the cell layout. Also, the objective is to find the robot move sequence that minimizes the cycle time. One of the assumptions in the pertaining literature is that the occupied robot cannot load a part into an occupied machine. In contrast, the authors consider the robot has the swap ability, so the busy robot will be able to load concurrently a part into an occupied machine. It is also presumed that each part can entirely be processed by one computer numerical control (CNC) machine. A wide range of m-unit cycles named pure cycles has been well documented in the literature. However, a new class of the pure cycles which can produce less than m parts is defined in this study. We prove that the improved pure cycles always dominate pure cycles. The performance of these improved pure cycles for linearly and circularly configured robotic cells, based on free-pickup and no-wait categories are examined. Also, the number of machines which should be idle or busy to obtain an optimal cycle is determined. The novelty of this research is the introduction of the improved pure cycles that increase the long run average throughput rate and also reduce the number of machines.

show abstract

Scheduling of coupled tasks and one-machine no-wait robotic cells

Cited by 32 publications

References 8 publications

Coupled Task Scheduling With Exact Delays: Literature Review and Models

Coupled Task Scheduling With Exact Delays: Literature Review and Models

Notes on Feasibility and Optimality Conditions of Small-Scale Multifunction Robotic Cell Scheduling Problems With Pickup Restrictions

Analysis of flexible robotic cells with improved pure cycle

Contact Info

Product

Resources

About