In some job shops where one worker needs to operate more than one machine, there is learning effect because the worker operates the machines repeatedly. For this one worker and one process production job shop scheduling problem minimizing makespan considering position-based learning effect, a mixed integer programming model is proposed. In order to solve this problem, a greedy operator considering learning effect is designed, and two kinds of greedy algorithms with greedy operator are presented. Then the simulated annealing algorithm based on greedy is proposed. To evaluate the performance of the mixed integer programming model, greedy algorithms and the simulated annealing algorithm based on greedy numerical experiments of the small-sized and large-sized problems are designed. Numerical experiments show that the modern mixed integer programming solver can solve some small size problems that the product of the number of machines and total jobs number is less than 75, simulated annealing algorithm based on greedy is effective and adapt to all kinds of size problems, and the interval insertion greedy algorithm can also obtain satisfactory results rapidly and suit for scenarios that need to be solved quickly.