Computers and Operations Research
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Information Sciences: an International Journal
A new approach to the learning effect: Beyond the learning curve restrictions
Computers and Operations Research
Some scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
Single-machine and flowshop scheduling with a general learning effect model
Computers and Industrial Engineering
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
Information Sciences: an International Journal
Two-machine flow shop problem with effects of deterioration and learning
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
Scheduling problems with deteriorating jobs and learning effects including proportional setup times
Computers and Industrial Engineering
Scheduling with job-dependent learning effects and multiple rate-modifying activities
Information Processing Letters
Mathematical and Computer Modelling: An International Journal
Some single-machine scheduling problems with a truncation learning effect
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
Information Sciences: an International Journal
Information Sciences: an International Journal
| Hi-index | 0.00 |
The importance of the ready times can be found in Wafer fabrication with the presence of unequal ready times. It is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. On the other hand, there is a significant involvement of humans in scheduling environments; the amount of learning activities is high. Hence it seems to be reasonable to consider learning in scheduling environments. However, research with learning and release times is relatively unexplored. Motivated by this observation, this paper deals with a single-machine problem with the learning effect and release times where the objective is to minimize the makespan. This paper proposes a branch-and-bound algorithm and three two-stage heuristic algorithms for the problem. The computational experiments show that the branch-and-bound algorithm can solve instances up to 25 jobs, and the best one with the average error percentage of the proposed heuristics is less than 0.05%.