Computers and Operations Research
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Information Sciences: an International Journal
Information Sciences: an International Journal
Makespan minimization for two parallel machines scheduling with a periodic availability constraint
Computers and Operations Research
Time-Dependent Scheduling
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
Information Sciences: an International Journal
Scheduling jobs under increasing linear machine maintenance time
Journal of Scheduling
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
Information Sciences: an International Journal
Hi-index | 0.07 |
This paper provides a continuation of the idea presented by Yin et al. [Yin et al., Some scheduling problems with general position-dependent and time-dependent learning effects, Inform. Sci. 179 (2009) 2416-2425]. For each of the following three objectives, total weighted completion time, maximum lateness and discounted total weighted completion time, this paper presents an approximation algorithm which is based on the optimal algorithm for the corresponding single-machine scheduling problem and analyzes its worst-case bound. It shows that the single-machine scheduling problems under the proposed model can be solved in polynomial time if the objective is to minimize the total lateness or minimize the sum of earliness penalties. It also shows that the problems of minimizing the total tardiness, discounted total weighted completion time and total weighted earliness penalty are polynomially solvable under some agreeable conditions on the problem parameters.