References
- Baikow, V. E. 2013. “Manufacture and Refining of Raw Cane Sugar.” In Manufacture and Refining of Raw Cane Sugar. Amsterdam, Netherlands: Elsevier.
- Bocanegra-Herrera, C. C., and C. J. Vidal. 2016. “Development of a Simulation Model as a Decision Support System for Sugarcane Supply [Desarrollo de un modelo de simulación como un sistema de soporte de decisiones para el abastecimiento de caña de azúcar].” DYNA (Colombia) 83 (198): 181–187.
- Brucker, P., and T. Kampmeyer. 2008. “A General Model for Cyclic Machine Scheduling Problems.” Discrete Applied Mathematics 156 (13): 2561–2572. doi: 10.1016/j.dam.2008.03.029
- de Armas, J., and M. Laguna. 2020. “Parallel Machine, Capacitated lot-Sizing and Scheduling for the Pipe-Insulation Industry.” International Journal of Production Research 58 (3): 800–817. doi: 10.1080/00207543.2019.1600763
- Dechampai, D., L. Tanwanichkul, K. Sethanan, and R. Pitakaso. 2017. “A Differential Evolution Algorithm for the Capacitated VRP with Flexibility of Mixing Pickup and Delivery Services and the Maximum Duration of a Route in Poultry Industry.” Journal of Intelligent Manufacturing 28 (6): 1357–1376. doi: 10.1007/s10845-015-1055-3
- Dolgui, A., A. V. Eremeev, M. Y. Kovalyov, and P. M. Kuznetsov. 2009. Multi-product lot-sizing and scheduling on unrelated parallel machines to minimize makespan. IFAC Proceedings Volumes (IFAC-PapersOnline) (Vol. 13). IFAC.
- Dolgui, A., A. V. Eremeev, M. Y. Kovalyov, and P. M. Kuznetsov. 2010. “Multi-product lot Sizing and Scheduling on Unrelated Parallel Machines.” IIE Transactions (Institute of Industrial Engineers) 42 (7): 514–524.
- Fox, K., and M. Korupolu. 2013. “Weighted Flowtime on Capacitated Machines.” In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, 129–143. Society for Industrial and Applied Mathematics. doi: 10.1137/1.9781611973105.10
- Garey, M. R., and D. S. Johnson. 1978. ““Strong” NP-Completeness Results: Motivation, Examples, and Implications.” Journal of the ACM 25 (3): 499–508. doi: 10.1145/322077.322090
- Hansen, P., and N. Mladenović. 1997. “Variable Neighborhood Search for the p-Median.” Location Science 5 (4): 207–226. doi: 10.1016/S0966-8349(98)00030-8
- Higgins, A., G. Antony, G. Sandell, I. Davies, D. Prestwidge, and B. Andrew. 2004. “A Framework for Integrating a Complex Harvesting and Transport System for Sugar Production.” Agricultural Systems 82 (2): 99–115. doi: 10.1016/j.agsy.2003.12.004
- Higgins, A., R. Muchow, A. Rudd, and A. Ford. 1998. “Optimising Harvest Date in Sugar Production: A Case Study for the Mossman Mill Region in Australia: I. Development of Operations Research Model and Solution.” Field Crops Research 57 (2): 153–162. doi: 10.1016/S0378-4290(97)00116-0
- Hu, X., J. S. Bao, and Y. Jin. 2010. “Minimising Makespan on Parallel Machines with Precedence Constraints and Machine Eligibility Restrictions.” International Journal of Production Research 48 (6): 1639–1651. doi: 10.1080/00207540802620779
- Iannoni, A. P., and R. Morabito. 2006. “A Discrete Simulation Analysis of a Logistics Supply System.” Transportation Research Part E: Logistics and Transportation Review 42 (3): 191–210. doi: 10.1016/j.tre.2004.10.002
- Jenkins, G. H. 2013. Introduction to Cane Sugar Technology. Australia: Elsevier.
- Kim, J. G., S. Song, and B. J. Jeong. 2019. “Minimising Total Tardiness for the Identical Parallel Machine Scheduling Problem with Splitting Jobs and Sequence-Dependent Setup Times.” International Journal of Production Research, 1–16. doi: 10.1080/00207543.2019.1637035
- Kocatürk, F., and Ö Özpeynirci. 2014. “Variable Neighborhood Search for the Pharmacy Duty Scheduling Problem.” Computers and Operations Research 51: 218–226. doi: 10.1016/j.cor.2014.06.001
- Lee, K., J. Y. T. Leung, and M. L. Pinedo. 2011. “Scheduling Jobs with Equal Processing Times Subject to Machine Eligibility Constraints.” Journal of Scheduling 14 (1): 27–38. doi: 10.1007/s10951-010-0190-0
- Lei, D. 2015. “Variable Neighborhood Search for two-Agent Flow Shop Scheduling Problem.” Computers and Industrial Engineering 80: 125–131. doi: 10.1016/j.cie.2014.11.024
- Leung, J. Y., and C. Li. 2008. “Scheduling with Processing set Restrictions: A Survey.” International Journal of Production Economics 116 (2): 251–262. doi: 10.1016/j.ijpe.2008.09.003
- Macedo, R., C. Alves, S. Hanafi, B. Jarboui, N. Mladenović, B. Ramos, and J. M. Valério De Carvalho. 2015. “Skewed General Variable Neighborhood Search for the Location Routing Scheduling Problem.” Computers and Operations Research 61: 143–152. doi: 10.1016/j.cor.2015.03.011
- Masoud, M., E. Kozan, and G. Kent. 2015. “Hybrid Metaheuristic Techniques for Optimising Sugarcane Rail Operations.” International Journal of Production Research 53 (9): 2569–2589. doi: 10.1080/00207543.2014.957870
- Moonsri, K., K. Sethanan, and C. Sangsawang. 2015. “Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility.” Chiang Mai University Journal of Natural Sciences 14 (4): 431–446. doi: 10.12982/cmujns.2015.0097
- Muchow, R., A. Higgins, A. Rudd, and A. Ford. 1998. “Optimising Harvest Date in Sugar Production: a Case Study for the Mossman Mill Region in Australia.” Field Crops Research 57 (3): 243–251. doi: 10.1016/S0378-4290(97)00135-4
- Nait Tahar, D., F. Yalaoui, C. Chu, and L. Amodeo. 2006. “A Linear Programming Approach for Identical Parallel Machine Scheduling with job Splitting and Sequence-Dependent Setup Times.” International Journal of Production Economics 99 (1–2): 63–73. doi: 10.1016/j.ijpe.2004.12.007
- Pei, J., N. Mladenović, D. Urošević, J. Brimberg, and X. Liu. 2020. “Solving the Traveling Repairman Problem with Profits: A Novel Variable Neighborhood Search Approach.” Information Sciences 507: 108–123. doi: 10.1016/j.ins.2019.08.017
- Pinedo, M. L. 1995. Scheduling: Theory, Algorithms, and Systems. 3rd ed. New York: Springer Science+Business Media, LLC. ISBN: 978-0-387-78934-7, e-ISBN: 978-0-387-78935-4. doi:10.1007/978-0-387-78935-4.
- Pitakaso, R., and K. Sethanan. 2019. “Adaptive Large Neighborhood Search for Scheduling Sugarcane Inbound Logistics Equipment and Machinery Under a Sharing Infield Resource System.” Computers and Electronics in Agriculture 158 (January): 313–325. doi: 10.1016/j.compag.2019.02.001
- Qiu, Y., L. Wang, X. Xu, X. Fang, and P. M. Pardalos. 2018. “A Variable Neighborhood Search Heuristic Algorithm for Production Routing Problems.” Applied Soft Computing Journal 66: 311–318. doi: 10.1016/j.asoc.2018.02.032
- Rabadi, G., R. Moraga, and A. Al-Salem. 2006. Heuristics for the unrelated parallel machine scheduling.
- Sethanan, K., W. Wisittipanich, N. Wisittipanit, K. Nitisiri, and K. Moonsri. 2019. “Integrating Scheduling with Optimal Sublot for Parallel Machine with job Splitting and Dependent Setup Times.” Computers & Industrial Engineering 137 (January 2017), doi:10.1016/j.cie.2019.106095.
- Shirvani, N., R. Ruiz, and S. Shadrokh. 2014. “Cyclic Scheduling of Perishable Products in Parallel Machine with Release Dates, due Dates and Deadlines.” International Journal of Production Economics 156: 1–12. doi: 10.1016/j.ijpe.2014.04.013
- Silva, C., and J. M. Magalhaes. 2006. “Heuristic lot Size Scheduling on Unrelated Parallel Machines with Applications in the Textile Industry.” Computers and Industrial Engineering 50 (1–2): 76–89. doi: 10.1016/j.cie.2006.01.001
- Smith, S. L., and F. Imeson. 2017. “GLNS: An Effective Large Neighborhood Search Heuristic for the Generalized Traveling Salesman Problem.” Computers and Operations Research 87: 1–19. doi: 10.1016/j.cor.2017.05.010
- Soltani, S. A., and B. Karimi. 2015. “Cyclic Hybrid Flow Shop Scheduling Problem with Limited Buffers and Machine Eligibility Constraints.” International Journal of Advanced Manufacturing Technology 76 (9–12): 1739–1755. doi: 10.1007/s00170-014-6343-0
- Storn, R., and K. Price. 1997. “Differential Evolution – A Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces.” Journal of Global Optimization 11 (4): 341–359. doi: 10.1023/A:1008202821328
- Thomas, B. W., and E. Manni. 2014. “Scheduled Penalty Variable Neighborhood Search.” Computers and Operations Research 52: 170–180. doi: 10.1016/j.cor.2013.12.004
- Tinnongwatthana, T. 2013. Sugar cane harvest and transportation. http://oldweb.ocsb.go.th/udon/Alltext/1.Article/01-ArticleP9.1.htm
- Wójcik, R. 2018. “Designing a No-Wait Cyclic Schedule for a Class of Concurrent Repetitive Production Processes.” IFAC-PapersOnLine 51 (11): 1305–1310. doi: 10.1016/j.ifacol.2018.08.352
- Yagiura, M., S. Iwasaki, T. Ibaraki, and F. Glover. 2004. “A Very Large-Scale Neighborhood Search Algorithm for the Multi-Resource Generalized Assignment Problem.” Discrete Optimization 1 (1): 87–98. doi: 10.1016/j.disopt.2004.03.005
- Zhang, L., Q. Deng, G. Gong, and W. Han. 2019. “A new Unrelated Parallel Machine Scheduling Problem with Tool Changes to Minimise the Total Energy Consumption.” International Journal of Production Research, 1–20.
- Zhang, J., X. Yao, and Y. Li. 2019. “Improved Evolutionary Algorithm for Parallel Batch Processing Machine Scheduling in Additive Manufacturing.” International Journal of Production Research, 1–20.
- Zhao, F., S. Qin, Y. Zhang, W. Ma, C. Zhang, and H. Song. 2019. “A Hybrid Biogeography-Based Optimization with Variable Neighborhood Search Mechanism for no-Wait Flow Shop Scheduling Problem.” Expert Systems with Applications 126: 321–339. doi: 10.1016/j.eswa.2019.02.023
- Zheng, F., Y. Sui, E. Zhang, Y. Xu, and M. Liu. 2019. “Two Parallel Identical Machines Scheduling to Minimise the Maximum Inter-Completion Time.” International Journal of Production Research, 1–15.