# Graph-Based Modeling in Shop Scheduling Problems: Review and Extensions
## 9 Conclusions and Future Research Directions
The \"Dual-Ants Colony\": A novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. _Comput. Ind. Eng._**2017**, _106_, 236-255. [CrossRef]
* _[PERSON] et al. (2019)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Review on flexible job shop scheduling. _IET Collab. Intell. Manuf._**2019**, \(1\), 67-77. [CrossRef]* _[PERSON] et al. (2017)_ [PERSON]; [PERSON]; [PERSON] Flexible Job-Shop Scheduling Problem Based on Hybrid ACO Algorithm. _Int. J. Simul. Model._**2017**, _16_, 497-505. [CrossRef]
* _[PERSON] et al. (2012)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm. _Expert Syst. Appl._**2012**, _39_, 10016-10021. [CrossRef]
* _[PERSON] (1990)_ [PERSON]; [PERSON] Job-shop scheduling with multi-purpose machines. _Comput._**1990**, _45_, 369-375. [CrossRef]
* _[PERSON] (1997)_ [PERSON]; [PERSON] J. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. _Ann. Oper. Res._**1997**, _70_, 281-306. [CrossRef]
* _[PERSON] et al. (2018)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines. _J. Intell. Manuf._**2018**, _29_, 93-108. [CrossRef]
* _[PERSON] et al. (2011)_ [PERSON]; [PERSON]; [PERSON] FMS scheduling with knowledge based genetic algorithm approach. _Expert Syst. Appl._**2011**, _38_, 3161-3171. [CrossRef]
* _[PERSON] and [PERSON] (2004)_ [PERSON]; [PERSON] A comprehensive survey and future trend of simulation study on FMS scheduling. _J. Intell. Manuf._**2004**, _15_, 87-102. [CrossRef]
* _[PERSON] et al. (1996)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Scheduling in Flexible Manufacturing Systems. In _Scheduling Computer and Manufacturing Processes_; Springer Science and Business Media LLC: Berlin/Heidelberg, Germany, 1996; pp. 369-421. * _[PERSON] (2016)_ [PERSON]; [PERSON] A coloured Petri net-based hybrid heuristic search approach to simultaneous scheduling of machines and automated guided vehicles. _Int. J. Prod. Res._**2016**, _54_, 4773-4792. [CrossRef]
* _[PERSON] (2006)_ [PERSON]; [PERSON] Flowshop scheduling research after five decades. _Eur. J. Oper. Res._**2006**, _169_, 699-711. [CrossRef]
* _[PERSON] et al. (2004)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] Flow shop scheduling with multiple objective of minimizing makespan and total flow time. _Int. J. Adv. Manuf. Technol._**2004**, _25_, 1007-1012. [CrossRef]
* _[PERSON] et al. (2020)_ [PERSON]; [PERSON]; [PERSON] Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time. _J. Appl. Math._**2020**, _2020_, 1-11. [CrossRef]
* _[PERSON] et al. (2019)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] An efficient simulation optimization methodology to solve a multi-objective problem in unreliable unbalanced production lines. _Expert Syst. Appl._**2019**, _138_, 112836. [CrossRef]
* _[PERSON] (1992)_ [PERSON]; [PERSON] [PERSON] Manufacturing flow line systems: A review of models and analytical results. _Queueing Syst._**1992**, _12_, 3-94. [CrossRef]
* _[PERSON] et al. (1993)_ [PERSON]; [PERSON]; [PERSON]. Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem. _Manug. Sci._**1993**, _39_, 616-625. [CrossRef]
* _[PERSON] (2016)_ [PERSON]; [PERSON] An Estimation of Distribution Algorithm-Based Memetic Algorithm for the Distributed Assembly Permutation Flow-Shop Scheduling Problem. _IEEE Trans. Syst. Man Cybern. Syst._**2016**, _46_, 139-149. [CrossRef]
* _[PERSON] et al. (2020)_ [PERSON] [PERSON]; [PERSON]; [PERSON]; [PERSON] A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem. _Eur. J. Oper. Res._**2020**, _284_, 814-833. [CrossRef]
* _[PERSON] et al. (2017)_ [PERSON]; [PERSON]; [PERSON] A copula-based hybrid estimation of distribution algorithm for m-machine reentrant permutation flow-shop scheduling problem.