Hostname: page-component-89b8bd64d-4ws75 Total loading time: 0 Render date: 2026-05-09T09:19:35.570Z Has data issue: false hasContentIssue false
  • English
  • Français

Efficient and Local Efficient Solutionsfor Assignment Type Problems

Published online by Cambridge University Press:  15 August 2002

Jacques A. Ferland  and
Pina Marziliano
Jacques A. Ferland
Affiliation:
Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montréal Québec Canada H3C 3J7.
Pina Marziliano
Affiliation:
Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montréal Québec Canada H3C 3J7.
Get access

Abstract

In this paper, we analyse the multiobjective problem generated byapplying a goal programming approach to deal with linearassignment type problem. We specify sufficient conditions for asolution to be efficient for this problem. The notion ofefficiency with respect to a neighborhood is also introduced andcharacterized through sufficient conditions. Unfortunately, theseconditions are not necessary in general.

Keywords

Efficiencylocal efficiencyassignmentmultiobjective.

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 35 , Issue 3 , July 2001 , pp. 301 - 313
Copyright
© EDP Sciences, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

D. Costa, Méthodes de résolution constructives, séquentielles et évolutives pour des problèmes d'affectation sous-contraintes, Doctoral dissertation. Mathematics Department, École Polytechnique Fédérale de Lausanne, Switzerland (1995).
J.A. Ferland, Generalized Assignment Type Problems, a Powerful Modeling Scheme, in Practice and Theory of Automated Timetabling II, edited by E. Burke and M. Carter. Springer, Lecture Notes in Comput. Sci. 1408 (1998) 53-77.
Ferland, J.A., Berrada, I., Nabli, I., Ahiot, A., Michelon, P. and Gascon, V., Generalized Assignment-Type Goal Programming Problem and Application to Nurse Scheduling. J. Heuristics 7 (2001) 391-413. CrossRef
Ferland, J.A., Hertz, A. and Lavoie, A., Objected Oriented Methodology For Solving Assignment Type Problems With Neighborhood Search Techniques, An. Oper. Res. 44 (1996) 347-359. CrossRef
Ferland, J.A. and Lavoie, A., Exchanges Procedures For Timetabling Problems. Discrete Appl. Math. 35 (1992) 237-253. CrossRef
Geoffrion, A.M., Proper Efficiency and Theory of Vector Maximization. J. Math. Anal. Appl. 22 (1968) 618-630. CrossRef
Isermann, H., The Relevance of Duality in Multiple Objective Linear Programming. TIMS Studies in the Management Sci. 6 (1977) 241-262.
F.A. Lootsma, Optimization with Multiple Objectives, in Mathematical Programming: Recent Developments and Applications , edited by M. Iri and K. Tanabe (1989) 333-364.
P. Marziliano, Problèmes multicritères avec contraintes d'affectation, Master Thesis. Département d'Informatique et de Rechereche Opérationnelle, Université de Montréal, Canada (1996).
P. Marziliano and J.A. Ferland, A Heuristic Approach for Multiobjective Problems with Assignment Constraints , Publication # 1128. Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, Canada (1998).
Mazzola, J.B. and Neebe, A.W., Resource-Constrained Assignment Scheduling. Oper. Res. 34 (1986) 560-572. CrossRef
V. Robert, La confection d'horaires par décomposition en sous-problèmes d'affectation, Doctoral dissertation. Mathematics Department, École Polytechnique Fédérale de Lausanne, Switzerland (1996).
R.E. Steuer, Multiple Criteria Optimization: Theory,Computation and Application. Wiley, New York (1986).
Zionts, S. and Wallenius, J., Interactive Multiple Objective Linear Programming Method, An for a Class of Underlying Nonlinear Utility Functions. Management Sci. 29 (1983) 519-529. CrossRef