Minimizing the total completion time on a multi-machine FMS using flower pollination algorithm

Reddy, N. Sivarami; Ramamurthy, D. V.; Lalitha, M. Padma; Rao, K. Prahlada

doi:10.1007/s00500-021-06411-y

Cited by 7 publications

(3 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With five jobs and thirteen operations, job-set number five was considered. Thus, the solution vector, which used job operation, MC, tool, and AGV-based coding, had 13 The created solutions for the initial population stuck to the precedence rules, making them viable solutions. All potential population replacement candidates were chosen for every generation.…”

Section: Limit and Bound Functionsmentioning

confidence: 99%

“…The schedule obtained from the scheduling of MCs and tools with a single copy of every tool type were not be implemented because job transfer times were not considered. To decrease the tooling cost and implement the schedule, Narapureddy et al [12], Sivarami Reddy et al [13], and Sivarami Reddy et al [14] addressed the scheduling of MCs, AGVs, and tools with a copy of every tool type considering the job transfer times using CSA, FPA, and SOSA, respectively. Tool transfer times were not considered.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimum Scheduling of a Multi-Machine Flexible Manufacturing System Considering Job and Tool Transfer Times without Tool Delay

Prayagi,

Mareddy,

Katta

et al. 2023

Mathematics

View full text Add to dashboard Cite

In order to minimize makespan (Cmax) without causing tool delay with the fewest copies of each tool type, this study investigates the concurrent scheduling of automated guided vehicles (AGVs), machines (MCs), tool transporter (TT), and tools in a multi-machine flexible manufacturing system (FMS). The tools are housed in a central tool magazine (CTM), accessible to and utilized by several machines. AGVs and the tool transporter (TT) move jobs and tools between machines. Since it involves allocating tool copies and AGVs to job operations, sequencing job operations on machines, and related trip operations, such as AGVs’ and TT’s empty trip and loaded trip times, this simultaneous scheduling problem is highly complicated. This issue is resolved using the symbiotic organisms search algorithm (SOSA), based on the symbiotic interaction strategies that organisms adapt to survive in the ecosystem. This study proposes a mixed nonlinear integer programming formulation to address this problem. Verification is performed using an industrial problem from a manufacturing organization. The results show that employing two copies for two tool types out of 22 tool kinds and one copy for the remaining tool types results in no tool delay, which causes a reduction in the Cmax as well as cost. The industries that can benefit directly from this study are consumer electronics manufacturers, original equipment manufacturers, automobile manufacturers, and textile machine producers. The results demonstrate that the SOSA provides promising results compared to the flower pollination algorithm (FPA).

show abstract

Section: Limit and Bound Functionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Optimum Scheduling of a Multi-Machine Flexible Manufacturing System Considering Job and Tool Transfer Times without Tool Delay

Prayagi,

Mareddy,

Katta

et al. 2023

Mathematics

View full text Add to dashboard Cite

show abstract

“…Ulusoy et al develop a genetic algorithm to schedule AGVs and machines simultaneously (Gündüz et al, 1997), reaching the lower bound in sixty percent of the test problems. Reddy et al propose a nonlinear mixed integer programming formulation to model the simultaneous scheduling problem of machines, AGVs and tools (Reddy et al,2021). Rahman et al propose a heuristic and metaheuristic-based integrated decision approach to solve robotic assembly line balancing problem and AGV scheduling problem simultaneously (Rahman et al, 2020).…”

Section: Introductionmentioning

confidence: 99%

A look-ahead AGV scheduling algorithm with processing sequence conflict-free for a no-buffer assembly line

WANG,

WU,

XING

et al. 2023

JAMDSM

View full text Add to dashboard Cite

As a critical part of modern industry, assembly line plays an important role in mass-producers because of its great advantages in production efficiency and construction cost. With the increasing demand for customized production, the fixed processing flow of assembly line is becoming more and more difficult to adapt to the changes. The introduction of automated guided vehicles (AGVs) as the material handling equipment improve the flexibility of assembly line, which also derives a complex AGV scheduling problem. In the recent years, because of the limitation in place, no-buffer assembly line appears in some plant, which derives a new problem, processing sequence conflicts (PSC). This paper builds a Petri net model to deal with the AGV scheduling problem and processing sequence conflicts in the no-buffer assembly line. A genetic algorithm based look-ahead scheduling algorithm (LASA) with processing sequence conflict-free is developed to minimize the total processing makespan in a no-buffer assembly line by introducing prospective tasks. Chain task strategy is integrated to further improve the performance of LASA in the case of AGVs deficiency. Two groups of simulation experiments are carried out to test the performance of the proposed algorithms in different scenarios. The results show the proposed algorithm has advantages in processing makespan, AGVs' efficiency and machines' efficiency. A robot experiment is carried out in a real no-buffer assembly line. The processing makespan of experiment is close to the theoretical lower bound.

show abstract

Hybrid Hyper-heuristic Algorithm for Integrated Production and Transportation Scheduling Problem in Distributed Permutation Flow Shop

Chen

Qian

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Minimizing the total completion time on a multi-machine FMS using flower pollination algorithm

Cited by 7 publications

References 37 publications

Optimum Scheduling of a Multi-Machine Flexible Manufacturing System Considering Job and Tool Transfer Times without Tool Delay

Optimum Scheduling of a Multi-Machine Flexible Manufacturing System Considering Job and Tool Transfer Times without Tool Delay

A look-ahead AGV scheduling algorithm with processing sequence conflict-free for a no-buffer assembly line

Hybrid Hyper-heuristic Algorithm for Integrated Production and Transportation Scheduling Problem in Distributed Permutation Flow Shop

Contact Info

Product

Resources

About