# Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation
## 3 Fireworks Algorithm
### The Improved Fireworks Algorithm
(2017) [PERSON]; [PERSON]; [PERSON] An Investigation of Plug-In Electric Vehicle Charging Impact on Power Systems Scheduling and Energy Costs. _IEEE Trans. Power Syst._**2017**, _32_, 1902-1912. [CrossRef]
* [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON] Modeling Worker Competence to Advance Precast Production Scheduling Optimization. _J. Constr. Eng. Manag._**2018**, _144_, 04018098. [CrossRef]
* [PERSON] et al. (2016) [PERSON]; [PERSON]; [PERSON]; [PERSON] Automated Design of Production Scheduling Heuristics: A Review. _IEEE Trans. Evolut. Comput._**2016**, _20_, 110-124. [CrossRef]
* [PERSON] et al. (2010) [PERSON]; [PERSON]; [PERSON] Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. _Comput. Oper. Res._**2010**, _37_, 1439-1454. [CrossRef]
* [PERSON] and [PERSON] (2016) [PERSON]; [PERSON] Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration. _Comput. Oper. Res._**2016**, _65_, 76-82. [CrossRef]* _[PERSON] and [PERSON] (2017)_ _[PERSON]; [PERSON] Hybrid flow shop scheduling with assembly operations and key objectives: A novel neighborhood search. Appl. Soft Comput._ **2017**, _61_, 122-128. [CrossRef]
* _[PERSON] et al. (2017)_ _[PERSON]; [PERSON]; [PERSON] A new improved NHE heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ._ **2017**, _193_, 21-30. [CrossRef]
* _[PERSON] et al. (2017)_ _[PERSON]; [PERSON]; [PERSON] An efficient bicriteria algorithm for stable robotic flow shop scheduling. Eur. J. Oper. Res._ **2017**, _260_, 964-971. [CrossRef]
* _[PERSON] (2013)_ _[PERSON]; [PERSON] A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl. Soft Comput._ **2013**, _13_, 1459-1463. [CrossRef]
* _[PERSON] et al. (2018)_ _[PERSON]; [PERSON]; [PERSON] Short-term ice accretion forecasting model for transmission lines with modified time-series analysis by fireworks algorithm. IET Gener. Transm. Distrib._ **2018**, _12_, 1074-1080. [CrossRef]
* _[PERSON] et al. (2015)_ _[PERSON]; [PERSON]; [PERSON] A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int. J. Prod. Res._ **2015**, _53_, 1143-1167. [CrossRef]
* _[PERSON] et al. (2018)_ _[PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Mixed Integer Programming Formulations for Two-Machine Flow Shop Scheduling with an Availability Constraint. Arab. J. Sci. Eng._ **2018**, _43_, 777-788. [CrossRef]
* _[PERSON] (1965)_ _[PERSON] Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time--A Quick Method of Obtaining a Near Optimum. J. Oper. Res. Soc._ **1965**, _16_, 101-107. [CrossRef]
* _[PERSON] et al. (1983)_ _[PERSON]; [PERSON]; [PERSON] A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega_ **1983**, _11_, 91-95. [CrossRef]
* _[PERSON] (1971)_ _[PERSON]. A Functional Heuristic Algorithm for the Flowshop Scheduling Problem. J. Oper. Res. Soc._ **1971**, _22_, 39-47. [CrossRef]
* _[PERSON] (1954)_ _[PERSON] Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. Q._ **1954**, \(1\), 61-68. [CrossRef]
* _[PERSON] et al. (1970)_ _[PERSON]; [PERSON]; [PERSON] A heuristic algorithm for the n job, m machine sequencing problem. Manag. Sci._ **1970**, _16_, 630. [CrossRef]
* _[PERSON] (2007)_ _[PERSON]; [PERSON] On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega Int. J. Manag. Sci._ **2007**, _35_, 53-60. [CrossRef]
* _Semanco and Modrak (2012)_ _[PERSON]; [PERSON] A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem. Acta Polytech. Hung._ **2012**, \(9\), 177-190. * _[PERSON] et al. (2016)_ _[PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A Self-Organizing Multiobjective Evolutionary Algorithm. IEEE Trans. Evolut. Comput._ **2016**, _20_, 792-806.