Job-Shop Scheduling on Exhibition Logistics Based on Genetic Algorithms

Article Preview

Abstract:

The exhibition logistics, which generally deals with set-up, breakdown, transport, and storage to ensure that all specific exhibition requirements are met. It is very special from traditional logistics service that its transportation distant is very short and transportation cost can almost be ignored. To address the problems. a modal to optimize the total cost of exhibition logistics provider was proposed in this paper. Firstly the framwork of exhibition logistics was illustrated by a job-shop schedule modal. Secondly we used genetic algorithm (GA) to deal with problem of job shop scheduling. Finally the experiment result indicate that the proposed algorithm is feasible and effiective for this problem.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1019-1024

Citation:

Online since:

December 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Davis, Lawrence, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, (1991).

Google Scholar

[2] J. H. Holland, Adaptation in natural and artificial systems : an introductory analysis with applications to biology, control, and artificial intelligence. Ann Arbor: University of Michigan Press, (1975).

Google Scholar

[3] T. Yamada and R. Nakano. Genetic Algorithms for Job-shop Scheduling Problems. Proceedings of Modern Heuristic for Decision Support., UNICOM Seminar, 18-19 March (1997).

Google Scholar

[4] P. Mellor, A review of job shop scheduling[J], Operation Research Quarterly, 17(2), pp.161-171, (1966).

Google Scholar

[5] Bodin, L., B. Golden, A. Assad and M. Ball, The State of the Art in the Routing and Scheduling of Vehicles and Crews. Computers and Operations Research 10 (2), 63-211, (1983).

DOI: 10.1016/0305-0548(83)90030-8

Google Scholar

[6] I. Baker, Edward K. and Joanne R. Schaffer, Solution Improvement Heuristics for the Vehicle Routing Problem with Time Window Constraints. American Journal of Mathematical and Management Sciences (Special Issue) 6, 261-300, (1986).

DOI: 10.1080/01966324.1986.10737197

Google Scholar