 A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup timesTamer F. Abdelmaguid Applied Mathematics and Computation, 2015, vol. 260, issue C, 188-203 Abstract: This paper addresses the makespan minimization problem in scheduling flexible job shops whenever there exist separable sequence-dependent setup times. An extension to the neighborhood search functions of Mastrolilli and Gambradella, developed for the flexible job shop scheduling problem (FJSP), is provided. It is shown that under certain conditions such an extension is viable. Accordingly, a randomized neighborhood search function is introduced, and its best search parameters are determined experimentally using modified FJSP benchmark instances. A tabu search approach utilizing the proposed neighborhood search function is then developed, and experimentations are conducted using the modified instances to benchmark it against a lower bound. Experimental results show that on average, the tabu search approach is capable of achieving optimality gaps of below 10% for instances with low average setup time to processing time ratios. Keywords: Flexible job shop scheduling; Sequence-dependent setup time; Neighborhood search; Tabu search; Algorithm design (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:eee:apmaco:v:260:y:2015:i:c:p:188-203 DOI: 10.1016/j.amc.2015.03.059 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
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.