한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)

한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

Minimizing total cost in proportionate flow shop with controllable processing times by polynomially solvable 0-1 unconstrained Quadratic Program

  • Choi, Byung-Cheon (Seoul R&BD Program, u-Computing Innovation Center) ;
  • Hong, Sung-Pil (Department of Industrial Engineering, Seoul National University) ;
  • Lee, Seung-Han (Department of Industrial Engineering, Seoul National University)
  • 발행 : 2007.11.09
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider a proportionate flow shop problem with controllable processing times. The objective is to minimize the sum of total completion time and total compression cost, in which the cost function of compressing the processing times is non-decreasing concave. We show that the problem can be solved in polynomial time by reducing it to a polynomially solvable 0-1 unconstrained quadratic program.

키워드