To analyze scheduling algorithms in computer networks, two models have been proposed and widely used in the literature, namely the Guaranteed Rate (GR) server model and the Latency Rate (LR) server model. While a lot scheduling algorithms have been proved to belong to GR or LR or both, it is not clear what is the relationship between them. The purpose of this paper is to investigate this relati...

To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large number of results available for flow-based scheduling algorithms, few such results are available for aggregate-based scheduling. In this paper, we study a network implementing Guaranteed Rate (GR) scheduling with First...

Grid computing refers to the harnessing of computer systems to collaboratively solve a problem requiring a lot of Central Processing Unit (CPU) or data storage and processing far more than one system to handle. Grids are formed with resources owned by many organizations across borders and thus are not dedicated to single user or organization leading to security and trust issues. Various schedul...

Abstract In a single item dynamic lot-sizing problem, we are given time horizon and demand for in every period. The problem seeks solution that determines how much to produce carry at each period, so will incur the least amount of production inventory cost. When remanufacturing option is included, input comprises number returned products period can be potentially remanufactured satisfy demands,...

A production planning problem, known as the Discrete Lot sizing and S cheduling P roblem with seq uence-dependent changeov er costs, is considered. W e propose a new way of modelling the production sy stem based on the use of a multi attribute product structure encountered in many industrial situations. T he basic idea is to describe the products as combinations of phy sical attributes and to e...

In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period,...

The lot-sizing and production scheduling problem in a real-life multi-product yoghurt production line is addressed. A new discrete/continuous time representation mixedinteger linear programming model, based on the definition of families of products, is presented. It is mainly optimized the packaging stage while timing and capacity constraints are imposed with respect to the pasteurization/homog...