3-A-6 SIMULTANEOUS OPTIMAIZATION OF ALL DECISION FEATURES IN A MULTI-ITEM MULTI-PROCESS DYNAMIC LOT SIZE SCHEDULING PROBLEM

スポンサーリンク

概要

• 論文の詳細を見る

• This paper deals with a problem of optimizing all decision features such as loading, lot sizing, lot sequencing, and dispatching in a multi-item multi-process dynamic lot size scheduling simultaneously. Clarifying that the complementary slackness theorem does not hold in the optimal solution of this sort of scheduling problems and its reason, we present an algorithm for obtaining a near optimal solution. Finally, we illustrate a numerical example.

• 一般社団法人日本機械学会の論文

著者

• Muramatsu K.

  Tokai University

• WARMAN A.

  Tokai University

• KOBAYASHI M.

  Tokai University

関連論文

• 3-A-6 SIMULTANEOUS OPTIMAIZATION OF ALL DECISION FEATURES IN A MULTI-ITEM MULTI-PROCESS DYNAMIC LOT SIZE SCHEDULING PROBLEM

スポンサーリンク