Skip to main content

A stochastic scheduling problem issued from iron and steel industry : Some results

  • Contributed Papers
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 197))

  • 1307 Accesses

Abstract

A stochastic scheduling problem with resource constraints arising in iron and steel industry is discussed. It concerns the utilization of highly flexible automated and integrated bricklaying systems inside converters located on different sites. The stochastic aspect concerns the time windows to which one task of bricklaying has to be assigned. The resource constraint comes from the limited number of bricklaying systems. For this problem simulation is used first in order to compare some strategies which can be used for the on-line decision problem. We then try to analyse them : was the chosen number of bricklaying systems adequate ? To answer this question two ways are proposed : the search of a priori lower and upper bounds under particular assumptions and the study of the deterministic problem a posteriori after a simulated execution. The first section describes the considered problem. The second one presents the lower and upper bounds. The third section presents very briefly the simulation strategies for the on-line decisions. The fourth one gives the general approach for an "a posteriori" analysis and the fifth section presents a numerical sample.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. BAKER, An Exact Algorithm for the Time Constrained Traveling Salesman Problem, Oper. Res., 31, 938–945, 1983

    Article  MATH  Google Scholar 

  2. M. BARTUSCH, R.H. MÔHRING, F.J. RADERMACHER, Scheduling project networks with resource constraints and time windows, Annals of Operations research, Vol 16, 201–240, 1988

    Article  MathSciNet  Google Scholar 

  3. D. J. BERTSIMAS, G. VAN RYSIN, A stochastic and dynamic vehicule routing problem in the euclidean plane, Oper. Res., 39 no 4, 601–605, 1991

    Article  MATH  Google Scholar 

  4. C. CHU, B. FINEL, M.C. PORTMANN, J. M. PROTH, N. SAUER, Simulation de politiques d'ordonnancement de machines, INRIA-LORRAINE, Rapport no2, Project EUREKA, mars 1992

    Google Scholar 

  5. M. DESROCHERS, F. SOUMIS, A reoptimization algorithm for the shortest path problem with time windows, European Journal of Operational Research, Vol 35, 242–254, 1988

    Article  MATH  MathSciNet  Google Scholar 

  6. J.A. FERLAND, L. FORTIN, Vehicles scheduling with sliding time windows, European Journal of Operational Research, Vol 38, 213–226, 1989

    Article  MATH  Google Scholar 

  7. B. FINEL, Ordonnancement à contrainte cumulative en univers déterministe et stochastique: allocation dynamique de machines à briqueter à des convertisseurs, Mémoire CNAM, CAMOS, Metz, 16 octobre 1992

    Google Scholar 

  8. M.R. GAREY, R.L. GRAHAM, D.S. JOHNSON, Computers and intractability: a guide to the theory of NP-completness, Freeman, San Francisco, 1979

    Google Scholar 

  9. A. GUINET, Transports industriels routiers, un problème d'affectation avec réemplois sous contraintes, R.A.I.R.O. Recherche opérationnelle, Vol 18, 353–379, no 4, novembre 1984

    MATH  Google Scholar 

  10. M. HAOURI, P. DEJAX, M. DESROCHERS, Routing problems with time windows constraints, state of art, Rairo Recherche opérationnelle, Vol 24, no 3, 217–244, 1990

    Google Scholar 

  11. H.W. KUHN, The hungarian method for the assignment problem, Naval Research Logist. Quart., no 2, 83–97, 1955

    Article  Google Scholar 

  12. B. ROY, Algèbre moderne et théorie des graphes, Tome 2, ch 8, DUNOD, 1970

    Google Scholar 

  13. P. WURTH S.A., Highly flexible automated and integreted bricklaying system, FAMOS project, Definition Study, septembre 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Henry Jean-Pierre Yvon

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag

About this paper

Cite this paper

Finel, B., Portmann, MC. (1994). A stochastic scheduling problem issued from iron and steel industry : Some results. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035529

Download citation

  • DOI: https://doi.org/10.1007/BFb0035529

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19893-2

  • Online ISBN: 978-3-540-39337-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics