THE BALANCED LOT SIZE FOR A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM

スポンサーリンク

概要

• 論文の詳細を見る

• The basic nature of feasible schedules and their lot sizes are investigated for a single-machine multi-product problem, under the assumptions of deterministic demand on infinite time horizon and cyclic production sequence. Feasible schedule is obtained under the balanced lot size which is in proportion to the demand rate of each product and independent of production sequence. It is determined uniquely if the production rate is higher than the sum of demand rate, while there are infinitely many feasible schedules if the production rate is just balanced to the sum of demand rate. The quantitative relation between such related factors as demand rate, production rate, machine idle time, production lot size, can be a practical guide for designing a small lot size production system, as well as determining a feasible schedule on long-term finite planning period.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Kono Hirokazu

  Keio Univ.

• Kono H

  Keio Univ.

• Nakamura Zentaro

  Keio University

• Nakamura Z

  Keio Univ.

関連論文

• Safety Analysis under Uncertainties for Investment Alternatives over Multiple Periods using the Total-Cost Unit-Cost Domain(Optimization and Its Applications)
• THE DECISION PROCEDURE FOR PROFITABILITY OF INVESTMENT PROJECTS USING THE INTERNAL RATE OF RETURN OF SINGLE-PERIOD PROJECTS
• THE BALANCED LOT SIZE FOR A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM

スポンサーリンク