A Scheduling Problem With One Producer And The Bargaining Counterpart With Two Producers

Xiaobing Gan,Yanhong Gu,George L. Vairaktarakis, Yiaoqiang Cai,Quanle Chen

ESCAPE'07: Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies（2007）

引用 3|浏览1

暂无评分

摘要

First this paper considers a Common Due Window (CDW) scheduling problem of n jobs on a single machine to minimize the sum of common weighted earliness and weighted number of tardy jobs when only one manufacturer processes these jobs. Two dynamic algorithms are designed for two cases respectively and each case is proved to be ordinary NP-hard. Successively the scenario, where two manufacturers jointly process these jobs due to the insufficient production facilities or techniques of each party, is investigated. A novel dynamic programming algorithm is proposed to obtain an existing reasonable set of processing utility distributions on the bi-partition of these jobs.

查看译文

关键词

common weighted earliness,dynamic algorithm,novel dynamic programming algorithm,weighted number,Common Due Window,existing reasonable set,insufficient production facility,n job,ordinary NP-hard,processing utility distribution,bargaining counterpart,scheduling problem

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要