Abstract
This paper outlines a new efficient approach to solve combinatorial optimization problems making use of a hybrid search method. The approach integrates genetic algorithms (GA) and tabu search (TS) techniques to be incorporated into a generic architecture for a knowledge-based manufacturing system.
In this paper, a new method, called GA/TS, has been developed. The proposed method pursues a hybrid schedule generation strategy wherein it effectively combines knowledge acquired via genetics-based induction with tabu search methodology. We have used this hybrid approach to explore new strategies that may result in more powerful solution methods. Experiments on randomly generated problems of practical complexity, the notorious 10×10 instance of Muth&Thompson's benchmark and several instances of Lawrence [22] show that the hybrid scheduler strategy produces good results, better than previous efforts using genetics algorithms, and comparable to existing search-based methods [2, 4, 21].
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aarts, E., Laarhoven, P. van, Lenstra, J., Ulder, N.: A Computational Study of Local Search Algorithms for Job Shop Scheduling. ORSA Journal of Computing 6 (1994) 118–125
Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science 34 (1988) 391–401
Applegate, D.,Cook, W.: A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal of Computing 3 (1991) 149–156
Atabakhsh, H.: A Survey of Constraint Based Scheduling Systems Using an Artificial Intelligence Approach. Art. Int. in Engineering 6 (1991) 58–73
Balas, E.: Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm. Operational Research 17 (1969) 941–957
Bruns, R.: Direct Chromosome Representation and Advanced Genetic Operators for Production Scheduling. Proc. of the fifth Int. Conf. on Gen. Alg. (1993) 352–359
Carlier, J., Pinson, E.: An Algorithm for Solving the Job Shop Problem. Management Science 35 (1989) 164–176
Collinot, A., Le Pape, C.: Adapting the Behavior of a Job Shop Scheduling System. Decision Sup. Sys. 7 (1991) 341–353
Charalambous, O., Hindi. K.: A Review of Artificial Intelligence Based Job Shop Scheduling Systems. Information and Decision Technologies 17 (1991) 189–202
Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)
Dell'Amico, M., Trubian, M.: Applying Tabu Search to the Job Shop Scheduling Problem. Ann. of Op. Res. 41 (1993) 231–252
Dubois, D., Koning, J.: A Decision Engine Based on Rational Aggregation of Heuristic Knowledge. Decision Sup. Sys. 11 (1994) 337–361
Fang, H., Ross, P., Corne, D.: A Promising Genetic Algorithm Approach to Job Shop Scheduling, Rescheduling and Open Shop Scheduling Problems. Proc. of the fifth Int. Conf. on Gen. Alg. (1993) 375–382
Fox, M.: Constraint Directed Search: A Core Study of Job-Shop Scheduling. Pitman Publ. (1987)
Fox, B., McMahon, M.: Genetic Operators for Sequencing problems in Foundations of Genetic Algorithms. G. Rawlins Eds. (1991) 284–300
Giffler, J., Thompson, G.L.: Algorithms for Solving Production Scheduling Problems. Operational Research 8 (1969) 487–503
Glover, F.: Tabu search-Part I. ORSA Journal of Computing 1 (1989) 1909–206
Glover, F.: Tabu search-Part II. ORSA Journal of Computing 2 (1990) 4–32
Holsapple, C., Jacob, V., Pakath, R., Zaveri, J.: A Genetics Based Hybrid Scheduler for Generating Static Schedules in Flexible Manufacturing Contexts. IEEE Tran. on systems, man and cybernetic 23 (1993) 953–972
Husbands, P.: An Ecosystems Model for Integrated Production Planning. Int. J. CIM 6 (1993) 74–86
Laarhoven, P. van, Aarts, E., Lenstra, J.: Job Shop Scheduling by Simulated Annealing. Operations Research 40 (1992) 113–126
Lawrence, S.: Resource Constrained Project Scheduling: an Experimental Investigation of Heuristic Scheduling Techniques. Graduate School of Ind. Adm., Carnegie Mellon Un. (1984)
Lin, F., Kao, C., Hsu, C.: Applying the Genetic Approach to Simulated Annealing in Solving some NP-hard Problems. IEEE Tran. on systems, man and cybernetic 23 (1993) 1752–1767
Michalewicz, Z.: Genetic Algorithms and Data Structures = Evolution Programs. Springer-Verlag (1992)
Nakano, R.: Conventional Genetic Algorithm for Job-Shop Problems. Proc. of the forth Int. Conf. on Gen. Alg. (1991) 474–479
Rodammer, F.: A Recent Survey of Production Scheduling. IEEE Trans. on systems, man and cybernetic 18 (1988) 841–851
Taillard, E.: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem. ORSA J. of Comp. 6 (1994) 108–117
Uckun, S., Bagchi, S., Kawamara, K.: Managing Genetic Search in Job Shop Scheduling. IEEE Expert 8 (1993) 15–24
Wesley, J., Laguna, M.: A Tabu Search Experience in Production Scheduling. Ann. Oper. Res. 41 (1993) 141–156
Yamada, T., Nakano, R.: A Genetic Algorithm Applicable to Large-scale Job Shop Problems. Parallel Problem Solving from Nat., 2. Elsevier Sc. Pub. (1992) 281–290
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aizpuru, J.R.Z., Usunáriz, J.A. (1995). GA/TS: A hybrid approach for job shop scheduling in a production system. In: Pinto-Ferreira, C., Mamede, N.J. (eds) Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science, vol 990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60428-6_13
Download citation
DOI: https://doi.org/10.1007/3-540-60428-6_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60428-0
Online ISBN: 978-3-540-45595-0
eBook Packages: Springer Book Archive