Analogies between flexible job shop scheduling and vehicle routing problems

Author

Kouki, Z. ; Chaar, B. Fayech ; Hammadi, S. ; Ksouri, M.

Author_Institution

Ecole Nat. des Ingenieurs de Tunis, Tunis

fYear

2007

fDate

2-4 Dec. 2007

Firstpage

880

Lastpage

884

Abstract

Different similarities and analogies have been investigated between the travel salesman problem (TSP) and the one machine sequencing problem, and common heuristics and bounds were also established for both of them. Recently, works focalized on possible analogies between variants of vehicle routing problems (VRP) and parallel machine scheduling problems in Beck, J-C, et al., (2003). In this paper, we present different analogies between two complex combinatorial optimization problems: the VRP and the flexible job shop scheduling problem (FJSSP) and use it for the calculation of new VRP lower bounds in Carlier, J. et al., (1988).

Keywords

job shop scheduling; transportation; travelling salesman problems; combinatorial optimization problems; flexible job shop scheduling; machine sequencing problem; parallel machine scheduling problems; travel salesman problem; vehicle routing problems; Costs; Industrial economics; Job shop scheduling; Los Angeles Council; Parallel machines; Routing; Scattering; Time factors; Vehicles; Flexible Job Shop Problem; Lower bounds; Vehicle Routing; analogies; similarities;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Engineering and Engineering Management, 2007 IEEE International Conference on

Conference_Location

Singapore

Print_ISBN

978-1-4244-1529-8

Electronic_ISBN

978-1-4244-1529-8

Type

conf

DOI

10.1109/IEEM.2007.4419317

Filename

4419317