Integrated simultaneous scheduling of machines, automated guided vehicles and tools in multi machine flexible manufacturing system using symbiotic organisms search algorithm

A new meta-heuristic gravitational search(GS) algorithm is proposed for simultaneous scheduling of machines, and two identical automated guided vehicles(AGVs) in a flexible manufacturing system(FMS). It minimize the makespan and completes the assigned jobs faster with possible savings of the resources. The adequacy of the algorithm is demonstrated by solving several problems and comparing with existing results.

Download Full-text

Simultaneous scheduling of machines and tools in a multi machine FMS with alternative routing using symbiotic organisms search algorithm

Journal of Engineering Research ◽

10.36909/jer.10653 ◽

2021 ◽

Author(s):

Dr.N.Sivarami Reddy ◽

◽

Dr. M.Padma Lalitha ◽

Dr. S.P. Pandey ◽

Dr. G.S. Venkatesh ◽

...

Keyword(s):

Flexible Manufacturing ◽

Search Algorithm ◽

Mixed Integer ◽

Symbiotic Interaction ◽

Symbiotic Organisms Search ◽

Tool Magazine ◽

Operations Sequencing ◽

Alternative Routing ◽

Symbiotic Organisms ◽

Simultaneous Scheduling

This paper deals with simultaneous scheduling of machines and tools with alternate machines in a multi machine flexible manufacturing system (FMS) to minimize makespan (MS). Only one copy of each type of tools is made available due to economic restrictions and the tools are stored in a central tool magazine (CTM) that shares with and serves for several machines. The problem is to select machines from alternate machines for job-operations, allocation of tools to job-operations and job-operations’ sequencing on machines for MS minimization. This paper presents a nonlinear mixed integer programming (MIP) formulation to model the combined scheduling of machines and tools with alternate machines and a symbiotic organisms search algorithm (SOSA) built on the symbiotic interaction strategies that organisms employ to continue to exist in the ecosystem for solving the scheduling of machines and tools with alternate machines. The results have been tabulated, analyzed. It is observed that there is a reduction in MS when the alternate machines are considered for job-operation.

Download Full-text

Multi-Objective Scheduling of Jobs, Automated Guided Vehicles and Automated Storage/Retrieval System in Flexible Manufacturing System

Journal for Manufacturing Science and Production ◽

10.1515/ijmsp.2008.9.1-2.61 ◽

2008 ◽

Vol 9 (1-2) ◽

pp. 61-80

Author(s):

J. Jerald, ◽

A. Gnanavel Babu, ◽

A. Noorul Haq,

Keyword(s):

Flexible Manufacturing ◽

Manufacturing System ◽

Flexible Manufacturing System ◽

Retrieval System ◽

Automated Guided Vehicles ◽

Multi Objective ◽

Automated Storage

Download Full-text

Simultaneous Scheduling Through Heuristic Algorithms

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i2.32.15385 ◽

2018 ◽

Vol 7 (2.32) ◽

pp. 125

Author(s):

M Nageswara Rao ◽

K Lokesh ◽

V Harish ◽

Ch Sai Bharath ◽

Y Venkatesh ◽

...

Keyword(s):

Flexible Manufacturing ◽

Manufacturing System ◽

Flexible Manufacturing System ◽

Heuristic Algorithms ◽

Information Gathering ◽

Work Environments ◽

Scheduling Problems ◽

Game Plan ◽

The Cost ◽

Simultaneous Scheduling

Flexible Manufacturing System (FMS) is a compli-cated system because of work environments, recu-peration frameworks, mechanized putting away, and material dealing with gadgets like robots and AGVs. In this paper, an endeavor is made by con-sidering both the machine and vehicle planning angles in FMS for minimization of the make trav-erse. Game plan is ensnared with the arrangement of incomplete assets to assignments in finished time. It is like Information-gathering process. It is related with the cost, operations, time and several objectives of the industry. In this work, RAPID ACCESS (RA) heuristic algorithm is adopted to solve the scheduling problems in FMS. Eighty, two problems and their existing solutions with different approaches are examined. The RA heuristic algo-rithm provides better solutions with less computa-tional time.

Download Full-text