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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. BAKER, An Exact Algorithm for the Time Constrained Traveling Salesman Problem, Oper. Res., 31, 938–945, 1983
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
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
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
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
J.A. FERLAND, L. FORTIN, Vehicles scheduling with sliding time windows, European Journal of Operational Research, Vol 38, 213–226, 1989
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
M.R. GAREY, R.L. GRAHAM, D.S. JOHNSON, Computers and intractability: a guide to the theory of NP-completness, Freeman, San Francisco, 1979
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
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
H.W. KUHN, The hungarian method for the assignment problem, Naval Research Logist. Quart., no 2, 83–97, 1955
B. ROY, Algèbre moderne et théorie des graphes, Tome 2, ch 8, DUNOD, 1970
P. WURTH S.A., Highly flexible automated and integreted bricklaying system, FAMOS project, Definition Study, septembre 1989
Author information
Authors and Affiliations
Editor information
Rights 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