An Integrated Approach in Production Planning and Scheduling

Stephane Dauzere-Peres and Jean B. Lasserre

Lectures Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, 1994.

INTRODUCTION

GLOSSARY

CHAPTER I. Production Planning and Scheduling

  • I.1. Production Management
  • I.1.1. The production system
  • I.1.2. The management system
  • I.1.3. Classication of planning decisions
    •
  • I.2. Production Planning
  • I.3. Production Scheduling
  • I.4. Planning and Scheduling
  • I.4.1. Planning and scheduling: hierarchical approaches
  • I.4.2. Planning and scheduling: integrated approaches
  • I.4.3. Planning and Scheduling: various approaches
    •
  • I.5. Conclusion

    •

    CHAPTER II. Job-Shop Sequencing and Scheduling

  • II.1. Introduction
  • II.2. Job-Shop Scheduling
  • II.2.1. Definitions
  • II.2.2. Exact methods
  • II.2.3. Heuristic methods
    •
  • II.3. The Shifting Bottleneck Procedure
  • II.3.1. Introduction
  • II.3.2. The shifting bottleneck procedure
  • II.3.3. The one-machine sequencing problem
  • II.3.4. Remarks on the shifting bottleneck procedure
    •
  • II.4. A Modified Shifting Bottleneck procedure
  • II.4.1. Drawbacks of the shifting bottleneck procedure
  • II.4.2. The dependent job algorithm
  • II.4.3. A modified shifting bottleneck procedure
  • II.3.4. Computational experiments
  • II.4.5. Conclusion
    •
  • II.5. A Priority Rule-Based Dispatching Heuristic
  • II.6. Conclusion
    •

    CHAPTER III. An Integrated Planning and Scheduling Model

  • III.1. Introduction
  • III.2. Notation and Definitions
  • III.2.1 Job-shop scheduling
  • III.2.2 Planning
    •
  • III.3. Integrated Planning and Scheduling Decisions
  • III.3.1 Introduction
  • III.3.2 Multi-period scheduling
  • III.3.3 A linear model in continuous variables
  • III.3.3 Necessary conditions
  • III.3.2 Sufficient conditions
  • III.3.2 An integrated model with set-up times
    •
  • III.4. Solving procedures
  • III.4.1 A one-pass procedure
  • III.4.2 An iterative procedure
    •
  • III.5. First Computational Results
  • III.5.1 With no set-up time
  • III.5.2 With set-up times
  • III.5.2 Other computational results
    •
  • III.6. Conclusion
    •

    CHAPTER IV. Various Resolution Strategies

  • IV.1. Introduction
  • IV.2. Two Multi-Period Scheduling Policies
  • IV.2.1. The global scheduling policy
  • IV.2.2. The period by period scheduling policy
  • IV.2.3. Comparison between the two scheduling policies
  • IV.2.3. Other multi-period scheduling policies
    •
  • IV.3. Influence of the Backlogging Cost
  • IV.4. Rolling Horizon
    •

    CHAPTER V. Extensions of the Model

  • V.1. Introduction
  • V.2. Subcontracting
  • V.2.1. Model modifications
  • V.2.2. Experimental results
    •
  • V.3. Work-in-Process Iventory
  • V.3.1. Model modifications
  • V.3.2. Experimental results
    •
  • V.4. Lot Streaming Option
  • V.4.1. Model modifications
    •
  • V.5. Conclusion
    •

    CHAPTER VI. Lot Streaming

  • VI.1. Introduction
  • VI.2. A Lot Streaming Procedure
  • VI.2.1. Notations and definitions
  • VI.2.2. An integrated model>br>
  • VI.2.3. An iterative procedure
  • VI.2.4. The rounding procedure
  • VI.2.5. The model with set-up times
  • VI.2.6. A lower bound
    •
  • VI.3. Computational Results
  • VI.3.1. The 6-6 and 10-10 problems
  • VI.3.2. Tests on a sample
  • VI.3.3. With set-up times
  • VI.3.4. CPU time and number of iterations
    •
  • VI.4. Impact on Lotsizing Models
  • VI.5. Conclusion
    •

    CONCLUSION

    BIBLIOGRAPHY

    LIST OF FIGURES

    LIST OF TABLES