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...

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 revisit the economic lot scheduling problem (ELSP), where a family of products is produced on a single machine, or facility, on a continual basis. Our focus is on the determination of a feasible production schedule, including the manufacturing batch size of each item. We assume that total backordering is permissible and that each of the products has a limited post-production s...

⎯In this paper, we investigate the economic lot scheduling problem (ELSP) with fuzzy demands. We assume that the demand for each product i can be approximated using some triangular membership functions. In this study, we solve the fuzzy ELSP using two basic solution approaches, namely, the Independent Solution (IS) and the Common Cycle (CC) approach. For both approaches, we derive the optimal f...

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...

Problem statement: Lot-size is the clustering of items for transportation or manufacturing processes occurring at the same time. The issue in lot-size problem is to design production processes so that the feasible production quantities are equal to customer demand quantities and the timing of production is such that inventory positions are almost zero. Approach: In this study, we explore the mu...

The economic lot scheduling problem (ELSP) addresses the problem of scheduling several items each with its own static, deterministic demand at a single facility, where only one item can be produced at any time. This classical production planning problem has been studied extensively over the last three decades and various heuristic solution methods have been proposed, most of them based on the c...