Crane scheduling in coordination of production and transportation process

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper takes iron and steel making of the iron and steel enterprise for background, researches a crane scheduling problem in coordination of production and transportation process with transport vehicle capacity limitation consideration and transportation time consideration to minimize makespan. Two special cases are analyzed polynomially solvable and the general case is further demonstrated NP-hard. We propose a heuristic algorithm based on crane coordinated. Computational results are given to show the efficiency of the proposed algorithm compared with that of the staged algorithm from practical production.

Cite

CITATION STYLE

APA

Xie, X. (2016). Crane scheduling in coordination of production and transportation process. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9771, pp. 498–504). Springer Verlag. https://doi.org/10.1007/978-3-319-42291-6_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free