Optimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time

Authors

  • Alireza Haji Industrial Engineering, Sharif University of Technology
  • Rasoul Haji Industrial Engineering, Sharif University of Technology
Abstract:

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimize the maximum aggregate inventory for a given sequence of production runs and for any arbitrary cycle time T . Then, we show that these values of idle times, for the given sequence, are also optimal idle times for any other sequence. The result is an easy-to-apply rule that greatly simplifies the task of scheduling to achieve minimum required investment in inventory.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Optimum Aggregate Inventory in the Lot Scheduling Problem with Non-Zero Setup Time

In this paper, the minimization of the maximum aggregate inventory of all products for the common cycle time approach to the scheduling problem of a multi-products single machine system is considered. In the case of non-zero set up time and limited resources, a simply and easy to apply rule has been obtained for this optimization problem. Using this rule, one can obtain the optimal production s...

full text

A Mathematical Programming Model and Genetic Algorithm for a Multi-Product Single Machine Scheduling Problem with Rework Processes

In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem.  Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...

full text

Single-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production

Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...

full text

Single-Setup-Multiple-Deliveries for a Single Supplier-Single Buyer with Single Product and Backorder

  This article investigates integrated production-inventory models with backorder. A single supplier and a single buyer are considered and shortage as backorder is allowed for the buyer. The proposed models determine optimal order quantity, optimal backorder quantity and optimal number of deliveries on the joint total cost for both buyer and supplier. Two cases are discussed: single-setup-singl...

full text

An Optimum Algorithm for Single Machine with Early/Tardy Cost

The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for neig...

full text

An Optimum Algorithm for Single Machine with Early/Tardy Cost

The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. &#10 Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for ne...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 15  issue 1

pages  41- 48

publication date 2002-04-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023