A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers (original) (raw)

Lecture Notes in Computer Science, 2007

Abstract

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,

George Vairaktarakis hasn't uploaded this paper.

Let George know you want this paper to be uploaded.

Ask for this paper to be uploaded.