Abstract
In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting) time, total absolute differences in completion (waiting) times respectively. If the number of machines is fixed, these problems can be solved in m On 2 () + time respectively, where m is the number of machines and n is the number of jobs.
Highlights
In modern planning and scheduling problems, there are many real situations where the processing time of jobs may be subject to change due to learning effect
An extensive survey of different scheduling models and problems with learning effects could be found in Biskup [1]
Janiak et al [2] studied a single processor problem with a S-shaped learning model. They proved that the makespan minimization problem is strongly NP-hard
Summary
In modern planning and scheduling problems, there are many real situations where the processing time of jobs may be subject to change due to learning effect. Scheduling, Unrelated Parallel Machines, Truncated Job-Dependent Learning Lee [3] considered scheduling jobs with general position-based learning curves. For some single machine and a two-machine flowshop scheduling problems, they presented the optimal solution respectively.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
