 Efficient local search algorithms for job-shop scheduling problemsPisut Pongchairerks International Journal of Mathematics in Operational Research, 2016, vol. 9, issue 2, 258-277 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. Keywords: local search; job shop scheduling problem; JSP; parameterised active schedules; forward schedules; backward schedules; makespan; active schedules. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:9:y:2016:i:2:p:258-277 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.