Abstract
We consider the single machine scheduling problem with dynamic job arrival and total weighted tardiness and makespan as objective functions. The machine is subject to disruptions related to late raw material arrival and machine breakdowns. We propose a proactive—reactive approach to deal with possible perturbations. In the proactive phase, instead of providing only one schedule to the decision maker, we present a set of predictive schedules. This set is characterized by a partial order of jobs and a type of associated schedules, here semi-active schedules. This allows us to dispose of some flexibility in job sequencing and flexibility in time that can be used on-line by the reactive algorithm to hedge against unforeseen disruptions. We conduct computational experiments that indicate that our approach outperforms a predictive reactive approach particularly for disruptions with low to medium amplitude.
Since September 2003, Mohamed Ali Aloulou is a member of laboratory LAMSADE, Université Paris Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France.
This is a preview of subscription content, log in via an institution to check access.
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
Aloulou, M. A. (2002) Structure flexible d'ordonnancements à performances contrôlées pour le pilotage d'atelier en présence de perturbations. Ph.D. Thesis, Institut National Polytechnique de Lorraine.
Aloulou, M. A., Kovalyov, M. Y. and Portmann, M. C. (2004) Maximization in single machine scheduling. Annals of Operations Research, 129:21–32
Aloulou, M. A. and Portmann, M. C. (2001) Incorporating flexibility in job sequencing for the single machine total weighted tardiness problem with release dates. In Proceedings of 10th Annual Industrial Engineering Research Conference, on CD-ROM.
Artigues, C., Roubellat, F. and Billaut, J.-C. (1999) Characterization of a set of schedules in a resource constrained multi-project scheduling problem with multiple modes. International Journal of Industrial Engineering, Applications and Practice, 6:112–122.
Baker, K. R. (1974) Introduction to Sequencing and Scheduling. Wiley, New York.
Billaut, J. C. and Roubellat, F. (1996) A new method for workshop real time scheduling. International Journal of Production Research, 34:1555–1579.
Brightwell, G. and Winkler, P. (1991) Counting linear extensions. Order, 8:225–242.
Church, L. K. and Uzsoy, R. (1992) Analysis of periodic and event-drive rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing, 5:153–163.
Davenport, A. J. and Beck, J. C. (2000) A survey of techniques for scheduling with uncertainty. http:/Avww.eil.utoronto.ca/profiles/chris/chris.papers.html.
Davis, L. (1991) Handbook of Genetic Algorithms. Van Nostrand-Reinhold, New York.
Djerid, L. and Portmann, M. C. (1996) Genetic algorithm operators restricted to precedent constraint sets: genetic algorithm designs with or without branch and bound approach for solving scheduling problems with disjunctive constraints. In Proceedings of IEEE International Conference on Systems, Man and Cybernetics (Oct. 14–17), Vol. 4, pp. 2922–2927.
Herroelen, W. and Leus, R. (2003) Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, in press, available online 1 June 2004.
Jouglet, A. (2002) Ordonnancer sur une machine pour minimiser la some des coût. Ph.D. Thesis, Université de Technologie de Compiègne.
Lawler, E. L. (1973) Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19:544–546.
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B. (1993) Sequencing and scheduling: algorithms and complexity. In Logistics of Production and Inventory, Handbook in Operations Research and Management Science, Vol. 4, Elsevier, Amsterdam, pp. 445–452.
Leon, V. J., Wu, S. D. and Storer, R. H. (1994) Robustness measures and robust scheduling for job shops. IIE Transactions, 26:32–43.
Mehta, S. V. and Uzsoy, R. (1999) Predictable scheduling of a single machine subject to breakdowns. International Journal of Computer Integrated Manufacturing, 12:15–38.
Morton, T. E. and Pentico, D. W. (1993) Heuristic Scheduling with Apllications to Production Systems and Project Management. Wiley, New York.
Portmann, M. C., Vignier, A., Dardilhac, C. D. and Dezalay, D. (1998) Branch and bound crossed with ga to solve hybrid flowshops. European Journal of Operational Research, 107:389–400.
T'kindt, V. and Billaut, J. C. (2002) Multicriteria Scheduling. Springer, Berlin.
Vieira, G. E., Herrmann, J. W. and Lin, E. (2003) Rescheduling manufacturing systems: a framework of strategies, policies, and methods. Journal of Scheduling, 6:35–58.
Wu, S. D. Byeon, E. S. and Storer, R. H. (1999) A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Operations Research, 47:113–124.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Aloulou, M.A., Portmann, MC. (2005). An Efficient Proactive-Reactive Scheduling Approach to Hedge Against Shop Floor Disturbances. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/0-387-27744-7_11
Download citation
DOI: https://doi.org/10.1007/0-387-27744-7_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25266-7
Online ISBN: 978-0-387-27744-8
eBook Packages: Business and EconomicsBusiness and Management (R0)