A Study on Flow Shop Scheduling with Early & Tardy Penalty Cost

조기완료 및 납기지연 벌과금을 고려한 흐름작업 시스템의 일정계획

This paper is concerned with flow shop scheduling problems having the common due date. V-shape property is used for algorithms with early and tardy penalty cost. The objective of this paper is developing efficient heuristic scheduling algorithms for minimizing total penalty cost function and determining the optimal common due date. The between job delay and the work in process are considered for developing algorithms as penalty cost. Algorithms is simulated to analyze interrelated factors. A numerical example is given for illustrating the proposed algorithms.