## 2 The Relaxed Flexible Flow Shop Problem Model with Sequence-Dependent Setup Times (RFFSP) Methods
### Simulated Annealing Algorithm
* [PERSON] and [PERSON] (2017) [PERSON]; [PERSON] Home health care routing and scheduling: A review. _Comput. Oper. Res._**2017**, _77_, 86-95. * [PERSON] et al. (2017) [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] Healthedege: Task scheduling for edge computing with health emergency and human behavior consideration in smart homes. In Proceedings of the 2017 IEEE International Conference on Big Data (Big Data), Boston, MA, USA, 11-14 December 2017; pp. 1213-1222. * [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON] An Intelligent Irrigation Scheduling System Using Low-Cost Wireless Sensor Network Toward Sustainable and Precision Agriculture. _IEEE Access_**2020**, \(8\), 172756-172769. [CrossRef]
* [PERSON] and [PERSON] (2018) [PERSON]; [PERSON] Constraint programming for high school timetabling: A scheduling-based model with hot starts. In Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Delft, The Netherlands, 26-29 June 2018; Springer: Cham, Switzerland; pp. 135-152. * [PERSON] (1975) [PERSON] NP-complete scheduling problems. _J. Comput. Syst. Sci._**1975**, _10_, 384-393. [CrossRef]
* [PERSON] et al. (1976) [PERSON]; [PERSON]; [PERSON] The complexity of flowshop and job shop scheduling. _Math. Oper. Res._**1976**, \(1\), 117-129. [CrossRef]
* [PERSON] (2004) [PERSON] _Scheduling Algorithms_, 2 nd ed. ; Springer Science & Business Media: Berlin/Germany, Heidelberg, 2004. * [PERSON] and [PERSON] (2019) [PERSON]; [PERSON] The blocking flow shop scheduling problem: A comprehensive and conceptual review. _Expert Syst. Appl._**2019**, _137_, 130-156. [CrossRef]* [PERSON] (2016) [PERSON] A survey of scheduling problems with no-wait in process. _Eur. J. Oper. Res._**2016**, _255_, 665-686. [CrossRef]
* [PERSON] et al. (2013) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Scheduling in flow shop with sequence-dependent setup times: Literature review and analysis. _Int. J. Bus. Innov. Res._**2013**, \(7\), 466-486. [CrossRef]
* [PERSON] (1995) [PERSON] _Scheduling Theory, Algorithms, and Systems_, 3 rd ed. ; Prentice-Hall: Englewood Cliffs, NJ, USA, 1995. * [PERSON] and [PERSON] (1994) [PERSON]; [PERSON] Flexible Manufacturing Systems: An Overview. _Int. J. Oper. Prod. Manag._**1994**, _14_, 26-49. [CrossRef]
* [PERSON] et al. (2008) [PERSON]; [PERSON]; [PERSON]; [PERSON] Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. _Int. J. Adv. Manuf. Technol._**2008**, _37_, 354-370. [CrossRef]
* [PERSON] and [PERSON] (2017) [PERSON]; [PERSON]; [PERSON] A simultaneous planning of production and scheduling operations in flexible flow shops: Case study of tile industry. _Int. J. Adv. Manuf. Technol._**2017**, _88_, 2389-2403. [CrossRef]
* [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Iterated local search for steelmaking-refining-continuous casting scheduling problem. In Proceedings of the 2019 IEEE 15 th International Conference on Automation Science and Engineering (CASE), Vancouver, BC, Canada, 22-26 August 2019; pp. 567-572. * [PERSON] (2009) [PERSON] A Particle Swarm Optimization Using Random Keys for Flexible Flow Shop Scheduling Problems with Sequence Dependent Setup Times. Master's Thesis, Clemson University, Clemson, SC, USA, 2009. * [PERSON] (2015) [PERSON] Discrete Particle Swarm Optimization for Flexible Flow Line Scheduling. Master's Thesis, Clemson University, Clemson, SC, USA, 2015. * [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Scheduling Flexible Flow Shop in Labeling Companies to Minimize the Makespan. _Comput. Syst. Sci. Eng._**2022**, _40_, 17-36. [CrossRef]
* [PERSON] and [PERSON] (2007) [PERSON]; [PERSON] _A New Mathematical Model for Flexible Flow Lines with Blocking Processor and Sequence-Dependent Setup Time_; [PERSON], Ed. ; InTechOpen: London, UK, 2007; ISBN 978-3-902613-02-8.