Solving Production Planning Problems with Setups by Enhanced Tabu Search Algorithms
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 91 === Production Planning usually eliminates setup time and setup cost for simplifying problem and speeding up solving. In order to make production planning more practical, we take setup time and setup cost into consideration. We formulate the problem as...
Main Authors: | Ming-Hsiau Hung, 洪銘孝 |
---|---|
Other Authors: | Yi-Feng Hung |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/27462544584810094638 |
Similar Items
-
Solving Capacitated Lot Sizing and Scheduling Problem with Comprehensive Setup Considerations by Tabu Search
by: Huang, Pei-Yi, et al.
Published: (2018) -
A Tabu Search Method for Solving the Orienteering Problem
by: Xiao-wen Zhu, et al.
Published: (2008) -
Tabu Search Algorithm to Solve the Intermodal Terminal Location Problem
by: E. Karimi∗, et al.
Published: (2015-03-01) -
A tabu search heuristic for the capacitated lot sizing problem with setup times and setup carryovers
by: Ding, Ke
Published: (1996) -
Tabu search algorithm for solving waste collection vehicle routing problem
by: Nordin, Syarifah Zyurina, et al.
Published: (2015)