Lower Bounds For Total Weighted Completion Scheduling Problem With Availability Constraints

CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3（2009）

引用 1|浏览2

暂无评分

摘要

In this paper we consider the single machine total weighted completion scheduling problem with availability constraints. The machine is subject to many periods of maintenances. To solve this problem, we propose some lower bounds. A computational experiments and analysis are given afterwards to test the efficiency of the proposed lower bounds.

查看译文

关键词

single machine, availability constraints, total weighted completion time, lower bound

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要