1000 София, ул. “Раковски” 108, тел. 029876169, sai.bg.office@gmail.com, www.sai.bg

AN ALGORITHM FOR GENERATING A DISPERSED POPULATION OF FEASIBLE SCHEDULES FOR FLEXIBLE JOB SHOP PROBLEMS L. Kirilov, V. Guliashki Key Words Flexible job shop problems (FJSP); scheduling; heuristics; optimization Abstract The flexible job shop problems (FJSP) are an important class of scheduling problems and they have a significant practical value. Unfortunately it is not easy to solve job shop problems and in particular FJSPs because they are NP-hard problems. In this paper we propose a method for generating a set of feasible schedules for a given FJSP Article PDF Download article (PDF)