Optimal Solution and Heuristic Methods for Earliness and Tardiness Production Scheduling and Planning Problems
スポンサーリンク
概要
- 論文の詳細を見る
A demand-centred enumerating method with a branch and bound algorithm has been proposed for solving earliness and tardiness production scheduling and planning problems. This method can obtain an optimal solution for small-scale problems within a practical computation time. For larger-scale problems, a decomposition heuristic method has been proposed, which divides the problem into several partial problems in terms of the planning horizon. The partial problems are sequentially connected by the inventory at the end of the planning horizon. The validity of the optimal solution method and heuristic method is verified in a large-scale numerical experiment.
- 社団法人日本経営工学会の論文
- 2005-12-15
著者
-
Cormier Gilles
Faculty Of Engineering Universite De Moncton
-
ISHIGAKI Aya
Department of Neurology, Tohoku University School of Medicine
-
Inada Shuhei
Department of Administration Engineering, Keio University
-
Hirakawa Yasuhiro
Department of Industrial Administration, Tokyo University of Science
-
Inada Shuhei
Department Of Administration Engineering Keio University
-
Ishigaki Aya
Department Of Industrial Administration Tokyo University Of Science
-
Hirakawa Yasuhiro
Department Of Industrial Administration Tokyo University Of Science
関連論文
- Expression profiling with progression of dystrophic change in dysferlin-deficient mice (SJL)
- Optimal Solution and Heuristic Methods for Earliness and Tardiness Production Scheduling and Planning Problems
- Nuclear Magnetic Relaxation around the Magnetic Instabilities in Metals
- Anomalous Specific Heat around Ferromagnetic Instability in Metals
- On the Theory of Spin Fluctuations around the Magnetic Instabilities Effects of Zero-Point Fluctuations
- Design of a Economic Order-Point System based on Forecasted Inventory Positions
- On the Spin Fluctuation-Enhanced Specific Heat around the Magnetic Instabilities