|
A NEW LOWER BOUND FOR SCHEDULING OF FMS BASED ON AGV MATERIAL HANDLING
P. Lacomme*, A. Moukrim**, N. Tchernev***
* Université Blaise Pascal, Laboratoire d’Informatique, de Modélisation et d’Optimisation
des Systèmes (LIMOS), Campus Universitaire des Cézeaux, 63177 Aubière Cedex France,
Tel.: +33 4 73 40 75 85, E-mail: lacomme@isima.fr
** Université de Technologie de Compiègne, HeuDiaSyC, UMR CNRS 6599, BP 20529
60205 Compiègne cedex (France)
Tel.: +33 3 44 23 49 52, Fax: +33 3 44 23 44 77, E-mail: Aziz.Moukrim@hds.utc.fr
*** IUP de Management et Gestion des entreprise, Université d’Auvergne, Laboratoire
d’Informatique, de Modélisation et d’Optimisation des Systèmes (LIMOS), Campus
Universitaire des Cézeaux, 63177 Aubière Cedex France, Tel.: +33 4 73 40 77 71, E-mail:
tchernev@sp.isima.fr
This paper addresses the simultaneous job input sequencing and vehicle dispatching problems in flexible manufacturing systems (FMS) using a single device Automated Guided Vehicle System (AGVS). A Branch and Bound approach based on simulation has been previously developed. However, efficient easily computable lower bounds are still required to provide solutions for small and medium size problems. In this paper a new lower bound is proposed and benchmarks proved that this lower bound outperforms the lower bound previously published.
Keywords: Flexible manufacturing systems, Automated guided vehicle systems, scheduling algorithms, Branch and Bound, Lower Bound
Session slot T-We-A19: New Frontiers in Scheduling Models for Manufacturing/Area code 1c : Manufacturing Modelling, Management and Control
 |
