Abstract
Job-shop scheduling problem is a very hard issue in operations research and is studied since a long time, with a wide variety of constraints. This paper addresses the job-shop scheduling problem with a new kind of constraint. The particular issue we have been interested in is about mixed blocking constraints from an operation to its successor in job tasks list. In this paper, a mathematic model is proposed and its results in Mosel Xpress software presented. Then, an evaluation function is proposed and tested with a genetic algorithm on this problem. Results are given and compared to optimal results obtained with the mathematic model on four benchmarks, each composed of twenty instances.
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.
Similar content being viewed by others
References
Bierwirth, C.: A generalized permutation approach to job-shop scheduling with genetic algorithms. OR Spektrum 17, 87–92 (1995)
Brucker, P.: An efficient algorithm for the job-shop problem with two jobs. Computing 40(4), 353–359 (1988)
D’Ariano, A., Samà, M., D’Ariano, P., Pacciarelli, D.: Evaluating the applicability of advanced techniques for practical real-time train scheduling. Transportation Research Procedia 3, 279–288 (2014)
Dauzère-Pérès, S., Pavageau, C., Sauer, N.: Modélisation et résolution par PLNE d’un problème réel d’ordonnancement avec contraintes de blocage, pp. 216–217. ROADEF, Nantes (2000)
Gorine, A., Sauvey, C., Sauer, N.: Mathematical Model and Lower Bounds for Multi Stage Job-shop Scheduling Problem with Special Blocking Constraints. Information Control Problems in Manufacturing 14(pt. 1), 98–104 (2012)
Holland, J.H.: Outline for logical theory of adaptive systems. Journal of the Association of Computing Machinery 3, 297–314 (1962)
Jain, A.S., Meeran, S.: Deterministic Job-shop scheduling: Past, present and future. European Journal of Operational Research 113, 393–434 (1999)
Johnson, S.M.: Optimal Two and Three Stage Production Schedules with Setup Times Included. Naval Research Logistics Quarterly 1, 61–68 (1954)
Lawrence, S.: Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. GSIA, Carnegie Mellon University, Pittsburgh, PA (1984)
Liu, S.Q., Kozan, E.: Scheduling trains as a blocking parallel-machine job shop scheduling problem. Computers & Operations Research 36(10), 2840–2852 (2009)
Mati, Y.: Les problèmes d’ordonnancent dans les systèmes de production Automatisés: modèle, complexité. PhD Thesis. University of Metz, France (2002) (in French)
Trabelsi, W., Sauvey, C., Sauer, N.: Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems. Computers and Operations Research 39(11), 2520–2527 (2012)
website: http://cs-benchmarks.e-monsite.com
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sauvey, C., Sauer, N., Trabelsi, W. (2015). Job-Shop Scheduling with Mixed Blocking Constraints between Operations. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 360. Springer, Cham. https://doi.org/10.1007/978-3-319-18167-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-18167-7_29
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18166-0
Online ISBN: 978-3-319-18167-7
eBook Packages: EngineeringEngineering (R0)