Single-machine group scheduling with a time-dependent learning effect
Computers and Operations Research
Single-machine group scheduling problems with deterioration consideration
Computers and Operations Research
Single machine group scheduling under decreasing linear deterioration
Journal of Applied Mathematics and Computing
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
Computers and Operations Research
Computers and Industrial Engineering
Time-Dependent Scheduling
Computers & Mathematics with Applications
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
Two-machine flow shop problem with effects of deterioration and learning
Computers and Industrial Engineering
Single-machine scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Single-machine scheduling with learning effect and deteriorating jobs
Computers and Industrial Engineering
Experience-based approach to scheduling problems with the learning effect
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Single machine scheduling with time-dependent deterioration and exponential learning effect
Computers and Industrial Engineering
Mathematical and Computer Modelling: An International Journal
Single-machine group scheduling with resource allocation and learning effect
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
Information Sciences: an International Journal
Single machine scheduling with autonomous learning and induced learning
Computers and Industrial Engineering
Hi-index | 0.00 |
This paper investigates single-machine group scheduling problems with simultaneous considerations of deteriorating and learning effects to minimize the makespan and the total completion time of all jobs. The group setup time is assumed to follow a simple linear time-dependent deteriorating model. Two models of learning for the job processing time are examined in this study. We provided polynomial time solutions for the makespan minimization problems. We also showed that the total completion time minimization problems remain polynomially solvable under agreeable conditions.