Loading...
Please wait, while we are loading the content...
Similar Documents
MULTIPLE DISPATCHING RULE BASED HEURISTIC FOR MULTI-OBJECTIVE SCHEDULING OF JOB SHOPS USING TABU SEARCH (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Baykasoğlu, Adil Özbakır, Lale Dereli, Türkay |
| Abstract | In this paper, a multiple dispatching rule based meta-heuristic solution approach for Job Shop Scheduling Problems (JSSP) is presented. The proposed algorithm makes use of Giffler & Thompson’s heuristic in deducting feasible schedules and Multiple Objective Tabu Search (MOTS) in generating optimal schedules. Several example problems are solved from the literature to present the effectiveness of the proposed algorithm. The results obtained from the computational study have shown that the proposed algorithm can be used as a new alternative solution technique for finding good solutions to this complex problem. |
| File Format | |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Giffler Thompson Proposed Algorithm Good Solution Multiple Dispatching Rule Computational Study Meta-heuristic Solution Approach New Alternative Solution Technique Job Shop Scheduling Problem Multiple Objective Tabu Search Several Example Problem Optimal Schedule Feasible Schedule Complex Problem |
| Content Type | Text |
