Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect

References

• Ahmadizar, F., and Z. Amiri. 2018. “Outsourcing and Scheduling for a Two-Machine Flow Shop with Release Times.” Engineering Optimization 50 (3): 483–498.
   Web of Science ®Google Scholar
• Allahverdi, A., and T. Aldowaisan. 2002. “No-Wait Flowshops with Bicriteria of Makespan and Total Completion Time.” Journal of the Operational Research Society 53 (9): 1004–1015.
   Web of Science ®Google Scholar
• Allahverdi, A., and T. Aldowaisan. 2004. “No-Wait Flowshops with Bicriteria of Makespan and Maximum Lateness.” European Journal of Operational Research 152 (1): 132–147.
   Web of Science ®Google Scholar
• Azzouz, A., M. Ennigrou, and L. B. Said. 2017. “Scheduling Problems under Learning Effects: Classification and Cartography.” International Journal of Production Research 56 (3): 1–20.
   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.
   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
• 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.
   Google Scholar
• Hardy, G. H., J. E. Littlewood, and G. Pólya. 1967. Inequalities. 2nd ed. Cambridge, UK: Cambridge University Press.
   Google Scholar
• Jiang, F., X. Zhang, D. Bai, and C.-C. Wu. 2018. “Competitive Two-Agent Scheduling Problems to Minimize the Weighted Combination of Makespans in a Two-Machine Open Shop.” Engineering Optimization 50 (4): 684–697.
   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.
   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.
   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.
   Web of Science ®Google Scholar
• Lu, Y.-Y., and J.-Y. Liu. 2017. “A Note on Resource Allocation Scheduling with Position-Dependent Workloads.” Engineering Optimization 50 (10): 1810–1827. doi:10.1080/0305215X.2017.1414207.
   Web of Science ®Google Scholar
• Lu, Y.-Y., J.-B. Wang, P. Ji, and H. He. 2017. “A Note on Resource Allocation Scheduling with Group Technology and Learning Effects on a Single Machine.” Engineering Optimization 49 (9): 1621–1632.
   Web of Science ®Google Scholar
• Nagano, M. S., F. L. Rossi, and N. J. Martarelli. 2018. “High-Performing Heuristics to Minimize Flowtime in No-Idle Permutation Flowshop.” Engineering Optimization. doi:10.1080/0305215X.2018.1444163.
   Web of Science ®Google Scholar
• Papadimitriou, Christos H., and Kenneth Steiglitz. 1998. Combinatorial Optimization: Algorithms and Complexity. Mineola, NY: Dover Publications.
   Google Scholar
• Ren, T., P. Zhao, D. Zhang, B. Liu, H. Yuan, and D. Bai. 2017. “Permutation Flow-Shop Scheduling Problem to Optimize a Quadratic Objective Function.” Engineering Optimization 49 (9): 1589–1603.
   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.
   Web of Science ®Google Scholar
• Tian, Y., M. Xu, C. Jiang, J.-B. Wang, and X. Y. Wang. 2018. “No-Wait Resource Allocation Flowshop Scheduling with Learning Effect under Limited Cost Availability.” The Computer Journal. doi:10.1093/comjnl/bxy034.
   PubMed Web of Science ®Google Scholar
• Wang, J.-B., and X.-X. Liang. 2018. “Group Scheduling with Deteriorating Jobs and Allotted Resource under Limited Resource Availability Constraint.” Engineering Optimization. doi:10.1080/0305215X.2018.1454442.
   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): Article ID 1450036. 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.
   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 (3): 458–462.
   Web of Science ®Google Scholar
• Wang, J.-B., and Z.-Q. Xia. 2006. “Flowshop Scheduling with Deteriorating Jobs under Dominating Machines.” Omega 34 (4): 327–336.
   Web of Science ®Google Scholar
• Zeng, Y. Z., A. Che, and X. Wu. 2018. “Bi-Objective Scheduling on Uniform Parallel Machines Considering Electricity Cost.” Engineering Optimization 50 (1): 19–36.
   Web of Science ®Google Scholar
• Zhang, X., Y. Yin, and C.-C. Wu. 2017. “Scheduling with Non-Decreasing Deterioration Jobs and Variable Maintenance Activities on a Single Machine.” Engineering Optimization 49 (1): 84–97.
   Web of Science ®Google Scholar
• Zhu, Z., L. Sun, F. Chu, and M. Liu. 2011. “Single-machine Group Scheduling with Resource Allocation and Learning Effect”. Computers & Industrial Engineering 60 (1): 148–157.
   Google Scholar