Scheduling and sequencing in four machines robotic cell: Application of genetic algorithm and enumeration techniques

Abdulkader, M.M.S.; El-Beheiry, Mohammed M.; Afia, Nahid; El-Kharbotly, Amin K.

doi:10.1016/j.asej.2012.11.002

Cited by 21 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abdulkader et al [25] developed a genetic algorithm (GA) to solve the scheduling problem while minimizing the cycle time. Zarandi and Fattahi [26] considered sequences of robot movements and part handling to minimize the total cycle time for a two-machine robotic cell scheduling problem with sequence-dependent setup times and different loading/unloading times for each part.…”

Section: Literature Surveymentioning

confidence: 99%

Optimal robotic cell scheduling with controllers using mathematically based timed Petri nets

Al-Ahmari

2016

Information Sciences

View full text Add to dashboard Cite

Section: Literature Surveymentioning

confidence: 99%

Optimal robotic cell scheduling with controllers using mathematically based timed Petri nets

Al-Ahmari

2016

Information Sciences

View full text Add to dashboard Cite

“…Those portions are summed up at each time period and the operator capacity is then checked. This model ignores the impact on the processing times 1 . In fact, if a portion of an operator is necessary for an operation, the real processing time of this operation will depend on what this operator is doing in parallel.…”

Section: Introductionmentioning

confidence: 99%

“…The scheduling details of those micro-operations (loading, unloading and controlling) would be a non-sense as most of operator interventions cannot be fully anticipated. Such scheduling problems are so far only studied when microoperations are limited to loading and unloading, done by robots, in the context of flow-shop models ( [1], [2]). …”

Section: Introductionmentioning

confidence: 99%

Solving the two identical parallel machine problem with a single operator

Baptiste

Rebaïne

Zouba

2015

2015 International Conference on Industrial Engineering and Systems Management (IESM)

View full text Add to dashboard Cite

We address in this paper the problem of scheduling a set of independent and non-preemptive jobs on two identical parallel machines with a single operator in order to minimize the makespan. The operator supervises the machines through a subset of a given set of modi operandi: the working modes. A working mode models the way the operator divides up his interventions between the machines. The processing times thus become variable as they now depend on the working mode being utilized. To build a schedule, we seek not only a partition of the jobs on the machines, but also a subset of working modes along with their duration. A pseudo-polynomial time algorithm is exhibited to generate an optimal solution within the free changing mode. Polynomial and and fully polynomial approximation scheme algorithms (respectively PTAS and FPTAS) are then derived.

show abstract

“…An alternative genetic algorithm for scheduling and sequencing robotic cells was presented by Abdulkader et al [8]. The setup for their scheduling problem was a four-machine blocking robotic cell where the robot supplies parts to all machines.…”

Section: Introductionmentioning

confidence: 99%

Advanced Cascaded Scheduling for Highly Autonomous Production Cells with Material Flow and Tool Lifetime Consideration using AGVs

Miller,

Schmitt,

Kaupp

et al. 2023

Journal of Machine Engineering

View full text Add to dashboard Cite

In today's manufacturing systems, especially in Industry 4.0, highly autonomous production cells play an important role. To reach this goal of autonomy, different technologies like industrial robots, machine tools, and automated guided vehicles (AGV) are deployed simultaneously which creates numerous challenges on various automation levels. One of those challenges regards the scheduling of all applied resources and their corresponding tasks. Combining data from a real production environment and Constraint Programming (CP-SAT), we provide a cascaded scheduling approach that plans production orders for machine tools to minimize makespan and tool changeover time while enabling the corresponding robot for robot-collaborated processes. Simultaneously, AGVs provide all production cells with the necessary material and tools. Hereby, magazine capacity for raw material as well as finished parts and tool service life are taken into account.

show abstract

Scheduling and sequencing in four machines robotic cell: Application of genetic algorithm and enumeration techniques

Cited by 21 publications

References 12 publications

Optimal robotic cell scheduling with controllers using mathematically based timed Petri nets

Optimal robotic cell scheduling with controllers using mathematically based timed Petri nets

Solving the two identical parallel machine problem with a single operator

Advanced Cascaded Scheduling for Highly Autonomous Production Cells with Material Flow and Tool Lifetime Consideration using AGVs

Contact Info

Product

Resources

About