Scheduling Preemptive Open-shop to Minimize Total Completion Time
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 94 === Production scheduling is very important in practice . A good scheduling can order the jobs efficiently , improve the machine utilization and reduce the production cost . Currently , the research of production scheduling is getting more and more emphasized . I...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/8sp4v2 |
id |
ndltd-TW-094CYUT5031024 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094CYUT50310242019-05-15T19:17:50Z http://ndltd.ncl.edu.tw/handle/8sp4v2 Scheduling Preemptive Open-shop to Minimize Total Completion Time 可允許中斷之開放工廠總完工時間最小化問題之研究 Chih-Yi Wang 王智毅 碩士 朝陽科技大學 工業工程與管理系碩士班 94 Production scheduling is very important in practice . A good scheduling can order the jobs efficiently , improve the machine utilization and reduce the production cost . Currently , the research of production scheduling is getting more and more emphasized . In this research the scheduling problem of minimizing total completion time in a preemptive open shop is examined . The open shop preemptive scheduling problem can be formulated as follows . There are n jobs that have to be processed on m machines . Each job consists of m operations each of which is to be processed on a different machine. The order in which the operations are processed is immaterial . Each job is processed by one machine at a time and each machine processes one job at a time . A schedule is preemptive if the execution of any operation may arbitrarily often be interrupted and resumed at a later time . Given a job completion sequence , the problem can be expressed as a linear program . When the number of machine is two , the linear program can be replaced by an algorithm with complexity O(n) which produces no more than n-1 preemptions . When the number of machine is greater than two , we develop an efficient heuristic for solving the total completion time preemptive open shop scheduling problem. Finally , computational experiments are conducted to evaluate the performance of the proposed algorithm . The Heuristics presented in this research can solve m-machine problem efficiently. Also, HeuristicⅡperforms better than HeuristicⅠ. Keyword:Scheduling , Open shop , Preemptive , Total Completion Time Ching-Fang Liaw 廖經芳 2006 學位論文 ; thesis 60 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 94 === Production scheduling is very important in practice . A good scheduling can order the jobs efficiently , improve the machine utilization and reduce the production cost . Currently , the research of production scheduling is getting more and more emphasized . In this research the scheduling problem of minimizing total completion time in a preemptive open shop is examined .
The open shop preemptive scheduling problem can be formulated as follows . There are n jobs that have to be processed on m machines . Each job consists of m operations each of which is to be processed on a different machine. The order in which the operations are processed is immaterial . Each job is processed by one machine at a time and each machine processes one job at a time . A schedule is preemptive if the execution of any operation may arbitrarily often be interrupted and resumed at a later time .
Given a job completion sequence , the problem can be expressed as a linear program . When the number of machine is two , the linear program can be replaced by an algorithm with complexity O(n) which produces no more than n-1 preemptions . When the number of machine is greater than two , we develop an efficient heuristic for solving the total completion time preemptive open shop scheduling problem. Finally , computational experiments are conducted to evaluate the performance of the proposed algorithm . The Heuristics presented in this research can solve m-machine problem efficiently. Also, HeuristicⅡperforms better than HeuristicⅠ.
Keyword:Scheduling , Open shop , Preemptive , Total Completion Time
|
author2 |
Ching-Fang Liaw |
author_facet |
Ching-Fang Liaw Chih-Yi Wang 王智毅 |
author |
Chih-Yi Wang 王智毅 |
spellingShingle |
Chih-Yi Wang 王智毅 Scheduling Preemptive Open-shop to Minimize Total Completion Time |
author_sort |
Chih-Yi Wang |
title |
Scheduling Preemptive Open-shop to Minimize Total Completion Time |
title_short |
Scheduling Preemptive Open-shop to Minimize Total Completion Time |
title_full |
Scheduling Preemptive Open-shop to Minimize Total Completion Time |
title_fullStr |
Scheduling Preemptive Open-shop to Minimize Total Completion Time |
title_full_unstemmed |
Scheduling Preemptive Open-shop to Minimize Total Completion Time |
title_sort |
scheduling preemptive open-shop to minimize total completion time |
publishDate |
2006 |
url |
http://ndltd.ncl.edu.tw/handle/8sp4v2 |
work_keys_str_mv |
AT chihyiwang schedulingpreemptiveopenshoptominimizetotalcompletiontime AT wángzhìyì schedulingpreemptiveopenshoptominimizetotalcompletiontime AT chihyiwang kěyǔnxǔzhōngduànzhīkāifànggōngchǎngzǒngwángōngshíjiānzuìxiǎohuàwèntízhīyánjiū AT wángzhìyì kěyǔnxǔzhōngduànzhīkāifànggōngchǎngzǒngwángōngshíjiānzuìxiǎohuàwèntízhīyánjiū |
_version_ |
1719086484025245696 |