A new approach is proposed in this paper to solve the job-shop scheduling problem. Instead of considering operations or machines, the construction of partial schedules by dealing with jobs, one after the other, is suggested. A partial schedule for given jobs is characterized by the sequence of their operations on each machine. The principle of the algorithm is to aggregate a new job on the current schedule, i.e. to insert its operations without altering the previous order. Two main theoretical results are presented: firstly, the selection procedure for jobs and secondly, the aggregation algorithm. Next the method is explained using a simple example. Finally, the authors present and comment on computational results for an implementation of the algorithm, for some well-known job-shop problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams, J., Balas, E. and Zawack, D. (1988) The shifting bottleneck procedure for the job shop scheduling. Management Science, 34, 391–401.
Akers, S. (1956) A graphical approach to production scheduling problems. Operation Research, 4, 244–245.
Brucker, P. (1988) An efficient algorithm for the job-shop problem with two jobs. Computing, 40, 353–359.
Brucker, P. and Jurisch, B. (1990) Geometric methods for solving job-shop scheduling problems with two jobs, in Proceedings of the Second International Workshop on Project Management and Scheduling EURO WG-ANS, Campiegne.
Carlier, J. (1982) The one-machine sequencing problem. European Journal of Operations Research, 11, 42–47.
Carlier, J. and Pinson, E. (1989) An algorithm for solving the job shop problem. Management Science, 35, 164–176.
Dell'Amico, M. and Trabin, M. (1993) Applying tabu-search to the job-shop scheduling problem. Annals of Operations Research, 41, 231–252.
French, S. (1982) Sequencing and Scheduling: an Introduction to the Mathematics of the Job-Shop; John Wiley & Sons, New York.
Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
Muth, J. F. and Thompson, D. S. (1963) Industrial Scheduling, Prentice Hall, Englewood Cliffs, NJ.
Panwalkar, S. S. and Iskander, W. (1977) A survey of scheduling rules. Operations Research, 25, 45–61.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Penz, B., Dupont, L. An aggregation procedure for the deterministic job-shop problem. J Intell Manuf 6, 117–122 (1995). https://doi.org/10.1007/BF00123683
Issue Date:
DOI: https://doi.org/10.1007/BF00123683