Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles

Philippe Lacomme, Mohand Larabi and Nikolay Tchernev

International Journal of Production Economics, 2013, vol. 143, issue 1, 24-34

Abstract: This paper deals with the problem of simultaneous scheduling of machines and identical automated guided vehicles (AGVs) which are well known difficult to solve problems. The studied problem can be modelled as a job shop where the jobs have to be transported between machines by AGVs. This article introduces a framework based on a disjunctive graph to modelize the joint scheduling problem and on a memetic algorithm for machines and AGVs scheduling. The objective is to minimize the makespan. Computational results are presented for a benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

Keywords: FMS; AGV; Job-shop; Scheduling; Memetic algorithm (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527310002525
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:143:y:2013:i:1:p:24-34

DOI: 10.1016/j.ijpe.2010.07.012

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().