《2016 An integrated search heuristic for large-scale flexible job shop scheduling problems》.pdf

Computers Operations Research 40 (2013) 2864–2877 Contents lists available at SciVerse ScienceDirect Computers Operations Research journal homepage: /locate/caor An integrated search heuristic for large-scale flexible job shop scheduling problems Yuan Yuan, Hua Xu n State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, PR China a r t i c l e i n f o a b s t r a c t Available online 4 July 2013 The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling Keywords: problem (JSP), where each operation is allowed to be processed by any machine from a given set, rather Scheduling than one specified machine. In this paper, two algorithm modules, namely hybrid harmony search (HHS) Flexible job shop and large neighborhood search (LNS), are developed for the FJSP with makespan criterion. The HHS is an Harmony search evolutionary-based algorithm with the memetic paradigm, while the LNS is typical of constraint-based Large neighborhood search approaches. To form a stronger search mechanism, an integrated search heuristic, denoted as HHS/LNS, is Makespan proposed for the FJSP based on the two algorithms, which starts with the HHS, and then the solution is further improved by the LNS. Computational simu