作業時間不固定下之裝配線平衡與排序:新數學模型與方法
Other Title
New Mathematical Models and Methods for Assembly Line Balancing
and Sequencing with Random and Bounded Operations Times
and Sequencing with Random and Bounded Operations Times
Date Issued
2003
Date
2003
Author(s)
賴聰乾
DOI
912416H002006
Abstract
This report presents an interesting research result, which seems publishable in a
well-recognized international journal, on a sequencing problem of minimizing the
makespan in the two-machine-in-series n-job with w non-availability intervals on
each of the two machines. The non-availability of a machine often occurs in the
scenarios of assembly line sequencing. This problem is binary NP-hard even if there
is only one non-availability interval either on the first or the second machine.
Sufficient conditions are derived for optimality of Johnson’s permutation in the case
of the given w >= 1 non-availability intervals. A stability analysis is conducted and
demonstrated on a huge number of randomly generated problem instances with n
between 5 and 10000, and w between 1 and 1000.
Subjects
two-machine
sequencing
non-availability intervals
stability analysis
makespan
NP-hard
Publisher
臺北市：國立臺灣大學工商管理學系
Type
report
File(s)![Thumbnail Image]()
Loading...
Name
912416H002006.pdf
Size
101.84 KB
Format
Adobe PDF
Checksum
(MD5):a0f94108312ad05104bddd8b16a84dea