Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function

References

• Allahverdi, A., and F. S. Al-Anzi. 2006. “A PSO and a Tabu Search Heuristics for Assembly Scheduling Problem of the Two-Stage Distributed Database Application.” Computers and Operations Research 33: 1056–1080. doi: 10.1016/j.cor.2004.09.002
   Web of Science ®Google Scholar
• Allahverdi, A., and F. S. Al-Anzi. 2006. “Evolutionary Heuristics and an Algorithm for the Two-Stage Assembly Scheduling Problem to Minimize Makespan with Setup Times.” International Journal of Production Research 44: 4713–4735. doi: 10.1080/00207540600621029
   Web of Science ®Google Scholar
• Allahverdi, A., and F. S. Al-Anzi. 2008. “The Two-Stage Assembly Flowshop Scheduling Problem with Bicriteria of Makespan and Mean Completion Time.” International Journal of Advanced Manufacturing Technology 37: 166–177. doi: 10.1007/s00170-007-0950-y
   Web of Science ®Google Scholar
• Allahverdi, A., and F. S. Al-Anzi. 2009. “The Two-Stage Assembly Scheduling Problem to Minimize Total Completion Time with Setup Times.” Computers & Operations Research 36: 2740–2747. doi: 10.1016/j.cor.2008.12.001
   Web of Science ®Google Scholar
• Allahverdi, A., and H. Aydilek. 2015. “The Two Stage Assembly Flowshop Scheduling Problem to Minimize Total Tardiness.” Journal of Intelligent Manufacturing 26: 225–237. doi: 10.1007/s10845-013-0775-5
   Web of Science ®Google Scholar
• Al-Anzi, F. S., and A. Allahverdi. 2006. “A Hybrid Tabu Search Heuristic for the Two-Stage Assembly Scheduling Problem.” International Journal of Operations Research 3: 109–119.
   Google Scholar
• Al-Anzi, F. S., and A. Allahverdi. 2007. “A Self-Adaptive Differential Evolution Heuristic for Two-Stage Assembly Scheduling Problem to Minimize Maximum Lateness with Setup Times.” European Journal of Operational Research 182: 80–94. doi: 10.1016/j.ejor.2006.09.011
   Web of Science ®Google Scholar
• Azzouz, A., M. Ennigrou, and L. Ben Said. 2018. “Scheduling Problems Under Learning Effects: Classification and Cartography.” International Journal of Production Research 56 (4): 1642–1661. doi: 10.1080/00207543.2017.1355576
   Web of Science ®Google Scholar
• Biskup, D. 1999. “Single-Machine Scheduling with Learning Considerations.” European Journal of Operational Research 115: 173–178. doi: 10.1016/S0377-2217(98)00246-X
   Web of Science ®Google Scholar
• Biskup, D. 2008. “A State-of-the-Art Review on Scheduling with Learning Effect.” European Journal of Operational Research 188: 315–329. doi: 10.1016/j.ejor.2007.05.040
   Web of Science ®Google Scholar
• Chen, P., C.-C. Wu, and W.-C. Lee. 2006. “A Bi-criteria Two-Machine Flowshop Scheduling Problem with a Learning Effect.” Journal of the Operational Research Society 57 (9): 1113–1125. doi: 10.1057/palgrave.jors.2602095
   Web of Science ®Google Scholar
• Essafi, I., Y. Matib, and S. Dauzere-Peres. 2008. “A Genetic Local Search Algorithm for Minimizing Total Weighted Tardiness in the Job-Shop Scheduling Problem.” Computers and Operations Research 35: 2599–2616. doi: 10.1016/j.cor.2006.12.019
   Web of Science ®Google Scholar
• French, S. 1982. Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop. Chichester: Ellis Horwood.
   Google Scholar
• Hardy, G. H., J. E. Littlewood, and G. Polya. 1967. Inequalities. London: Cambridge University Press.
   Google Scholar
• Hariri, A. M. A., and C. N. Potts. 1997. “A Branch and Bound Algorithm for the Two-Stage Assembly Scheduling Problem.” European Journal of Operational Research 103: 547–556. doi: 10.1016/S0377-2217(96)00312-8
   Web of Science ®Google Scholar
• Holland, J. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press.
   Google Scholar
• Hollander, M. D., A. Wolfe, and E. Chicken. 2014. Nonparametric Statistical Methods. 3rd ed. Hoboken, NJ: John Wiley & Sons.
   Google Scholar
• Isler, M. C., B. Toklu, and V. Celik. 2012. “Scheduling in a Two-Machine Flow-Shop for Earliness/Tardiness Under Learning Effect.” The International Journal of Advanced Manufacturing Technology 61 (9-12): 1129–1137. doi: 10.1007/s00170-011-3777-5
   Web of Science ®Google Scholar
• Jacobs, L. W., and M. J. Brusco. 1995. “A Local-Search Heuristic for Large Set-Covering Problems.” Naval Research Logistics 42 (7): 1129–1140. doi: 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M
   Web of Science ®Google Scholar
• Kuo, W.-H., and D.-L. Yang. 2006. “Minimizing the Total Completion Time in a Single-Machine Scheduling Problem with a Time-Dependent Learning Effect.” European Journal of Operational Research 174: 1184–1190. doi: 10.1016/j.ejor.2005.03.020
   Web of Science ®Google Scholar
• Kuolamas, C., and G. J. Kyparisis. 2007. “Single-Machine and Two-Machine Flowshop Scheduling with General Learning Functions.” European Journal of Operational Research 178: 402–407. doi: 10.1016/j.ejor.2006.01.030
   Web of Science ®Google Scholar
• Lee, C.-Y., T. C. E. Cheng, and B. M. T. Lin. 1993. “Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem.” Management Science 39: 616–625. doi: 10.1287/mnsc.39.5.616
   Web of Science ®Google Scholar
• Lee, W.-C., and C.-C. Wu. 2004. “Minimizing Total Completion Time in a Two-Machine Flowshop with a Learning Effect.” International Journal of Production Economics 88 (1): 85–93. doi: 10.1016/S0925-5273(03)00179-8
   Web of Science ®Google Scholar
• Maleki-Darounkolaei, A., M. Modiri, R. Tavakkoli-Moghaddam, and I. Seyyedi. 2012. “A Three-Stage Assembly Flow Shop Scheduling Problem with Blocking and Sequence-Dependent Set Up Times.” Journal of Industrial Engineering International 8 (26): 1–7.
   Google Scholar
• Maleki-Darounkolaei, A., and I. Seyyedi. 2013. “Taguchi Method for Three-Stage Assembly Flow Shop Scheduling Problem with Blocking and Sequence-Dependent Set Up Times.” Journal of Engineering Science and Technology 8 (5): 603–622.
   Google Scholar
• Marchiori, E., and A. Steenbeek. 2000. “An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling.” In Real-World Applications of Evolutionary Computing, edited by S. Cagnoni, R. Poli, G. D. Smith, D. Corne, M. Oates, E. Hart, P. L. Lanzi, E. J. Willem, Y. Li, B. Paechter, and T. C. Fogarty, EvoWork-shops 2000, pages Lecture Notes in Computer Science, Vol. 1803: 367–381. Berlin: Springer.
   Google Scholar
• Nawaz, M., E. E. Enscore Jr, and I. Ham. 1983. “A Heuristic Algorithm for the m-Machine n-Job Flow-Shop Sequencing Problem.” Omega 11 (1): 91–95. doi: 10.1016/0305-0483(83)90088-9
   Web of Science ®Google Scholar
• Pinedo, M. 2008. Scheduling: Theory, Algorithms and Systems, third version. Upper Saddle River, NJ: Prentice-Hall.
   Google Scholar
• Potts, C. N., S. V. Sevast’janov, V. A. Strusevich, L. N. Van Wassenhove, and C. M. Zwaneveld. 1995. “The Two-Stage Assembly Scheduling Problem: Complexity and Approximation.” Operations Research 43: 346–355. doi: 10.1287/opre.43.2.346
   Web of Science ®Google Scholar
• Ribas, I., R. Companys, and X. Tort-Martorell. 2011. “An Iterated Greedy Algorithm for the Flowshop Scheduling Problem with Blocking.” Omega 39 (3): 293–301. doi: 10.1016/j.omega.2010.07.007
   Web of Science ®Google Scholar
• Roy, S. K., and P. Mula. 2016. “Solving Matrix Game with Rough Payoffs Using Genetic Algorithm.” Operational Research 16 (1): 117–130. doi: 10.1007/s12351-015-0189-6
   Web of Science ®Google Scholar
• Ruiz, R., and T. Stutzle. 2008. “An Iterated Greedy Heuristic for the Sequence Dependent Setup Times Flowshop Problem with Makespan and Weighted Tardiness Objectives.” European Journal of Operational Research 187 (3): 1143–1159. doi: 10.1016/j.ejor.2006.07.029
   Web of Science ®Google Scholar
• Solano-Charris, E. L., J. R. Montoya-Torres, and C. D. Paternina-Arboleda. 2011. “Ant Colony Optimization Algorithm for a Bi-criteria 2-Stage Hybrid Flowshop Scheduling Problem.” Journal of Intelligent Manufacturing 22: 815–822. doi: 10.1007/s10845-009-0370-y
   Web of Science ®Google Scholar
• 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): 351–359. doi: 10.1023/A:1008202821328
   Web of Science ®Google Scholar
• Sung, C. S., and H. A. Kim. 2008. “A Two-Stage Multiple-Machine Assembly Scheduling Problem for Minimizing Sum of Completion Times.” International Journal of Production Economics 113: 1038–1048. doi: 10.1016/j.ijpe.2007.12.007
   Web of Science ®Google Scholar
• Torabzadeh, E., and M. Zandieh. 2010. “Cloud Theory-Based Simulated Annealing Approach for Scheduling in the Two-Stage Assembly Flowshop.” Advances in Engineering Software 41: 1238–1243. doi: 10.1016/j.advengsoft.2010.06.004
   Web of Science ®Google Scholar
• Tozkapan, A., O. Kirca, and C. S. Chung. 2003. “A Branch and Bound Algorithm to Minimize the Total Weighted Flowtime for the Two-Stage Assembly Scheduling Problem.” Computers and Operations Research 30: 309–320. doi: 10.1016/S0305-0548(01)00098-3
   Web of Science ®Google Scholar
• Wang, D. J., F. Liu, Y. Z. Wang, and Y. Yin. 2015. “A Knowledge-Based Evolutionary Proactive Scheduling Approach in the Presence of Machine Breakdown and Deterioration Effect.” Knowledge-Based Systems 90: 70–80. doi: 10.1016/j.knosys.2015.09.032
   Web of Science ®Google Scholar
• Wang, D. J., F. Liu, and Y. Yin. 2017. “A Multi-objective Evolutionary Algorithm Guided by Directed Search for Dynamic Scheduling.” Computers & Operations Research 79: 279–290. doi: 10.1016/j.cor.2016.04.024
   Web of Science ®Google Scholar
• Wang, D. J., H. Qiu, C.-C. Wu, W.-C. Lin, K. Lai, and S.-R. Cheng. 2019. “Dominance Rule and Opposition Based Particle Swarm Optimization for Two-Stage Assembly Scheduling with Time Cumulated Learning Effect.” Soft Computing 23 (19): 9617–9628. doi: 10.1007/s00500-018-3525-y
   Web of Science ®Google Scholar
• Wang, J.-B., X.-Y. Wang, L.-H. Sun, and L.-Y. Sun. 2013. “Scheduling Jobs with Truncated Exponential Learning Functions.” Optimization Letters 7 (8): 1857–1873. doi: 10.1007/s11590-011-0433-9
   Web of Science ®Google Scholar
• Wang, J., and Z. Xia. 2005. “Flow-Shop Scheduling with a Learning Effect.” Journal of the Operational Research Society 56 (11): 1325–1330. doi: 10.1057/palgrave.jors.2601856
   Web of Science ®Google Scholar
• Wu, C.-C., A. Azzouz, I.-H. Chung, W.-C. Lin, and L. Ben Said. 2019. “A Two-Stage Three-Machine Assembly Scheduling Problem with Deterioration Effect.” International Journal of Production Research 57 (21): 6634–6647. doi: 10.1080/00207543.2019.1570378
   Web of Science ®Google Scholar
• Wu, C.-C., D. Bai, A. Azzouz, I.-H. Chung, S. R. Cheng, D. C. Jhwueng, W.-C. Lin, and L. Ben said. 2019. “A Branch-and-Bound and Four Metaheuristics for Minimizing Total Completion Time for a Two-Stage Assembly Flowshop Scheduling Problem with Learning Consideration.” Engineering Optimization. doi:10.1080/0305215X.2019.1632303.
   Web of Science ®Google Scholar
• Wu, C.-C., J. Y. Chen, W.-C. Lin, K. Lai, D. Bai, and S. Y. Lai. 2019. “A Two-Stage Three-Machine Assembly Scheduling Flowshop Problem with Both Two-Agent and Learning Phenomenon.” Computers & Industrial Engineering 130: 485–499. doi: 10.1016/j.cie.2019.02.047
   Web of Science ®Google Scholar
• Wu, C.-C., J.-Y. Chen, W.-C. Lin, K. Lai, S.-C. Liu, and P.-W. Yu. 2018. “A Two-Stage Three-Machine Assembly Flow Shop Scheduling with Learning Consideration to Minimize the Flowtime by Six Hybrids of Particle Swarm Optimization.” Swarm and Evolutionary Computation 41: 97–110. doi: 10.1016/j.swevo.2018.01.012
   Web of Science ®Google Scholar
• Wu, C.-C., S.-C. Liu, T. C. E. Cheng, Y. Cheng, S.-Y. Liu, and W.-C. Lin. 2018. “Re-entrant Flowshop Scheduling with Learning Considerations to Minimize the Makespan.” Iranian Journal of Science and Technology, Transactions A – Science 42: 727–744. doi: 10.1007/s40995-017-0236-7
   Web of Science ®Google Scholar
• Wu, C.-C., D. J. Wang, S.-R. Cheng, I.-H. Chung, and W.-C. Lin. 2018. “A Two-Stage Three-Machine Assembly Scheduling Problem with a Position-Based Learning Effect.” International Journal of Production Research 56 (9): 3064–3079. doi: 10.1080/00207543.2017.1401243
   Web of Science ®Google Scholar
• Wu, C.-C., W.-H. Wu, P.-H. Hsu, and K. Lai. 2012. “A Two-Machine Flowshop Scheduling Problem with a Truncated Sum of Processing-Times-Based Learning Function.” Applied Mathematical Modelling 36: 5001–5014. doi: 10.1016/j.apm.2011.12.038
   Web of Science ®Google Scholar
• Wu, C.-C., T.-H. Yang, X. Zhang, C.-C. Kang, I.-H. Chung, and W.-C. Lin. 2019. “Heuristic and Iterative Greedy Algorithms for the Total Weighted Completion Time Order Scheduling with Release Times.” Swarm and Evolutionary Computation 44: 913–926. doi: 10.1016/j.swevo.2018.10.003
   Web of Science ®Google Scholar
• Wu, W.-H., Y. Yin, S.-R. Cheng, P.-H. Hsu, and C.-C. Wu. 2014. “Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration.” Asia-Pacific Journal of Operational Research 31 (6): Article ID 1450046. doi: 10.1142/S0217595914500468
   Web of Science ®Google Scholar
• Wu, C.-C., Y. Yin, W.-H. Wu, and S.-R. Cheng. 2012. “Some Polynomial Solvable Single-Machine Scheduling Problems with a Truncation Sum-of-Processing-Times Based Learning Effect.” European Journal of Industrial Engineering 6 (4): 441–453. doi: 10.1504/EJIE.2012.047665
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, and C.-C. Wu. 2014. “Scheduling with Time-Dependent Processing Times.” Mathematical Problems in Engineering 2014: Article ID 201421.
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, and C.-C. Wu. 2015. “Scheduling with Time-Dependent Processing Times 2015.” Mathematical Problems in Engineering 2015: Article ID 367585.
   Web of Science ®Google Scholar
• Yin, Y., W.-H. Wu, W.-H. Wu, and C.-C. Wu. 2014. “A Branch-and-Bound Algorithm for a Single Machine Sequencing to Minimize the Total Tardiness with Arbitrary Release Dates and Position-Dependent Learning Effects.” Information Sciences 256: 91–108. doi: 10.1016/j.ins.2013.07.026
   Web of Science ®Google Scholar