When firms operate in a make-to-order environment, they must set due dates (or lead times) which are both relatively soon in the future and can be met reliably in order to compete effectively. This can be a difficult task, since there is clearly an inherent tradeoff between short due dates, and due dates that can be easily met. Nevertheless, the vast majority of due date scheduling research ass...

Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....

In this paper, the problem of determining the best schedule for a set of projects has been modeled in the form of a generalized tardiness flowshop (GTF) problem. We develop a set of heuristic algorithms for minimizing the total tardiness of jobs in a GTF problem. In the generalized version of tardiness flowshop problems, a job is considered to be a collection of operations and there is a due da...

The increasing ability to interconnect computers through internetworking, wireless networks, high-bandwidth satellite, and cable networks has spawned a new class of information-centered applications based on data dissemination. These applications, which often serve huge client populations, employ broadcast to efficiently deliver data to the clients. In data dissemination, the data transfer is i...