Scheduling problems with due date-related measures for hybrid flowshops혼합 흐름 공정에서의 납기를 고려한 일정계획에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 555
  • Download : 0
This dissertation focuses on scheduling problems in hybrid flowshops with the objective of minimizing total tardiness. A hybrid flowshop is a generalized form of flowshops in which each stage consists of multiple parallel machines. We consider three different problems for hybrid flowshop scheduling, and develop algorithms for the problems. First, we consider a two-stage hybrid flowshop scheduling problem with the objective of minimizing total tardiness of jobs. In the hybrid flowshop, there is one machine at the first stage and there are multiple identical parallel machines at the second stage. We develop dominance properties and lower bounds on the total tardiness of a given set of jobs, and suggest a branch and bound algorithm that is developed using these properties and bounds. Secondly, we consider a scheduling problem in a hybrid flowshop in which there are multiple serial stages, each with identical parallel machines. The objective of the problem is to minimize total tardiness of a given set of jobs. We suggest a new type of heuristic method, called bottleneck-focused algorithm, for the problem. In the algorithm, a schedule for a bottleneck stage is constructed first and then schedules for other stages are constructed based on the schedule for the bottleneck. Since the bottleneck stage may not be the first stage in the hybrid flowshop, ready times of operations at the bottleneck stage depend on the schedule at its upstream stages. At each iteration of the algorithm, the ready times are iteratively updated using information of a schedule obtained at the previous iteration. Finally, we consider a production scheduling problem in a printed circuit board (PCB) manufacturing system, which has the form of hybrid flowshop. The system produces multiple product types with different due dates and different manufacturing processes. Also, setup operations are required at certain stages or machines, and some product types have reentrant flows. In the production sch...
Advisors
Kim, Yeong-Daeresearcher김영대researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
2003
Identifier
231074/325007  / 000975248
Language
eng
Description

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

Keywords

납기; 혼합흐름공정; due date; hybrid flowshop; scheduling; 일정계획

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