首页|单机最小化加权总完工时间的产品加工问题

单机最小化加权总完工时间的产品加工问题

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
Fabrication scheduling on a single machine to minimize the weighted sum of product completion time
In this paper, a fabrication scheduling problem concerning the production of components at a single manufacturing facility was studied, in which the manufactured components are subsequently assembled into a finite number of end products.Each product was assumed to comprise a common component to all jobs and a unique component to itself. Common operations were processed in batches and each batch required a setup time. A product is completed when both its two operations have been processed and are available. The optimality criterion considered was the minimization of weighted flow time. For this scheduling problem, the optimal schedules were described in a weignted shortest processing time first (WSPT) order and two algorithms were constructed corresponding to the batch availability and item availability, respectively.

schedulingproductweighted flow timeweighted shortest processing time first (WSPT)batch processingdynamic programming

王玉青、孙世杰

展开 >

Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China

scheduling product weighted flow time weighted shortest processing time first (WSPT) batch processing dynamic programming

2007

上海大学学报(英文版)
上海大学

上海大学学报(英文版)

影响因子：0.196
ISSN：1007-6417
年,卷(期)：2007.11(2)
  • 7