A Job Shop Scheduling and Location of Battery Charging Storage for the Automated Guided Vehicles (AGVs)

Authors

  • Ali Sabaghian Department of Management, Naragh Branch, Islamic Azad University, Naragh, Iran
  • Mehdi Fazli Department of Industrial engineering, Iran University of Science and Technology, Tehran, Iran
Abstract:

When the Automated Guided Vehicles (AGVs) are transferring the parts from one machine to another in a job shop environment, it is possible that AGVsstopon their guidepaths since their batteries are discharged.Consequently, it is essential to establish at least one Battery Charging Storage (BCS) to replace full batteries with empty batteries for the stopped AGVs. Due to non-predictable routes for AGVs in the manufacturing systems, to find the best place toestablish the BCS can impact performance of the system. In this paper, anintegrated mathematical modelof job shop and AGV schedulingwith respect tothe location of a BCS is proposed. The proposed nonlinear model is transformed into a linear form to beefficiently solvedin GAMS software. Finally, several numerical examplesare presented to test the validity of the proposed mathematical model.The results show that the optimal cost and location of BCS can be obtained with respect to the number of AGVs, machines, parts, and other problem parameters. In addition, it is concluded that the increasing number of AGVs in a manufacturing systemcannot be always a suitable policy for reducing the cost because in such conditions.Further to that, the conflict of AGVs may increase leading tothe increase of the makespan. In other words, following the optimal point, increasing AGVs leads to the increase in costs.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

full text

Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling

Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins either from an empty solution (as in randomized restart) or from a solution that has been encountered during the search. A small number of these “elite” solutions is maintained during the search. We introduce the tech...

full text

Scheduling and routing of automated guided vehicles: A hybrid approach

We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). This problem consists in the simultaneous assignment, scheduling and conflict free routing of the vehicles. Our approach consists in a decomposition method where the master problem (scheduling) is modelled with constraint p...

full text

Job-shop scheduling in a body shop

We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...

full text

Scheduling of Electric Vehicle Charging Station for profit maximization of Vehicles and Station in Uncertainty

Abstract: In this paper, the electric vehicle (EV) charging station scheduling process is designed to maximize the profit of EVs owners and the station operator in two steps. First, a complete model is proposed to formulate the problem of charging and discharging EVs at charging stations in one-day-ahead 24-hours. The purpose of the program is to increase the profits of EVs owners charging stat...

full text

Optimal Scheduling of Battery Charging Station Serving Electric Vehicles Based on Battery Swapping

A battery charging station (BCS) is a charging facility that supplies electric energy for recharging electric vehicles’ depleted batteries (DBs). A BCS has a certain number of charging bays and maintains a dynamic inventory of fullycharged batteries (FBs). This paper studies a BCS scheduling (BCSS) problem whose target is to schedule the charging processes of the charging bays such that the cha...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 12  issue 2

pages  121- 129

publication date 2019-07-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023