no / No / Scheduling systems based on traditional heuristic rules, which deal with the complexities of manufacturing systems, have been used by researchers for the past six decades. These heuristics rules prioritise all jobs that are waiting to be processed on a resource. In this paper, a novel Index Based Heuristic (IBH) solution for the Job Shop Scheduling Problem (JSSP) is presented with the objective of minimising the overall Makespan (Cmax). The JSSP is still a challenge to researchers and is far from being completely solved due to its combinatorial nature. JSSP suits the challenges of current manufacturing environments. The proposed IBH calculates the indices of candidate jobs and assigns the job with the lower index value to the available machine. To minimise the gap between jobs, a swap technique is introduced. The swap technique takes candidate jobs for a machine and swaps them without violating the precedence constraint. Several benchmark problems are solved from the literature to test the validity and effectiveness of the proposed heuristic. The results show that the proposed IBH based algorithm outperforms the traditional heuristics and is a valid methodology for JSSP optimization.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/9687 |
| Date | January 2013 |
| Creators | Maqsood, Shahid, Khan, M. Khurshid, Wood, Alastair S., Hussain, I. |
| Source Sets | Bradford Scholars |
| Detected Language | English |
| Type | Article, No full-text available in the repository |
Page generated in 0.0021 seconds