(A) heuristic for family lotsizing problem with backlog = Family 특성을 갖는 多製品 生産計劃 문제에 대한 해법 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 257
  • Download : 0
This thesis presents a period-by-period heuristic algorithm for a multi-product single-machine capacitated lotsizing problem where products sharing the same setup are grouped into the same family and backlogs are allowed. The family concept is employed to express the problem explicitly and to extend the existing heuristic methods for a multi-product single-machine capacitated lotsizing problem to more complex situations where grouping of similar products is required. The backlog allowance is another improvement over conventional period-by-period heuristics. In the proposed heuristic method, lotsizing decisions are made period by period. In each period, lotsizing indices and opportunity costs for production of each family are evaluated to obtain a feasible plan with low costs. Next, an improvement step is applied to lower the production costs by perturbing the obtained plan.
Advisors
Ahn, Byong-Hunresearcher안병훈researcher
Description
한국과학기술원 : 경영과학과,
Publisher
한국과학기술원
Issue Date
1987
Identifier
65899/325007 / 000851025
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 경영과학과, 1987.2, [ [ii], 56, [1] p. ]

URI
http://hdl.handle.net/10203/44748
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=65899&flag=dissertation
Appears in Collection
MG-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0