Permutation flow-shop scheduling problem to optimize a quadratic objective function

References

• Bai, v. 2015. “Asymptotic Analysis of Online Algorithms and Improved Scheme for the Flow Shop Scheduling Problem with Release Dates.” International Journal of Systems Science 46 (11): 1994–2005. doi: 10.1080/00207721.2013.843736
   Web of Science ®Google Scholar
• Bai, D., and T. Ren. 2013. “New Approximation Algorithms for Flow Shop Total Completion Time Problem.” Engineering Optimization 45 (9): 1091–1105. doi: 10.1080/0305215X.2012.720680
   Web of Science ®Google Scholar
• Bai, D., and L. Tang. 2007. “Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem.” Lecture Notes in Computer Science 4616: 191–199. doi: 10.1007/978-3-540-73556-4_22
   Google Scholar
• Bai, D., and Z. Zhang. 2014. “Asymptotic Optimality of Shortest Processing Time-Based Algorithms for Flow Shop and Open Shop Problems with Nonlinear Objective Functions.” Engineering Optimization 46: 1709–1728. doi: 10.1080/0305215X.2013.858139
   Web of Science ®Google Scholar
• Bai, D., Z.-H. Zhang, and Q. Zhang. 2016. “Flexible Open Shop Scheduling Problem to Minimize Makespan.” Computers and Operations Research 67 (1): 207–215. doi: 10.1016/j.cor.2015.10.012
   Web of Science ®Google Scholar
• Chen, H., S. Zhou, X. Li, and R. Xu. 2014. “A Hybrid Differential Evolution Algorithm for a Two-Stage Flow Shop on Batch Processing Machines with Arbitrary Release Times and Blocking.” International Journal of Production Research 52 (19): 5714–5734. doi: 10.1080/00207543.2014.910625
   Web of Science ®Google Scholar
• Cheng, T. C. E., and Z. Liu. 2004. “Parallel Machine Scheduling to Minimize the Sum of Quadratic Completion Times.” IIE Transactions 36: 11–17. doi: 10.1080/07408170490257844
   Web of Science ®Google Scholar
• Han, Y.-Y., D. Gong, and X. Sun. 2015. “A Discrete Artificial Bee Colony Algorithm Incorporating Differential Evolution for the Flow-Shop Scheduling Problem with Blocking.” Engineering Optimization 47 (7): 1–20. doi: 10.1080/0305215X.2014.928817
   Web of Science ®Google Scholar
• Johnson, S. M. 1954. “Optimal Two- and Three-Stage Production Schedules with Setup Times Included.” Naval Research Logistics Quarterly 1 (1): 61–68. doi: 10.1002/nav.3800010110
   Google Scholar
• Kaelo, P., and M. M. Ali. 2006. “A Numerical Study of Some Modified Differential Evolution Algorithms.” European Journal of Operational Research 169 (3): 1176–1184. doi: 10.1016/j.ejor.2004.08.047
   Web of Science ®Google Scholar
• Koulamas, C., and G. Kyparisis. 2005. “Algorithms with Performance Guarantees for Flow Shops with Regular Objective Functions.” IIE Transactions 37 (12): 1107–1111. doi: 10.1080/07408170500288067
   Web of Science ®Google Scholar
• Li, X., and M. Yin. 2013. “An Opposition-Based Differential Evolution Algorithm for Permutation Flow Shop Scheduling Based on Diversity Measure.” Advances in Engineering Software 55 (1): 10–31. doi: 10.1016/j.advengsoft.2012.09.003
   Web of Science ®Google Scholar
• Liao, C.-J., C.-J. Chao-Tang Tseng, and P. Luarn. 2007. “A Discrete Version of Particle Swarm Optimization for Flowshop Scheduling Problems.” Computers and Operations Research 34 (10): 3099–3111. doi: 10.1016/j.cor.2005.11.017
   Web of Science ®Google Scholar
• Liu, W., Y. Jin, and M. Price. 2016. “A New Nawaz–Enscore–Ham-Based Heuristic for Permutation Flow-Shop Problems with Bicriteria of Makespan and Machine Idle Time.” Engineering Optimization 48: 1808–1822. doi: 10.1080/0305215X.2016.1141202
   Web of Science ®Google Scholar
• Liu, Y., M. Yin, and W. Gu. 2014. “An Effective Differential Evolution Algorithm for Permutation Flow Shop Scheduling Problem.” Applied Mathematics and Computation 248 (248): 143–159. doi: 10.1016/j.amc.2014.09.010
   Web of Science ®Google Scholar
• Pan, Q.-K., L. Wang, and B. Qian. 2009. “A Novel Differential Evolution Algorithm for Bi-criteria No-Wait Flow Shop Scheduling Problems.” Computers and Operations Research 36 (36): 2498–2511. doi: 10.1016/j.cor.2008.10.008
   Web of Science ®Google Scholar
• Pinedo, M. 2012. Scheduling: Theory, Algorithms, and Systems. 4th ed. New York: Springer.
   Google Scholar
• Potts, C. N., and V. A. Strusevich. 2009. “Fifty Years of Scheduling: A Survey of Milestones.” Journal of the Operational Research Society 60: S41–S68. doi: 10.1057/jors.2009.2
   Web of Science ®Google Scholar
• Qian, B., L. Wang, D.-x. Huang, W.-l. Wang, and X. Wang. 2009. “An Effective Hybrid DE-Based Algorithm for Multi-objective Flow Shop Scheduling with Limited Buffers.” Computers and Operations Research 36: 209–233. doi: 10.1016/j.cor.2007.08.007
   Web of Science ®Google Scholar
• Shao, W., and D. Pi. 2016. “A Self-Guided Differential Evolution with Neighborhood Search for Permutation Flow Shop Scheduling.” Expert Systems with Applications 51: 161–176. doi: 10.1016/j.eswa.2015.12.001
   Web of Science ®Google Scholar
• Smith, W. E. 1956. “Various Optimizers for Single-Stage Production.” Naval Research Logistics Quarterly 3 (1–2): 59–66. doi: 10.1002/nav.3800030106
   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): 341–359. doi: 10.1023/A:1008202821328
   Web of Science ®Google Scholar
• Tasgetiren, M. F., Y.-C. Liang, M. Sevkli, and G. Gencyilmaz. 2007. “A Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in the Permutation Flowshop Sequencing Problem.” European Journal of Operational Research 177 (3): 1930–1947. doi: 10.1016/j.ejor.2005.12.024
   Web of Science ®Google Scholar
• Tasgetiren, M. F., Q.-K. Pan, P. N. Suganthan, and O. Buyukdagli. 2013. “A Variable Iterated Greedy Algorithm with Differential Evolution for the No-Idle Permutation Flowshop Scheduling Problem.” Computers and Operations Research 40 (7): 1729–1743. doi: 10.1016/j.cor.2013.01.005
   Web of Science ®Google Scholar
• Townsend, W. 1978. “The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution.” Management Science 24: 530–534. doi: 10.1287/mnsc.24.5.530
   Web of Science ®Google Scholar
• Wang, L., Q.-K. Pan, P. N. Suganthan, W.-H. Wang, and Y.-M. Wang. 2010. “A Novel Hybrid Discrete Differential Evolution Algorithm for Blocking Flow Shop Scheduling Problems.” Computers and Operations Research 37 (3): 509–520. doi: 10.1016/j.cor.2008.12.004
   Web of Science ®Google Scholar
• Wang, J.-B., and M.-Z. Wang. 2012. “Worst-Case Analysis for Flow Shop Scheduling Problems with an Exponential Learning Effect.” Journal of the Operational Research Society 63: 130–137. doi: 10.1057/jors.2011.40
   Web of Science ®Google Scholar
• Xia, C. H., J. G. Shanthikumar, and P. W. Glynn. 2000. “On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem.” Operations Research 48 (4): 615–622. doi: 10.1287/opre.48.4.615.12423
   Web of Science ®Google Scholar
• Xu, Z., L. Sun, and J. Gong. 2008. “Worst-Case Analysis for Flow Shop Scheduling with a Learning Effect.” International Journal of Production Economics 113: 748–753. doi: 10.1016/j.ijpe.2007.11.002
   Web of Science ®Google Scholar