Zhejiang Daxue xuebao. Lixue ban (Sep 2008)

Semi-online scheduling problem on two identical parallel machines with combined partial information(两台同型平行机的复合半在线排序问题)

TANJin-zhi(谭金芝)

Affiliations

TANJin-zhi(谭金芝): College of Mathematics and Information Science, Wenzhou University, Wenzhou 325035, Zhejiang University, China(温州大学数学与信息科学学院，浙江温州 325035)

DOI: https://doi.org/10.3785/j.issn.1008-9497.2008.05.007
Journal volume & issue: Vol. 35, no. 5
pp. 507 – 510

Abstract

研究了两台同型平行机的一个复合半在线排序问题.即对已知工件加工时间递减和实例最优值，目标为极大化机器最早完工时间的复合半在线排序模型，分析了它的下界，并给出了竞争比为9/8的最优算法.

Published in Zhejiang Daxue xuebao. Lixue ban

ISSN: 1008-9497 (Print)
Publisher: Zhejiang University Press
Country of publisher: China
LCC subjects: Science: Mathematics: Instruments and machines: Electronic computers. Computer science; Science: Physics
Website: https://www.zjujournals.com/sci/EN/1008-9497/home.shtml

About the journal