Efficient local search algorithms for job-shop scheduling problems Online publication date: Sun, 31-Jul-2016
by Pisut Pongchairerks
International Journal of Mathematics in Operational Research (IJMOR), Vol. 9, No. 2, 2016
Abstract: To solve job-shop scheduling problems, this paper develops four local search algorithms based on an input parameter of controlling the maximum allowable delay times of all machines. The use of this parameter in different values can change the size in numbers of the algorithm's solution space. The first proposed algorithm fixes the mentioned parameter's value and generates only forward schedules. The second algorithm reduces the parameter value iteratively and generates only forward schedules. The third algorithm reduces the parameter value iteratively; in addition, each operation-based permutation generated by this algorithm is transformed into both forward and backward schedules simultaneously. The fourth algorithm in the first-half iterations reduces the parameter value iteratively as well as generating only forward schedules; after that, this algorithm in the second-half iterations increases the parameter value iteratively as well as generating only backward schedules.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook