Some Flow Time Considerations in Scheduling Problems

• Main Authors: Wu, Chin-Chia, 吳進家
• Other Authors: Pan Chao-Hsien
• Format: Others
• Language: zh-TW
• Published: 1997
• Online Access: http://ndltd.ncl.edu.tw/handle/41515556622169562775

博士 === 國立台灣工業技術學院 === 管理技術研究所 === 85 === To minimize total mean flow time is an important criterion in the production system. In this study, based on above criterion, investiage the folling three scheduling problems: (1) minimizing total mean flow time in a two- machine flow shop, (2) minimizing total expected flow time for a stochastic group scheduling problem (3) minimizing total flow time under no tardy job for a single- machine group scheduling problem. The results are summarized as follows. (1) In the two-machine flow shop problem, we propose a lower bound for mean flow time and develop a branch-and-bound algorithm aimed for the search of an optimal schedule.In addition,we develop a two phase heuristic algorithm to find a near optimal solution for the problem. (2) In the stochastic group scheduling problem, the job processing times are considered as random variables and group setup times are functions of job processing times. We obtain some properites of an optimal scheduling and extend the problem to multi-machine case. (3) In the single- machine group scheduling problem, we seek for an optimal job sequence to minimize total mean flow time under no tardy job. A polynomial algorithm is proposed to solve the problem.