QUT ePrints

A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

Liu, Shi Qiang & Kozan, Erhan (2011) A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem. Journal of the Operational Research Society, 63, pp. 168-182.

View at publisher

Abstract

In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version SBP algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: i) a topological-sequence algorithm is proposed to decompose the PMJSS problem into a set of single-machine scheduling (SMS) and/or parallel-machine scheduling (PMS) subproblems; ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; iii) the Jackson rule is extended to solve the PMS subproblem; iv) a Tabu Search metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems.

Impact and interest:

5 citations in Scopus
Search Google Scholar™
5 citations in Web of Science®

Citation countsare sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 48665
Item Type: Journal Article
Keywords: Scheduling, heuristics, parallel-machine, job-shop, shifting bottleneck procedure, metaheuristics
DOI: 10.1057/jors.2011.4
ISSN: 0160-5682
Divisions: Current > Schools > School of Mathematical Sciences
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Current > Research Centres > Science Research Centre
Deposited On: 17 Feb 2012 11:24
Last Modified: 07 Nov 2013 13:07

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page