Single Machine Scheduling to Maximize Total Job Value Subject to Machine Availability Constraint = 설비 가용시간 제약하에서 작업들의 가치를 최대화하는 단일기계 일정계획 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 498
  • Download : 0
This thesis considers a single machine scheduling problem to maximize total job value subject to machine availability constraint where each job is represented by a nonincreasing stepwise value function. In the analysis, some solution properties are characterized, based on which two solution algorithms including a branch-and-bound algorithm and a heuristic algorithm are derived. Numerical experiments show that the heuristic algorithm is efficient and effective.
Advisors
Sung, Chang-Supresearcher
Description
한국과학기술원 : 산업및시스템공학과,
Publisher
한국과학기술원
Issue Date
2009
Identifier
308688/325007  / 020073349
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업및시스템공학과, 2009.2, [ iii, 49 p. ]

Keywords

작업가치; 분지한계법; 휴리스틱; 단일기계; 비증가 가치 함수; job value; branch-and-bound; heuristic; single machine; nonincreasing stepwise value function; 작업가치; 분지한계법; 휴리스틱; 단일기계; 비증가 가치 함수; job value; branch-and-bound; heuristic; single machine; nonincreasing stepwise value function

URI
http://hdl.handle.net/10203/40839
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=308688&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