Solution algorithms for the number of tardy jobs minimisation scheduling with a time-dependent learning effect

References

• Biskup, D. 2008. “A State-of-the-art Review on Scheduling with Learning Effects.” European Journal of Operational Research 188: 315–329.
   Web of Science ®Google Scholar
• Bulfin, R. L., and R. M’Hallah. 2003. “Minimizing the Weighted Number of Tardy Jobs on a Two-machine Flow Shop.” Computers & Operations Research 30: 1887–1900.
   Web of Science ®Google Scholar
• Cheng, T. C. E., W.-H. Kuo, and D.-L. Yang. 2014. “Scheduling with a Position-weighted Learning Effect.” Optimization Letters 8: 293–306.
   Web of Science ®Google Scholar
• Cheng, T. C. E., C. C. Wu, J.-C. Chen, W.-H. Wu, and S.-R. Cheng. 2013. “Two-machine Flowshop Scheduling with a Truncated Learning Function to Minimize the Makespan.” International Journal of Production Economics 141: 79–86.
   Web of Science ®Google Scholar
• Framinan, J. M., and R. Leisten. 2003. “An Efficient Constructive Heuristic for Flowtime Minimization in Permutation Flow Shops. OMEGA: The.” International Journal of Management Science 31: 311–317.
   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
• Jafari, A., and G. Moslehi. 2012. “Scheduling Linear Deteriorating Jobs to Minimize the Number of Tardy Jobs.” Journal of Global Optimization 54: 389–404.
   Web of Science ®Google Scholar
• Jiang, Z., F. Chen, and H. Kang. 2013. “Single-machine Scheduling Problems with Actual Time-dependent and Job-dependent Learning Effect.” European Journal of Operational Research 227: 76–80.
   Web of Science ®Google Scholar
• Kuo, W.-H. 2012. “Single-machine Group Scheduling with Time-dependent Learning Effect and Position-based Setup Time Learning Effect.” Annals of Operations Research 196: 349–359.
   Web of Science ®Google Scholar
• Kuo, W.-H., C.-J. Hsu, and D.-L. Yang. 2012. “Worst-case and Numerical Analysis of Heuristic Algorithms for Flowshop Scheduling Problems with a Time-dependent Learning Effect.” Information Sciences 184: 282–297.
   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.
   Web of Science ®Google Scholar
• Lee, W.-C., J.-B. Lin, and Y.-R. Shiau. 2011. “Deteriorating Job Scheduling to Minimize the Number of Late Jobs with Setup Times.” Computers & Industrial Engineering 61: 782–787.
   Web of Science ®Google Scholar
• Lee, W.-C., and Y.-H. Chung. 2013. “Permutation Flowshop Scheduling to Minimize the Total Tardiness with Learning Effects.” International Journal of Production Economics 141: 327–334.
   Web of Science ®Google Scholar
• Li, L., and X.-Y. Wang. 2015. “Research on Single-machine Scheduling with a Time-dependent Learning Effect.” International Journal of Production Economics 170: 370–371.
   Web of Science ®Google Scholar
• Li, G., X.-Y. Wang, J.-B. Wang, and L.-Y. Sun. 2013. “Worst Case Analysis of Flow Shop Scheduling Problems with a Time-dependent Learning Effect.” International Journal of Production Economics 142: 98–104.
   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: 1228–1241.
   Web of Science ®Google Scholar
• Lin, B. M. T. 2007. “Complexity Results for Single-machine Scheduling with Positional Learning Effects.” Journal of the Operational Research Society 58: 1099–1102.
   Web of Science ®Google Scholar
• Lu, Y.-Y., F. Teng, and Z.-X. Feng. 2015. “Scheduling Jobs with Truncated Exponential Sum-of-logarithm-processing-times Based and Position-based Learning Effects.” Asia-Pacific Journal of Operational Research32 (3):1550026. 17 pages.
   Web of Science ®Google Scholar
• Moore, J. 1968. “An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs.” Management Science 15: 102–109.
   Web of Science ®Google Scholar
• Mosheiov, G., and D. Oron. 2012. “Minimizing the Number of Tardy Jobs on a Proportionate Flowshop with General Position-dependent Processing Times.” Computers and Operations Research 39: 1601–1604.
   Web of Science ®Google Scholar
• Mosheiov, G., and J. B. Sidney. 2005. “Note on Scheduling with General Learning Curves to Minimize Number of Tardy Jobs.” Journal of the Operational Research Society 56: 110–112.
   Web of Science ®Google Scholar
• Rudek, R. 2011. “Computational Complexity and Solution Algorithms for Flowshop Scheduling Problems with the Learning Effect.” Computers & Industrial Engineering 61: 20–31.
   Web of Science ®Google Scholar
• Rudek, R. 2012a. “Scheduling Problems with Position Dependent Job Processing Times: Computational Complexity Results.” Annals of Operations Research 196: 491–516.
   Web of Science ®Google Scholar
• Rudek, R. 2012b. “The Strong NP-hardness of the Maximum Lateness Minimization Scheduling Problem with the Processing-time Based Aging Effect.” Applied Mathematics and Computation 218: 6498–6510.
   Web of Science ®Google Scholar
• Rudek, R. 2013. “On Single Processor Scheduling Problems with Learning Dependent on the Number of Processed Jobs.” Applied Mathematical Modelling 37: 1523–1536.
   Web of Science ®Google Scholar
• Wang, J.-B., C. T. Ng, T. C. E. Cheng, and L. L. Liu. 2008. “Single-machine Scheduling with a Time-dependent Learning Effect.” International Journal of Production Economics 111: 802–811.
   Web of Science ®Google Scholar
• Wang, J.-B., and M.-Z. Wang. 2011. “Worst-case Behavior of Simple Sequencing Rules in Flow Shop Scheduling with General Position-dependent Learning Effects.” Annals of Operations Research 191: 155–169.
   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 Research31 (5):1450036. 15 pages.
   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: 5826–5836.
   Web of Science ®Google Scholar
• Wang, J.-J., and B.-H. Zhang. 2015. “Permutation Flowshop Problems with Bi-criterion Makespan and Total Completion Time Objective and Position-weighted Learning Effects.” Computers & Operations Research 58: 24–31.
   Web of Science ®Google Scholar