受限於完成時間絕對差最小化之下平行機台完工時間最小化問題

本研究針對等效平行機台（Identical Parallel Machine）在TADC (Total Absolute Deviation of Completion time)最小下使最大完工時間最小的雙目標問題加以探討。TADC為一種完成時間變異問題的衡量。本研究先提出最佳解求解方式來求得TADC在等效平行機台最小的最佳解，再利用BIP數學模式來最小化最大完工時間。透過模擬實驗分析此求解方式之求解效率，模擬中最大環境工作數量200個，機台30台，最佳解的平均求解時間約229.1秒。

關鍵字

排程；等效平行機台； TADC ；最大完工時間

並列摘要

This study addresses the identical parallel machine scheduling problem in which makespan are minimized subject to minimize TADC, denoted as P||TADC/ΣCmax . An optimal algorithm is first proposed to solve TADC on identical parallel machine, then a binary integer programming model is developed to minimize makespan. Computational Experiments are conducted and the computation results are reported.

並列關鍵字

Scheduling ； Identical parallel machine ； TADC ； Makespan

參考文獻

Chen, W.Y., Sheen, G.J.,2007. Single-machine scheduling with multiple performance measures: Minimizing job-dependent earliness and tardiness subject to the number of tardy jobs. International Journal of Production Economics 109, 214-229

Framina, J.M., Leiste, R.,2006. A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness.International Journal of Production Economics 99, 28-40

Ganesan, V.K., Sivakumar, A.I., 2006. Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times. International Journal of Production Economics 103, 633-647

Gowrishankar, K., Rajendran, C., Srinivasan, G.,2001. Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date. European Journal of Operational Research 132, 643-665

Ganesan, V.K., Sivakumar, A.I., Srinivasan, G.,2006. Hierarchical minimization of completion time variance and makespan in jobshops. Computers & Operations Research 33, 1345-1367

國際替代計量

受限於完成時間絕對差最小化之下平行機台完工時間最小化問題

全文下載

主題瀏覽