http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
To Minimize the Weighted Number of Early and Tardy Jobs in a Two-machine Flow Shop
Ji Hon Hong(홍지헌),Suk-Hun Yoon(윤석훈) 한국SCM학회 2021 한국SCM학회지 Vol.21 No.1
In this paper, we consider a two-machine flow shop scheduling problem with different job due dates. The objective is to minimize the weighted number of early and tardy jobs. We present a mixed integer programming formulation for the problem and develop efficient cut constraints which are valid inequalities. Extensive experiments are conducted to show the effectiveness of the cut constraints. We propose an O(n²) heuristic algorithm to solve the problem.