Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect

References

• Adamopoulos, G. I., and C. P. Pappis. 1996. “Single Machine Scheduling with Flow Allowances.” Journal of the Operational Research Society 47 (10): 1280–1285. doi: 10.1057/jors.1996.155
   Web of Science ®Google Scholar
• Allahverdi, A. 2016. “A Survey of Scheduling Problems with No-wait in Process.” European Journal of Operational Research 255 (3): 665–686. doi: 10.1016/j.ejor.2016.05.036
   Web of Science ®Google Scholar
• Azzouz, A., M. Ennigrou, and L. B. 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. 2008. “A State-of-the-art Review on Scheduling with Learning Effects.” European Journal of Operational Research 188 (2): 315–329. doi: 10.1016/j.ejor.2007.05.040
   Web of Science ®Google Scholar
• Gao, F., M. Liu, J.-J. Wang, and Y.-Y. Lu. 2018. “No-wait Two-machine Permutation Flow Shop Scheduling Problem with Learning Effect, Common Due Date and Controllable Job Processing Times.” International Journal of Production Research 56 (6): 2361–2369. doi: 10.1080/00207543.2017.1371353
   Web of Science ®Google Scholar
• Gordon, V. S., J. M. Proth, and C. B. Chu. 2002a. “A Survey of the State-of-the-art of Common Due Date Assignment and Scheduling Research.” European Journal of Operational Research 139 (1): 1–25. doi: 10.1016/S0377-2217(01)00181-3
   Web of Science ®Google Scholar
• Gordon, V. S., J. M. Proth, and C. B. Chu. 2002b. “Due Date Assignment and Scheduling: SLK, TWK and Other Due Date Assignment Models.” Production Planning and Control 13 (2): 117–132. doi: 10.1080/09537280110069621
   Web of Science ®Google Scholar
• Gordon, V., V. Strusevich, and A. Dolgui. 2012. “Scheduling with Due Date Assignment under Special Conditions on Job Processing.” Journal of Scheduling 15 (4): 447–456. doi: 10.1007/s10951-011-0240-2
   Web of Science ®Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326. doi: 10.1016/S0167-5060(08)70356-X
   Google Scholar
• Hardy, G. H., J. E. Littlewood, and G. Polya. 1967. Inequalities. Cambridge: Cambridge University Press.
   Google Scholar
• Ji, P., G. Li, Y. Huo, and J.-B. Wang. 2014. “Single-machine Common Flow Allowance Scheduling with Job-dependent Aging Effects and a Deteriorating Maintenance Activity.” Optimization Letters 8 (4): 1389–1400. doi: 10.1007/s11590-012-0504-6
   Web of Science ®Google Scholar
• Li, G., M.-L. Luo, W.-J. Zhang, and X.-Y. Wang. 2015. “Single-machine Due-window Assignment Scheduling based on Common Flow Allowance, Learning Effect and Resource Allocation.” International Journal of Production Research 53 (4): 1228–1241. doi: 10.1080/00207543.2014.954057
   Web of Science ®Google Scholar
• Liu, Y., and Z. Feng. 2014. “Two-machine No-wait Flowshop Scheduling with Learning Effect and Convex Resource-dependent Processing Times.” Computers & Industrial Engineering 75: 170–175. doi: 10.1016/j.cie.2014.06.017
   Web of Science ®Google Scholar
• Liu, F., S. Wang, Y. Hong, and X. Yue. 2017a. “On the Robust and Stable Flowshop Scheduling under Stochastic and Dynamic Disruptions.” IEEE Transactions on Engineering Management 64 (4): 539–553. doi: 10.1109/TEM.2017.2712611
   Web of Science ®Google Scholar
• Liu, M., S. Wang, F. Zheng, and C. Chu. 2017b. “Algorithms for the Joint Multitasking Scheduling and Common Due Date Assignment Problem.” International Journal of Production Research 55 (20): 6052–6066. doi: 10.1080/00207543.2017.1321804
   Web of Science ®Google Scholar
• Lu, Y.-Y., G. Li, Y.-B. Wu, and P. Ji. 2014. “Optimal Due-date Assignment Problem with Learning Effect and Resource-dependent Processing Times.” Optimization Letters 8 (1): 113–127. doi: 10.1007/s11590-012-0467-7
   Web of Science ®Google Scholar
• Mor, B., and G. Mosheiov. 2016. “Minsum and Minmax Scheduling on a Proportionate Flowshop with Common Flow-allowance.” European Journal of Operational Research 254 (2): 360–370. doi: 10.1016/j.ejor.2016.03.037
   Web of Science ®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: The International Journal of Management Science 11 (1): 91–95. doi: 10.1016/0305-0483(83)90088-9
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2007. “A Survey of Scheduling with Controllable Processing Times.” Discrete Applied Mathematics 155 (13): 1643–1666. doi: 10.1016/j.dam.2007.02.003
   Web of Science ®Google Scholar
• Taillard, E. 1993. “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64 (2): 278–285. doi: 10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar
• Wang, J.-B., F. Liu, and J.-J. Wang. 2016a. “Research on m-Machine Flow Shop Scheduling with Truncated Learning Effects.” International Transactions in Operational Research. doi:10.1111/itor.12323.
   Web of Science ®Google Scholar
• Wang, J.-B., M. Liu, N. Yin, and P. Ji. 2017a. “Scheduling Jobs with Controllable Processing Time, Truncated Job-dependent Learning and Deterioration Effects.” Journal of Industrial and Management Optimization 13 (2): 1025–1039. doi: 10.3934/jimo.2017067
   Web of Science ®Google Scholar
• Wang, J.-B., and M.-Z. Wang. 2014. “Single-machine Due-window Assignment and Scheduling with Learning Effect and Resource-dependent Processing Times.” Asia-Pacific Journal of Operational Research 31 (5): 1450036. (15 pages). doi: 10.1142/S0217595914500365
   Web of Science ®Google Scholar
• Wang, J.-B., and J.-J. Wang. 2015. “Research on Scheduling with Job-dependent Learning Effect and Convex Resource Dependent Processing Times.” International Journal of Production Research 53 (19): 5826–5836. doi: 10.1080/00207543.2015.1010746
   Web of Science ®Google Scholar
• Wang, D., M.-Z. Wang, and J.-B. Wang. 2010. “Single-machine Scheduling with Learning Effect and Resource Dependent Processing Times.” Computers & Industrial Engineering 59: 458–462. doi: 10.1016/j.cie.2010.06.002
   Web of Science ®Google Scholar
• Wang, Z., C.-M. Wei, and L. Sun. 2017b. “Solution Algorithms for the Number of Tardy Jobs Minimisation Scheduling with a Time-dependent Learning Effect.” International Journal of Production Research 55 (11): 3141–3148. doi: 10.1080/00207543.2016.1264642
   Web of Science ®Google Scholar
• Wang, D.-J., Y. Yin, and M. Liu. 2016b. “Bicriteria Scheduling Problems Involving Job Rejection, Controllable Processing Times and Rate-modifying Activity.” International Journal of Production Research 54 (12): 3691–3705. doi: 10.1080/00207543.2015.1136081
   Web of Science ®Google Scholar
• Yang, S.-J., C.-J. Hsu, and D.-L. Yang. 2012. “Single-machine Scheduling and Slack Due-date Assignment with Aging Effect and Deteriorating Maintenance.” Optimization Letters 6 (8): 1855–1873. doi: 10.1007/s11590-011-0382-3
   Web of Science ®Google Scholar
• Yedidsion, L.. 2012. “Bi-criteria and Tri-criteria Analysis to Minimize Maximum Lateness Makespan and Resource Consumption for Scheduling a Single Machine.” Journal of Scheduling 15 (6): 665–679.
   Web of Science ®Google Scholar
• Yin, N., and X.-Y. Wang. 2011. “Single-machine Scheduling with Controllable Processing Times and Learning Effect.” The International Journal of Advanced Manufacturing Technology 54 (5–8): 743–748. doi: 10.1007/s00170-010-2973-z
   Web of Science ®Google Scholar