Abstract
In this paper, an Interactive Simulated Annealing Multi-agents (ISAM) platform is developed to solve hierarchical multicriteria scheduling problems with goals, considering four criteria. Solving scheduling problems with this number of criteria is missed in the literature. The proposed algorithm is composed of three phases: at the first one, four agents are created to independently optimize four criteria with different random initial solution and initial configuration. This phase is achieved by proposing to the decision maker one value for each criterion. At the second phase, for each criterion a goal is fixed by the decision maker. At the third one, two agents are launched with adaptive memory to hierarchically minimize the deviations of the solutions from the goals. To fully evaluate the effectiveness of the proposed ISAM approach, we test it on different problems: a) lexicographic goal programming problems with continuous variables to prove its platform efficiency; b) single machine total weighted tardiness problems to show its robustness to solve NP-HARD scheduling problems; c) single machine problems to hierarchically solve four criteria with goals.
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
Barichard, V.: Approche hybride pour les problémes multi-objectifs Ph.D. Thesis, University of Angers, France (2003)
Baykasogly, A.: Preemptive goal programming using simulated annealing. Engineering Optimization 37(1), 49–63 (2005)
Baykasogly, A.: Solution of goal programming models using a basic taboo search algorithm. Journal of Operational Research Society 50, 960–973 (1999)
Crauwels, H.A.J., Van Wassenhove, P.C.N.: Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS Journal on computing 10, 341–350 (1997)
Gupta, A.K., Sivakumar, A.I.: Multi-objective scheduling of two-job families on a single machine Omega, vol. 33, pp. 399–405 (2005)
Gupta, J.N.D.: Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion. Prod. Plan. Control 10, 251–265 (1999)
Gupta, J.N.D., Neppalli, V.R., Werner, F.: Mini-mizing total flow time in a two-machine flowshop problem with minimum makespan. International Journal of Production Economics 69(3), 323–338 (2001)
Gupta, J.N.D., Ho, J.C.: Minimizing makespan subject to minimum flowtime on two identical parallel machines. Computers & Opera-tions Research 28, 705–717 (2001)
Lopez, P., Roubellat, F.: Ordonnancement de la production, Hermes Science ed. Paris, France (2001)
Loukil, T., Teghem, J., Tuyttens, D.: Solving multi-objective production scheduling problems using metaheuristics. European Journal of Operational Research 161, 42–61 (2005)
Morton, T., Pentico, D.: Heuristic scheduling systems. Wiley series in engineering and technology management (1993)
Nagar, A., Haddock, J., Heragu, S.: Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research 81, 88–104 (1995)
Roy, B.: Méthodologie multicritéres d’aide a la décision. Economica, Paris (1985)
Shanthikumar, J.G.: Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number tardy. Computer and operations research 10(3), 255–266 (1983)
Winston, W.L.: Operational research: applications and algorithms. Thomson Publishing, California (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dhouib, S., Kouraïchi, S., loukil, T., Chabchoub, H. (2009). An Interactive Simulated Annealing Multi-agents Platform to Solve Hierarchical Scheduling Problems with Goals. In: Krasnogor, N., Melián-Batista, M.B., Pérez, J.A.M., Moreno-Vega, J.M., Pelta, D.A. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2008). Studies in Computational Intelligence, vol 236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03211-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-03211-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03210-3
Online ISBN: 978-3-642-03211-0
eBook Packages: EngineeringEngineering (R0)