Flow Shop Scheduling Problems By using Y-Shape Property

"V-shape"를 이용한 흐름작업 일정계획

  • Published : 1991.05.01

Abstract

This paper is concerned with a flow-shop scheduling problem for all jobs having the common due date using V-Shape penalty cost function for earliness and lateness. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty cost function and for determining the optimal common due date. In addition, the between-job-delay for two machines are considered for developing the algorithm. A numerical example is given for illustrating the proposed algorithm.

Keywords