Optimum Aggregate Inventory in the Lot Scheduling Problem with Non-Zero Setup Time
author
Abstract:
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 sequence among n! possible schedules, just by comparison of values of the maximum aggregate inventory of only n possible schedules.
similar resources
Optimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
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 minimi...
full textBudgetary Constraints and Idle Time Allocation in Common-Cycle Production with non-zero Setup Time
Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...
full textThe Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups
The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...
full textA Zero-Inventory Production-Distribution Problem with Time-Window Constraints
In this paper, we study a sub-problem of integrated production and distribution for a perishable product that cannot be inventoried. The manufacturing facility has a limited production rate, and the delivery truck has a non-negligible traveling time between locations. The order in which customers may receive deliveries is fixed. Each customer requests a delivery quantity and a time window for r...
full textAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
full textA Case History in Optimum Inventory Scheduling
This paper describes four computer programs that perform what were formerly management-decision functions in inventory scheduling. The first program solves the classical EOQ problem (uniform inventory usage) with quantity discounts. The second program, Economic Requirement Batching (ERB), uses dynamic programming, a heuristic search algorithm, and the relation between shipment size and material...
full textMy Resources
Journal title
volume 3 issue 3
pages 84- 89
publication date 1990-11-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