Abstract
Scheduling problems with learning effects have been widely studied in numerous publication. However, the learning effect might accelerate, especially in the steel plates and the human interaction systems. In this paper, we propose a new scheduling model with a learning effect matrix. We show that the makespan and the total completion time problems can be optimally solved in polynomial time. We present heuristic sequencing rules and analyze the worst-case bounds for performance ratios to minimize the total weighted completion time, the maximum lateness, and the total tardiness. We also show that these heuristic rules can be optimal under some agreeable conditions between the normal processing times and job due dates or weights.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Iranian Journal of Science and Technology, Transactions A: Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.