リエントラントフローショップスケジューリング問題に関する研究(第1報) : 数理計画法による最適化  [in Japanese] Study on Re-entrant Flowshop Scheduling Problem(1st report) : Optimization by Mathematical Programming  [in Japanese]

Access this Article

Search this Article

Author(s)

Abstract

A new theoretical formulation for re-entrant flow shop scheduling problem is derived to plan an optimum production schedule by mixed integer programming. Flow time, which is an index of the evaluation of the planned schedule, is minimized to decrease amount of work-in-process. Cycle time, which is another important index, is determined by the total load time on a bottleneck machine to manufacture the products at the highest productivity. Both objective function and constraint conditions are described in linear expressions and a general optimization tool is adopted to solve the formulated scheduling problems. Another objective function is also introduced in order to shorten the time for the optimization. Computational scheduling results obtained by the optimization are evaluated and discussed in the present paper.

Journal

  • Journal of the Japan Society for Precision Engineering

    Journal of the Japan Society for Precision Engineering 74(10), 1119-1124, 2008-10-05

    The Japan Society for Precision Engineering

References:  4

Cited by:  1

Codes

  • NII Article ID (NAID)
    110006951294
  • NII NACSIS-CAT ID (NCID)
    AN1003250X
  • Text Lang
    JPN
  • Article Type
    Journal Article
  • ISSN
    09120289
  • NDL Article ID
    9678797
  • NDL Source Classification
    ZN12(科学技術--機械工学・工業--精密機械)
  • NDL Call No.
    Z16-466
  • Data Source
    CJP  CJPref  NDL  NII-ELS  J-STAGE 
Page Top