Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Information Sciences: an International Journal
Computers & Mathematics with Applications
Some single-machine and m-machine flowshop scheduling problems with learning considerations
Information Sciences: an International Journal
Single machine scheduling with time-dependent deterioration and exponential learning effect
Computers and Industrial Engineering
Computers and Industrial Engineering
A periodic tabular policy for scheduling of a single stage production-inventory system
Computers and Industrial Engineering
Computers and Industrial Engineering
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves
Computers and Industrial Engineering
| Hi-index | 0.00 |
In a manufacturing system workers are involved in doing the same job or activity repeatedly. Hence, the workers start learning more about the job or activity. Because of the learning, the time to complete the job or activity starts decreasing, which is known as ''learning effect''. In this paper, an exponential sum-of-actual-processing-time based learning effect is introduced into single-machine scheduling. By the exponential sum-of-actual-processing-time based learning effect, we mean that the processing time of a job is defined by an exponential function of the sum-of-the-actual-processing-time of the already processed jobs. Under the proposed learning model, we show that under a sufficient condition, the makespan minimization problem, the sum of the @qth (@q0) power of completion times minimization problem, and some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem remain polynomially solvable.