Abstract

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

주제어

#Scheduling   #flow shop   #learning effect   #position-dependent processing time   #worst-case bound  

참고문헌 (0)

1. 이 논문의 참고문헌 없음

이 논문을 인용한 문헌 (0)

1. 이 논문을 인용한 문헌 없음