References
- Amin-Naseri, Mohammad Reza, and Mohammad Ali Beheshti-Nia. 2009. “Hybrid Flow Shop Scheduling with Parallel Batching.” International Journal of Production Economics 117 (1): 185–196. http://www.sciencedirect.com/science/article/pii/S092552730800354X.
- Association of Rotational Moulders Australasia, Inc. 2016. “How It Works.” https://rotationalmoulding.com/rotomoulding/how-it-works/.
- Aurich, P., A. Nahhas, T. Reggelin, and J. Tolujew. 2016. “Simulation-Based Optimization for Solving a Hybrid Flow Shop Scheduling Problem.” 2016 Winter Simulation Conference (WSC), Dec 2809–2819.
- Bellanger, A., and A. Oulamara. 2009. “Scheduling Hybrid Flowshop with Parallel Batching Machines and Compatibilities.” Computers & Operations Research 36 (6): 1982–1992. http://www.sciencedirect.com/science/article/pii/S0305054808001202.
- Cave, Alex, Saeid Nahavandi, and Abbas Kouzani. 2002. “Schedule Evaluation: Simulation Optimization for Process Scheduling through Simulated Annealing.” Winter Simulation Conference Proceedings of the 34th Winter Simulation Conference: Exploring New Frontiers, Vol. 2, 01, 1909–1913.
- Corry, Paul, and Christian Bierwirth. 2019. “The Berth Allocation Problem with Channel Restrictions.” Transportation Science 53 (3): 708–727. doi:10.1287/trsc.2018.0865.
- Costa, Antonio, Fulvio Antonio Cappadonna, and Sergio Fichera. 2014. “A Novel Genetic Algorithm for the Hybrid Flow Shop Scheduling with Parallel Batching and Eligibility Constraints.” The International Journal of Advanced Manufacturing Technology 75 (5): 833–847. doi:10.1007/s00170-014-6195-7.
- CPLEX. 2016. “Cplex.MIPInfoCallback.GetBestObjValue Method.” https://www.ibm.com/support/knowledgecenter/SSSA5P_12.7.0/ilog.odms.cplex.help/refdotnetcplex/html/M_ILOG_CPLEX_Cplex_GetMIPRelativeGap.htm.
- Credence Research. 2018. “Rotomoulding Powder Market By Material Type (Polyethylene, PVC Plastisols, Polycarbonate, Nylon, Polypropylene, Fluoropolymers, Others), By Application (Transportation, Recreation, Industrial, Furniture, Decorative, Tanks, Medical, Others) -- Growth, Future Prospects & Competitive Analysis, 2018 2026.” Technical Report. Credence Research. https://www.credenceresearch.com/report/rotomoulding-powder-market.
- Dréo, Johann, Alain Pétrowski, and Eric Taillard. 2006. “Simulated Annealing.” In Simple practical suggestions for the beginners, 44–45. Berlin: Springer.
- Glover, Fred, and Manuel Laguna. 1998. Tabu Search. Springer US: Boston, MA. doi:10.1007/978-1-4613-0303-9_33, 2093–2229.
- Glover, Fred, Manuel Laguna, and Rafael Marti. 2007. “Principles of Tabu Search.” In Handbook of Approximation Algorithms and Metaheuristics, 23–1 – 23–12. New York, NY: Chapman and Hall/CRC.
- Gourgand, Michel, Nathalie Grangeon, and S Norre. 2000. “Meta-Heuristics for the Deterministic Hybrid Flow Shop Problem.” Journal Europeen des Systemes Automatises 34: 1107–1135.
- Gupta, Jatinder N. D. 1988. “Two-Stage, Hybrid Flowshop Scheduling Problem.” The Journal of the Operational Research Society 39 (4): 359–364. http://www.jstor.org/stable/2582115.
- Jenabi, M., S. M. T. Fatemi Ghomi, S. A. Torabi, and B. Karimi. 2007. “Two Hybrid Meta-heuristics for the Finite Horizon ELSP in Flexible Flow Lines with Unrelated Parallel Machines.” Applied Mathematics and Computation 186 (1): 230–245. http://www.sciencedirect.com/science/article/pii/S0096300306009337.
- Jungwattanakit, Jitti, Manop Reodecha, Paveena Chaovalitwongse, and Frank Werner. 2008. “Algorithms for Flexible Flow Shop Problems with Unrelated Parallel Machines, Setup Times, and Dual Criteria.” The International Journal of Advanced Manufacturing Technology 37 (3): 354–370. doi:10.1007/s00170-007-0977-0.
- Jungwattanakit, Jitti, Manop Reodecha, Paveena Chaovalitwongse, and Frank Werner. 2009. “A Comparison of Scheduling Algorithms for Flexible Flow Shop Problems with Unrelated Parallel Machines, Setup Times, and Dual Criteria.” Computers & Operations Research36 (2): 358–378. Scheduling for Modern Manufacturing, Logistics, and Supply Chains. http://www.sciencedirect.com/science/article/pii/S0305054807001992.
- Kim, Yeong-Dae, Hyeong-Gyu Lim, and Moon-Won Park. 1996. “Search Heuristics for a Flowshop Scheduling Problem in a Printed Circuit Board Assembly Process.” European Journal of Operational Research 91 (1): 124–143. http://www.sciencedirect.com/science/article/pii/0377221795001190.
- Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science220 (4598): 671–680. http://science.sciencemag.org/content/220/4598/671.
- Low, Chinyao. 2005. “Simulated Annealing Heuristic for Flow Shop Scheduling Problems with Unrelated Parallel Machines.” Computers & Operations Research 32 (8): 2013–2025. http://www.sciencedirect.com/science/article/pii/S0305054804000048.
- Luo, Hao, George Q. Huang, Yingfeng Zhang, Qingyun Dai, and Xin Chen. 2009. “Two-stage Hybrid Batching Flowshop Scheduling with Blocking and Machine Availability Constraints Using Genetic Algorithm.” Robotics and Computer-Integrated Manufacturing25 (6): 962–971. 18th International Conference on Flexible Automation and Intelligent Manufacturing. http://www.sciencedirect.com/science/article/pii/S073658450900057X.
- Mathirajan, M., and A. I. Sivakumar. 2006. “A Literature Review, Classification and Simple Meta-analysis on Scheduling of Batch Processors in Semiconductor.” The International Journal of Advanced Manufacturing Technology 29 (9): 990–1001. doi:10.1007/s00170-005-2585-1.
- Michalewicz, Zbigniew, and Marc Schoenauer. 1996. “Evolutionary Algorithms for Constrained Parameter Optimization Problems.” Evolutionary Computation 4 (1): 1–32. doi:10.1162/evco.1996.4.1.1.
- Mirsanei, H. S., M. Zandieh, M. J. Moayed, and M. R. Khabbazi. 2011. “A Simulated Annealing Algorithm Approach to Hybrid Flow Shop Scheduling with Sequence-dependent Setup Times.” Journal of Intelligent Manufacturing 22 (6): 965–978. doi:10.1007/s10845-009-0373-8.
- Ozdagoglu, Guzin, Sabri Erdem, and Latif Salum. 2013. “A Special Purpose Multi-criteria Heuristic Function for a Single Machine Scheduling Problem with Forward Dynamic Programming.” The International Journal of Advanced Manufacturing Technology68 (5): 1875–1886. doi:10.1007/s00170-013-4984-z.
- Ozturk, Onur, Marie-Laure Espinouse, Maria Di Mascolo, and Alexia Gouin. 2012. “Makespan Minimisation on Parallel Batch Processing Machines with Non-identical Job Sizes and Release Dates.” International Journal of Production Research 50 (20): 6022–6035. doi:10.1080/00207543.2011.641358.
- Pinedo, Michael L. 2012. Flow Shops and Flexible Flow Shops (Deterministic). Springer US: Boston, MA. doi:10.1007/978-1-4614-2361-4_6, 151–181.
- Ruiz, Rubén, and Concepción Maroto. 2006. “A Genetic Algorithm for Hybrid Flowshops with Sequence Dependent Setup Times and Machine Eligibility.” European Journal of Operational Research 169 (3): 781–800. http://www.sciencedirect.com/science/article/pii/S0377221705001451.
- Ruiz, Rubén, Funda Sivrikaya Şerifoğlu, and Thijs Urlings. 2008. “Modeling Realistic Hybrid Flexible Flowshop Scheduling Problems.” Computers & Operations Research 35 (4): 1151–1175. http://www.sciencedirect.com/science/article/pii/S0305054806001560.
- Rubén Ruiz, and Vázquez-Rodríguez, José Antonio. 2010. “The Hybrid Flow Shop Scheduling Problem.” European Journal of Operational Research 205 (1): 1–18. http://www.sciencedirect.com/science/article/pii/S0377221709006390.
- Shahvari, Omid, and Rasaratnam Logendran. 2016. “Hybrid Flow Shop Batching and Scheduling with a Bi-criteria Objective.” International Journal of Production Economics 179 239–258. http://www.sciencedirect.com/science/article/pii/S0925527316301104.
- Trindade, Renan Spencer, Olinto Csar Bassi de Arajo, Marcia Helena Costa Fampa, and Felipe Martins Mller. 2018. “Modelling and Symmetry Breaking in Scheduling Problems on Batch Processing Machines.” International Journal of Production Research 56 (22): 7031–7048. doi:10.1080/00207543.2018.1424371.
- Voß, Stefan, and Andreas Witt. 2007. “Hybrid Flow Shop Scheduling As a Multi-mode Multi-project Scheduling Problem with Batching Requirements: A Real-world Application.” International Journal of Production Economics 105 (2): 445–458. Scheduling in batch-processing industries and supply chains. http://www.sciencedirect.com/science/article/pii/S0925527305002409.
- Wang, Hong. 2005. “Flexible Flow Shop Scheduling: Optimum, Heuristics and Artificial Intelligence Solutions.” Expert Systems 22 (2): 78–85. https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1468-0394.2005.00297.x.
- Wu, Yi, Min Liu, and Cheng Wu. 2003. “A Genetic Algorithm for Solving Flow Shop Scheduling Problems with Parallel Machine and Special Procedure Constraints.” In Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693), Xi'an, Vol. 3, Nov, 1774–1779.
- Yaurima, Victor, Larisa Burtseva, and Andrei Tchernykh. 2009. “Hybrid Flowshop with Unrelated Machines, Sequence-dependent Setup Time, Availability Constraints and Limited Buffers.” Computers & Industrial Engineering 56 (4): 1452–1463. http://www.sciencedirect.com/science/article/pii/S0360835208001976.