Algorithms for scheduling problems in re-entrant flowshops재 투입이 있는 흐름공정에서의 작업스케쥴링에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 610
  • Download : 0
This dissertation focuses on scheduling problems in re-entrant flowshops, flowshops with reentrant flows of jobs. In a typical flowshop composed of m machines, jobs are composed of m operations at most and each job visits each machine at most once. On the other hand, in re-entrant flowshops, jobs should visit the machines multiple times. In other words, jobs should go through multiple passes of serial manufacturing processes, that is, routes of all jobs are identical as in ordinary flowshop, but the jobs must be processed multiple times on the machines. We consider three different problems for re-entrant flowshop scheduling, and develop algorithms for the problems. First, we consider a two-machine re-entrant flowshop scheduling problem with the objective of minimizing makespan. In the re-entrant flowshop, all jobs must be processed twice on each machine, that is, each job should be processed on machine 1, machine 2 and then machine 1 and machine 2. We develop dominance properties, lower bounds and upper bounds on the makespan for the problem, and suggest a branch and bound algorithm that is developed using these properties and bounds. Secondly, we focus on a two-machine re-entrant flowshop scheduling problem with the objective of minimizing total tardiness. We develop dominance properties, lower bounds and upper bounds on the total tardiness of a given set of jobs for the problem, and suggest a branch and bound algorithm that is developed using these properties and bounds. Finally, we consider an m-machine re-entrant flowshop scheduling problems with the objective of minimizing makespan and total tardiness, respectively. In the m-machine (m≥2) re-entrant flowshop considered here, all jobs should be processed L (≥2) times on each machine, and hence all jobs are composed of Lm operations with zero or positive processing times. We suggest heuristic algorithms, which are modified from well-known existing algorithms for the general m-machine flowshop problem o...
Advisors
Kim, Yeong-Daeresearcher김영대researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
2007
Identifier
263428/325007  / 020035304
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 산업공학과, 2007.2, [ vii, 135 p. ]

Keywords

Algorithms for Scheduling Problems in Re-entrant Flowshops; 재 투입이 있는 흐름공정에서의 작업스케쥴링에 관한 연구

URI
http://hdl.handle.net/10203/40609
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=263428&flag=dissertation
Appears in Collection
IE-Theses_Ph.D.(박사논문)
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