Dynamic heuristics for the generalized job-shop scheduling problem
Pages 2562 - 2567
Abstract
This paper proposes to solve the generalized job-shop scheduling problem by using several original static and dynamic heuristics relying on the machines' potential load. We consider a generalized job-shop problem with unrelated parallel machines which can process the operations of the different jobs and, moreover, any precedence constraints between the operations are allowed. The objective is to minimize the completion date of all the jobs (makespan). This problem is NP-hard. Experimental results using various important randomly generated benchmarks are satisfactory and promising.
References
[1]
E. H. L. Aarts, P. J. M. Van Laarhoven, "Simulated annealing: theory and applications". D. Reidel Publishing Company, Dordrecht, Holland., 1987.
[2]
K. R. Baker, "Introduction to sequencing and scheduling". John Wiley and Sons, New-York, 1974.
[3]
J. Blazewicz, K. H. Ecker, G. Schmidt, J. Weglarz, "Scheduling in computer and manufacturing systems". Second, Revised Edition, Springer-Verlag, 1994.
[4]
C. Blum, M. Samples, "An ant colony optimization algorithm for shop scheduling problems", Journal of Mathematical Modelling and Algorithms, vol. 3, pp. 285-308, 2004.
[5]
H. G. Campbell., R. A. Dudek, M. L. Smith, "A heuristic algorithm for the n-job, m-machine sequencing problem". Mgmt. Sci., vol. 16(10), pp. B630-B637, 1970.
[6]
J. Carlier, E. Pinson, "An algorithm for solving the job-shop problem". Man. Sci., vol. 35, pp. 164-176, 1989.
[7]
E. Davis, J. M. Jaffe, "Algorithms for scheduling task on unrelated processors". Journal of the Association for Computing Machinery, vol. 28(4), pp. 721-736, 1981.
[8]
D. De Werra, "Design and operation of flexible manufacturing systems: The kingdom of heuristic methods". R. A. I. R. O Operational Research, vol. 21, 1987.
[9]
M. Ennigrou, K. Ghedira, "New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach". Autonomous Agents and Multi-Agent Systems, Springer Netherlands, vol. 17(2), pp. 270-287, 2008.
[10]
P. M. França., M. Gendreau, G. Laporte, F. M. Müller, "A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective". Computers and operations research, pp. 205-211, 1994.
[11]
S. French., "Sequencing and scheduling: an introduction to the mathematics of the job-shop". Wiley, 1982.
[12]
M. R. Garey, D. S. Johnson., "Computers and interactability: a guide to the theory of NP-completeness", Freeman and Co., 1979.
[13]
F. Ghedjati, "Genetic algorithm for the factory scheduling problems with parallel machines". The 37th International Conference on Computers and Industrial Engineering, Alexandria (Egypt). CD Proceedings, pp. 2116- 2127, 2007.
[14]
F. Glover, "Tabu search methods in artificial intelligence and operations research". ORSA, Artificial Intelligence Newletter, vol. 1(2), 1987.
[15]
D. E. Goldberg, "Genetic algorithms in search, optimisation, and machine learning". Addison-Wesley Publishing Company, Inc., 1989.
[16]
R. L. Graham., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, "Optimisation and approximation in deterministic sequencing and scheduling: a survey". Annals of Discrete Mathematics, vol. 5, pp. 287- 326, 1979.
[17]
J. Hopfield, J. Tank, "Neural computation of decisions in optimisation problems". Biological Cybernetics, vol. 52, pp. 141-152, 1985.
[18]
E. Horowitz, S. Sahni, "Exact and approximate algorithms for scheduling non identical processors". Journal of the Association for Computing Machinery, vol. 23(2), pp. 317-327, 1976.
[19]
O. H. Ibarra, C. E. Kim., "Heuristic algorithms for scheduling independent tasks on non identical processors". Journal of the Association for computing Machinery, vol. 24(2), pp. 280-289, 1977.
[20]
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, "Recent developments in deterministic sequencing and scheduling: a survey". In M. A. H. Dempster, J. K. Lenstra, and A. H. G. Rinnooy Kan, editors, Deterministic and stochastic scheduling, pp. 35-73, Dordrecht, The Netherlands, 1982. NATO Advanced Study and Research Institute, D. Reidel Publishing Company, 1982.
[21]
B. Naderi, M. Khalili, R. Tavakkoli-Moghaddam, "A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time", Elsevier, Computers & Industrial Engineering, in press.
[22]
R. T. Nelson, C. A. Holloway, R. M.-L. Wong, "Centralized scheduling and priority implementation heuristics for a dynamic job-shop model". A. I. I. E. Trans., vol. 9, pp. 95-102, 1977.
[23]
S. S. Panwalkar, W. Iskandar, "A survey of scheduling rules". Operations Research, vol. 25(1), pp. 45-61, 1977.
[24]
M. C. Portmann, Z. Mouloua, "A window time negotiation approach at the scheduling level inside supply chains", MISTA, Paris 28-31 August, pp. 410-417, 2007.
[25]
C. N. Potts, "Analysis of a linear programming heuristic for scheduling unrelated parallel machines", Discrete Applied Mathmatics, vol. 10, pp. 155-164, 1985.
[26]
A. H. G. Rinnooy Kan, "Machine scheduling problems: classification, complexity and computation", Nijhoff, The Hague, 1976.
[27]
P. V. Senthiil., V. Selladurai, R. Rajesh, "Parallel machine scheduling (PMS) in manufacturing systems using the ant colonies optimization algorithmic rule", Journal of Applied Sciences, vol. 7(2), pp. 208-213, 2007.
[28]
S. L. Van De Velde, "Duality-based algorithms for scheduling unrelated parallel machines". ORSA Journal on Computing, vol. 5(2), pp. 192- 205, 1993.
[29]
M. Widmer, "Job-shop scheduling with tooling constraints: a tabu search approach", J. Opl Res. Soc., vol. 42(1), pp. 75-82, 1991.
[30]
S. H. Zanakis, J. R. Evans., "Heuristics optimisation: why, when, and how to use it". Interfaces, vol. 11(5), pp. 84-91, 1981.
Index Terms
- Dynamic heuristics for the generalized job-shop scheduling problem
Index terms have been assigned to the content through auto-classification.
Recommendations
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion
Flexible job shop scheduling problem.Ensembles of heuristics.Re-scheduling for new job insertion.Multiple objectives scheduling problem. This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job ...
Bicriteria scheduling problem for unrelated parallel machines with release dates
This research proposes a heuristic and a tabu search algorithm (TSA) to find non-dominated solutions to bicriteria unrelated parallel machine scheduling problems with release dates. The two objective functions considered in this problem are to minimize ...
Flow shop scheduling with two distinct job due dates
Highlights- Flow shop scheduling problems with two distinct job due dates.
- Solvability with ...
AbstractWe consider flow shop scheduling problems with two distinct job due dates. Motivated by the NP-hardness of these problems with arbitrary job processing times, we focus on their solvability with ordered or proportionate job processing ...
Comments
Information & Contributors
Information
Published In
October 2009
5232 pages
ISBN:9781424427932
Publisher
IEEE Press
Publication History
Published: 11 October 2009
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in