Comparing Schedule Generation Schemes in Memetic Algorithms for the Job Shop Scheduling Problem with Sequence Dependent Setup Times
The Job Shop Scheduling Problem with Sequence Dependent Setup Times (SDJSS) is an extension of the Job Shop Scheduling Problem (JSS) that has interested to researchers during the last years. In this paper we confront the SDJSS problem by means of a memetic algorithm. We study two schedule generation schemas that are extensions of the well known G&T algorithm for the JSS. We report results from an experimental study showing that the proposed approaches produce similar results and that both of them are more efficient than other genetic algorithm proposed in the literature.
KeywordsGenetic Algorithm Local Search Setup Time Critical Path Memetic Algorithm
Unable to display preview. Download preview PDF.
- 1.Artigues, C., Lopez, P., P.D., A.: Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operational Research 138, 21–52 (2005)Google Scholar
- 5.Brucker, P.: Scheduling Algorithm, 4th edn. Springer, Heidelberg (2004)Google Scholar
- 10.González, M.A., Sierra, M.R., Vela, C.R., Varela, R.: Genetic Algorithms Hybridized with Greedy Algorithms and Local Search over the Spaces of Active and Semi-active Schedules. LNCS, Springer, Heidelberg (to appear, 2006)Google Scholar
- 11.González, M.A., Vela, C.R., Puente, J., Sierra, M.R., Varela, R.: Memetic Algorithms for the Job Shop Scheduling Problem with Sequence Dependent Setup Times. In: Proceedings of ECAI Workshop on Evolutionary Computation (to appear, 2006)Google Scholar
- 12.Mattfeld, D.C.: Evolutionary Search and the Job Shop. Investigations on Genetic Algorithms for Production Scheduling, November 1995. Springer, Heidelberg (1995)Google Scholar
- 15.Taillard, E.D.: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem. ORSA Journal of Computing 6, 108–117 (1993)Google Scholar