Abstract
This paper describes a job-shop scheduling problem (JSP) of processing product subject to no delay time job. It is one objective model of the minimum delivery delay time.In this paper, the effectiveness we the numerical experiments using a benchmark problem to improve the solution accuracy and decrease execution time by adding a method to generate gene and new approach, we introduce a search method for the algorithm shorter delivery times and further there to verify. © Springer International Publishing 2013.
Author supplied keywords
Cite
CITATION STYLE
Kikuchi, Y., Ida, K., & Gen, M. (2013). GA for JSP with delivery time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8210 LNCS, pp. 369–378). Springer Verlag. https://doi.org/10.1007/978-3-319-02750-0_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
