Skip to main content

1994 | Buch

Lotsizing and Scheduling for Production Planning

verfasst von: Dr. Knut Haase

Verlag: Springer Berlin Heidelberg

Buchreihe : Lecture Notes in Economics and Mathematical Systems

insite
SUCHEN

Über dieses Buch

Billions of dollars are tied up in the inventories of manufacturing companies which cause large (interest) costs. A small decrease of the inventory and/or production costs without reduction of the service level can increase the profit substantially. Especially in the case of scarce capacity, efficient production schedules are fundamental for short delivery time and on-time delivery which are important competitive priorities. To support decision makers by improving their manufacturing resource planning system with appropriate methods is one of the most of production planning. interesting challenges The following chapters contain new models and new solution strategies which may be helpful for decision makers and for further research in the areas of production planning and operations research. The main subject is on lotsizing and scheduling. The objectives and further characteristics of such problems can be inferred from practical need. Thus, before an outline is given, we consider the general objectives of lotsizing and scheduling and classify the most important characteristics of such problems in the following sections.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Introduction
Abstract
Billions of dollars are tied up in the inventories of manufacturing companies which cause large (interest) costs. A small decrease of the inventory and/or production costs without reduction of the service level can increase the profit substantially. Especially in the case of scarce capacity, efficient production schedules are fondamental for short delivery time and on-time delivery which are important competitive priorities. To support decision makers by improving their manufacturing resource planning system with appropriate methods is one of the most interesting challenges of production planning.
Knut Haase
Chapter 2. Single-Level Capacitated Lotsizing Problems
Abstract
Whereas uncapacitated lotsizing problems can be solved efficiently to optimality [cf. Federgruen, Tzur 1991], solving capacitated lotsizing problems is still a complex challenge in the area of production planning. In this chapter a well-known capacitated lotsizing problem is discussed. Some shortcomings of the corresponding model formulation force to consider a modification.
Knut Haase
Chapter 3. Single-Level Lotsizing and Scheduling Problems
Abstract
A solution of the problems considered in the preceding chapter does not yield the sequence of the lots. Especially in the short term planning the sequence of the production quantities is required. This chapter deals with models where the size and the sequence of lots are determined simultaneously. These include the following (well-known) models for single-level, multi-item, dynamic, capacitated lotsizing and scheduling:
  • — the discrete lotsizing and scheduling problem (DLSP)
  • — the continuous setup lotsizing problem (CSLP) which are considered in Sections 3.1 and 3.2, respectively. Furthermore, in Section 3.3 we introduce a new type of model. Although these types of models are based on different fondamental assumptions, each of them is applicable for short-term scheduling with periods as days or shifts. In the last section of this chapter we compare the three models and stress the relevance of the new model.
Knut Haase
Chapter 4. Extensions of the PLSP
Abstract
This chapter is concerned with extensions of the PLSP for other potential applications. We consider setup times and present how sequence dependent setup costs and times can be included. Normally more than one machine exists which is able to produce certain items. Hence, we are going to model the multi-machine case. A make-or-buy decision is incorporated by defining one machine as a “buy-machine”. Using the buy-machine, i.e. purchasing items, is one possibility to overcome capacity shortages or to obtain a more efficient capacity utilization; filling orders with delay or planned stockouts will also be treated. To take care of parent-component relationships between items, a multi-level PLSP is introduced modelling a production facility with one bottleneck. We conclude this chapter with remarks on the presented extensions, and give an overview over further modifications as well as over aspects of an integration into a material requirements planning (MRP) system.
Knut Haase
Chapter 5. Control of Stochastic Algorithms via Sequential Analysis
Abstract
This chapter deals with the control of stochastic algorithms which depend on some parameters. Stochastic algorithms generate a (large) number of solutions. The information in the objective function values of already generated solutions can be used to “tune” a stochastic algorithm for further computations. This is to say, that certain “good” parameter values are preferred in hope for a solution which is better than any solution already known. The question of which parameter values are to be preferred will be answered by a statistical test.
Knut Haase
Chapter 6. A New Class of Stochastic Heuristics for the PLSP and the CLSPL
Abstract
In this chapter a stochastic backward add-method is introduced which is applicable for the PLSP and, slightly modified, for the CLSPL. The heuristic starts at the planning horizon T and steps backwards to the first period t=1. In each period (add-step) setup and lotsize decisions are performed based on a so-called randomized regret-measure. The performance of the heuristic depends on the choice of two real-valued parameters from a (partitioned) parameter space. Therefore a sequential test controls the choice of the parameter values (cf. Chapter 5).
Knut Haase
Chapter 7. Computational Results
Abstract
In Chapter 2 and Chapter 3 we have introduced the CLSPL and the PLSP, respectively. A stochastic heuristic applicable for the PLSP (BAPLSP) and, slightly modified, for the CLSPL (BACLSPL) is presented in the preceding chapter. Since it is supposed that the approach depends (heavily) on two parameter values, a sequential test based parameter control is provided.
Knut Haase
Chapter 8. Summary and Future Work
Abstract
This manuscript deals mainly with dynamic, capacitated and multi-item lotsizing and scheduling problems. We discusses the assumptions of the CLSP which forces to consider the CLSPL, where the lots of adjacent periods can be linked. The CLSPL is superior to the CLSP with respect to the quality of solutions. The CLSP and the CLSPL do not consider the sequence of lots within a period.
Knut Haase
Backmatter
Metadaten
Titel
Lotsizing and Scheduling for Production Planning
verfasst von
Dr. Knut Haase
Copyright-Jahr
1994
Verlag
Springer Berlin Heidelberg
Electronic ISBN
978-3-642-45735-7
Print ISBN
978-3-540-57833-8
DOI
https://doi.org/10.1007/978-3-642-45735-7