GA for JSP with Delivery Time
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.
KeywordsJob Shop Scheduling Problems genetic algorithm priority level
Unable to display preview. Download preview PDF.
- 1.Asano, M., Hatanaka, K., Ohta, H.: A Heuristic Algorithm for Job-Shop Scheduling to Minimize Total Weighted Tardiness. Journal of Japan Industrial Management Association 51(3), 245–253 (2003)Google Scholar
- 3.Abe, K., Ida, K.: GA for JSP with Delivery Time and Holding Cost. Intelligent Engineering Systems through Artificial Neural Networks 19 (2009)Google Scholar
- 4.Singer, M., Pinedo, M.: A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans. 30(2), 109–118 (1998)Google Scholar
- 6.Nakatani, T., Ohta, T.: A Heuristic Algorithm to Minimize Total Holding Cost of Completed and Processing Production Job-Shop Scheduling Subject to No Tardy Jobs. Journal of Japan Industrial Management Association 53(6), 483–490 (2003) (in Japanese)Google Scholar
- 7.Nakatani, T., Asano, M., Ohta, T.: An Optimal Algorithm for Solving Job-Shop Scheduling to Minimize Total Holding Cost of Completed and processing Products Subject to Non- Tardy Jobs. Journal of Japan Industrial Management Association 5(2), 95–103 (2003) (in Japanese)Google Scholar
- 8.Hirano, H.: Genetic Algorithms with Cluster Averaging Method for Solving Job-Shop Scheduling Problems. Journal of Japanese Society for Artificial Intelligence 10(5), 769–777 (1995) (in Japanese)Google Scholar
- 9.Watanabe, M., Ida, K., Gen, M.: Active Solution Space and Search on Job-shop Scheduling Problem. Journal of Japanese Electrotechnical Committee 124(8), 1626–1631 (2004) (in Japanese)Google Scholar
- 10.Gen, M., Cheng, R.: Genetic Algorithms and Engineering Optimization. John Wiley and Sons, New York (2000)Google Scholar
- 11.Ida, K., Osawa, A.: Proposal of Algorithm for Shortening Idle Time on Job-shop Scheduling Problem and Its Numerical Experiments. Journal of Japan Industrial Management Association (JIMA) 56(4), 294–301 (2005) (in Japanese)Google Scholar
- 12.Gen, M., Cheng, R., Lin, L.: Network Models and Optimization: Multiobjective Genetic Algorithm Approach. Springer, New York (2008)Google Scholar
- 13.Beasley, J.E.: OR-Library: distributing test programs by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)Google Scholar