Scheduling with a position-weighted learning effect and job release dates

References

• Ahmadizar, F., and L. Hosseini. 2012. “Bi-Criteria Single Machine Scheduling with a Time-Dependent Learning Effect and Release Times.” Applied Mathematical Modelling 36 (12): 6203–6214.
   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
• Bai, D., M. Tang, Z.-H. Zhang, and E. D. R. Santibanez-Gonzalez. 2018. “Flow Shop Learning Effect Scheduling Problem with Release Dates.” Omega 78: 21–38.
   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.
   Web of Science ®Google Scholar
• Chen, X., Z. Wang, E. Pesch, M. Sterna, and J. Blazewicz. 2019. “Two-Machine Flow-Shop Scheduling to Minimize Total Late Work: Revisited.” Engineering Optimization 51 (7): 1268–1278.
   Web of Science ®Google Scholar
• Cheng, T. C. E., W. H. Kuo, and D. L. Yang. 2013. “Scheduling with a Position-Weighted Learning Effect Based on Sum-of-Logarithm-Processing-Times and Job Position.” Information Sciences 221: 490–500.
   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 (1): 293–306.
   Web of Science ®Google Scholar
• Cheng, T. C. E., P.-J. Lai, C.-C. Wu, and W.-C. Lee. 2009. “Single-Machine Scheduling with Sum-of-Logarithm-Processing-Times-Based Learning Considerations.” Information Sciences 179 (18): 3127–3135.
   Web of Science ®Google Scholar
• Chu, C. 1992. “Efficient Heuristics to Minimize Total Flow Time with Release Dates.” Operations Research Letters 12 (5): 321–330.
   Web of Science ®Google Scholar
• Dessouky, M. M. 1998. “Scheduling Identical Jobs with Unequal Ready Times on Uniform Parallel Machines to Minimize the Maximum Lateness.” Computers & Industrial Engineering 34 (4): 793–806. doi:10.1016/S0360-8352(98)00105-3.
   Web of Science ®Google Scholar
• Dessouky, M. I., and J. S. Deogun. 1981. “Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time.” SIAM Journal on Computing 10 (1): 192–202. doi:10.1137/0210014.
   Web of Science ®Google Scholar
• Geng, X.-N., J.-B. Wang, and D. Bai. 2019. “Common Due Date Assignment Scheduling for a No-Wait Flowshop with Convex Resource Allocation and Learning Effect.” Engineering Optimization 51 (8): 1301–1323.
   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
• Hosseini, N., and R. Tavakkoli-Moghaddam. 2013. “Two Meta-Heuristics for Solving a New Two-Machine Flowshop Scheduling Problem with the Learning Effect and Dynamic Arrivals.” International Journal of Advanced Manufacturing Technology 65 (5): 771–786.
   Web of Science ®Google Scholar
• Janiak, A., W. Janiak, R. Rudek, and A. Wielgus. 2009. “Solution Algorithms for the Makespan Minimization Problem with the General Learning Model.” Computers & Industrial Engineering 56 (4): 1301–1308.
   Web of Science ®Google Scholar
• Janiak, A., and R. Rudek. 2009. “Experience Based Approach to Scheduling Problems with the Learning Effect.” IEEE Transactions on Systems, Man, and Cybernetics—Part A 39 (2): 344–357.
   Web of Science ®Google Scholar
• Jiang, C., D. Zou, D. Bai, and J.-B. Wang. 2019. “Proportionate Flowshop Scheduling with Position-Dependent Weights.” Engineering Optimization. doi:10.1080/0305215X.2019.1573898.
   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 (1): 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 (1): 282–297.
   Web of Science ®Google Scholar
• Lee, W.-C. 2011. “Scheduling with General Position-Based Learning Curves.” Information Sciences 181 (24): 5515–5522.
   Web of Science ®Google Scholar
• Lee, W.-C., Y.-H. Chung, and J.-Y. Wang. 2017. “A Parallel-Machine Scheduling Problem with Two Competing Agents.” Engineering Optimization 49 (6): 962–975.
   Web of Science ®Google Scholar
• Lee, W.-C., C.-C. Wu, and P.-H. Hsu. 2010. “A Single-Machine Learning Effect Scheduling Problem with Release Times.” Omega—The International Journal of Management Science 38 (1): 3–11.
   Web of Science ®Google Scholar
• Liu, F., J. Yang, and Y.-Y. Lu. 2019. “Solution Algorithms for Single-Machine Group Scheduling with Ready Times and Deteriorating Jobs.” Engineering Optimization 51 (5): 862–874.
   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
• Lu, Y.-Y., C.-M. Wei, and J.-B. Wang. 2012. “Several Single-Machine Scheduling Problems with General Learning Effects.” Applied Mathematical Modelling 36 (11): 5650–5656.
   Web of Science ®Google Scholar
• Nagano, M. S., F. L. Rossi, and N. F. Martarelli. 2019. “High-Performing Heuristics to Minimize Flowtime in No-Idle Permutation Flowshop.” Engineering Optimization 51 (2): 185–198.
   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 11 (1): 91–95.
   Web of Science ®Google Scholar
• Rinnooy Kan, A. H. G. 1976. Machine Sequencing Problems: Classification, Complexity and Computation. The Hague, The Netherlands: Martinus Nijhoff.
   Google Scholar
• Rudek, R. 2012a. “The Single Processor Total Weighted Completion Time Scheduling Problem with the Sum-of-Processing-Time Based Learning Model.” Information Sciences 199: 216–229.
   Web of Science ®Google Scholar
• Rudek, R. 2012b. “Scheduling Problems with Position Dependent Job Processing Times: Computational Complexity Results.” Annals of Operations Research 196 (1): 491–516.
   Web of Science ®Google Scholar
• Rudek, R. 2017a. “Scheduling on Parallel Processors with Varying Processing Times.” Computers & Operations Research 81: 90–101.
   Web of Science ®Google Scholar
• Rudek, R. 2017b. “Parallel Machine Scheduling with General Sum of Processing Time Based Models.” Journal of Global Optimization 68 (4): 799–814.
   Web of Science ®Google Scholar
• Stewart, R. D., R. M. Wyskida, and J. D. Johannes. 1995. Cost Estimator's Reference Manual. 2nd ed. New York: Wiley-Interscience.
   Google Scholar
• Sun, L.-H., K. Cui, J.-H. Chen, J. Wang, and X.-C. He. 2013. “Some Results of the Worst-Case Analysis for Flow Shop Scheduling with a Learning Effect.” Annals of Operations Research 211 (1): 481–490.
   Web of Science ®Google Scholar
• Wang, J.-B., P. Ji, T. C. E. Cheng, and D. Wang. 2012. “Minimizing Makespan in a Two-Machine Flow Shop with Effects of Deterioration and Learning.” Optimization Letters 6 (7): 1393–1409.
   Web of Science ®Google Scholar
• Wang, Y., X. Li, and R. Ruiz. 2017. “An Exact Algorithm for the Shortest Path Problem with Position-Based Learning Effects.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 47 (11): 3037–3049.
   Web of Science ®Google Scholar
• Wang, J.-B., F. Liu, and J.-J. Wang. 2019. “Research on m-Machine Flow Shop Scheduling with Truncated Learning Effects.” International Transactions in Operational Research 26 (3): 1135–1151.
   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 (1): 155–169.
   Web of Science ®Google Scholar
• Wang, J.-B., and J.-J. Wang. 2013. “Single-Machine Scheduling with Precedence Constraints and Position-Dependent Processing Times.” Applied Mathematical Modelling 37 (3): 649–658.
   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, J.-B., M.-Z. Wang, and P. Ji. 2012. “Single Machine Total Completion Time Minimization Scheduling with a Time-Dependent Learning Effect and Deteriorating Jobs.” International Journal of Systems Science 43 (5): 861–868.
   Web of Science ®Google Scholar
• Wu, C.-C., P.-H. Hsu, J.-C. Chen, and N.-S. Wang. 2011. “Genetic Algorithm for Minimizing the Total Weighted Completion Time Scheduling Problem with Learning and Release Times.” Computers and Operations Research 38 (7): 1025–1034.
   Web of Science ®Google Scholar
• Wu, C.-C., and C.-L. Liu. 2010. “Minimizing the Makespan on a Single Machine with Learning and Unequal Release Times.” Computers & Industrial Engineering 59 (3): 419–424.
   Web of Science ®Google Scholar