(A) two-machine flow-shop scheduling problem with two renewable and non-renewable resources = 반복사용자원과 소모자원을 소요하는 두 기계에서의 규칙적 연속공정작업들의 일정계획

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 442
  • Download : 0
In this thesis, a two-machine flow-shop scheduling problem with two kinds(renewable and non-renewable) of additional resources is considered. The objective of the problem is to determine the sequence of jobs on each machine and the amount of resources to be allotted for each operation in order to minimize the makespan. It is assumed that the processing time of each operation is a linearly decreasing function about allotted amounts of renewable and non-renewable resources. And the amount of each type of resource is restricted to an upper limit. Some dominance properties are characterized for the our problem, based upon which a branch and bound algorithm is exploited to find the optimum. Heuristic algorithms are also proposed and some computational experiences are discussed.
Advisors
Sung, Chang-Supresearcher성창섭researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1991
Identifier
67899/325007 / 000891136
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 1991.2, [ [ii], 44 p. ]

URI
http://hdl.handle.net/10203/41359
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67899&flag=dissertation
Appears in Collection
IE-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