Ismail Hakki Cedimoglu

Learn More
This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem is NP-hard, satisfactory solutions have been obtained recently by tabu search. However, tabu search has a problem-speci®c and parametric structure. Therefore, in the paper, we focussed on the tabu search strategies and parameters such as initial solution,(More)
In recent years, there has been a growing amount of research on inductive learning and its applications to different domains. Out of this research a number of promising algorithms have surfaced. Inductive learning algorithms are domain independent. In principle, they can be used in any task involving classification or pattern recognition. In this paper a(More)
During the 1980s various approaches to batch-type manufacturing environments were implemented. The most popular of these were MaterialRequirements Planning (MRP), ('JfOUP Technology (GT) and Just-In-Time (JIT). However few successful implementations of any of these approaches were achieved [1] [2] [3]. This paper compares the various approaches of GT, MRP,(More)
  • 1