zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. (English) Zbl 1039.90015
Summary: In this paper we propose a two-stage multi-population genetic algorithm (MPGA) to solve parallel machine scheduling problems with multiple objectives. In the first stage, multiple objectives are combined via the multiplication of the relative measure of each objective. Solutions of the first stage are arranged into several sub-populations, which become the initial populations of the second stage. Each sub-population then evolves separately while an elitist strategy preserves the best individuals of each objective and the best individual of the combined objective. This approach is applied in parallel machine scheduling problems with two objectives: makespan and total weighted tardiness (TWT). The MPGA is compared with a benchmark method, the multi-objective genetic algorithm (MOGA), and shows better results for all of the objectives over a wide range of problems. The MPGA is extended to scheduling problems with three objectives: makespan, TWT, and total weighted completion times and also performs better than MOGA.

90B35Scheduling theory, deterministic
90B50Management decision making, including multiple objectives
90C59Approximation methods and heuristics
Full Text: DOI
[1] Pinedo, M.: Scheduling: theory, algorithms, and systems. (1995) · Zbl 1145.90393
[2] Gross, D.; Harris, C. M.: Fundamentals of queueing theory. (1988) · Zbl 0949.60002
[3] Rosenthal, R. E.: Concepts, theory, and techniques--principle of multiobjective optimization. Decision science 16, 133-152 (1985)
[4] Fry, T. D.; Armstrong, R. D.; Lewis, H.: A framework for single machine multiple objective sequencing research. Omega 17, 594-607 (1989)
[5] Lee, C. -.Y.; Vairaktarakis, G. L.: Complexity of single machine hierarchical scheduling: a survey. Complexity in numerical optimization, 269-298 (1993) · Zbl 0968.90521
[6] Lee, S. M.; Jung, H. -.J.: A multi-objective production planning model in a flexible manufacturing environment. International journal of production research 27, 1981-1992 (1989)
[7] Schaffer JD. Multiple objective optimization with vector evaluated genetic algorithms. Proceedings of the First ICGA, 1985. p. 93--100.
[8] Murata, T.; Ishibuchi, H.; Tanaka, H.: Multi-objective genetic algorithm and its application to flowshop scheduling. Computers and industrial engineering 30, 957-968 (1996)
[9] Hyun, C. J.; Kim, Y.; Kin, Y. K.: A genetic algorithm for multiple objective sequencing problems in mixed model assembly. Computers & operations research 25, 675-690 (1998) · Zbl 1042.90553
[10] Omori, R.; Sakakibara, Y.; Suzuki, A.: Applications of genetic algorithms to optimization problems in the solvent extraction process for spent nuclear fuel. Nuclear technology 118, 26-31 (1997)
[11] Chen, Y.; Narita, M.; Tsuji, M.; Sa, S.: A genetic algorithm approach to optimization for the radiological worker allocation problem. Health physics 70, 180-186 (1996)
[12] Marett, R.; Wright, M.: A comparison of neighborhood search techniques for multi-objective combinatorial problems. Computers and operations research 23, 465-483 (1996) · Zbl 0847.90082
[13] Yim, S. J.; Lee, D. Y.: Multiple objective scheduling for flexible manufacturing systems using Petri nets and heuristic search. Proceedings IEEE international conference on systems, man, and cybernetics 4, 2984-2989 (1996)
[14] Jaszkiewicz, A.: A metaheuristic approach to multiple objective nurse scheduling. Foundations of computing and decision sciences 22, 169-183 (1997) · Zbl 0902.90137
[15] Cieniawski, S. E.; Eheart, J. W.; Ranjithan, S.: Using genetic algorithms to solve a multiobjective groundwater monitoring problem. Water resources research 31, 399-409 (1995)
[16] Fowler, J. W.; Horng, S. -.M.; Cochran, J. K.: A hybridized genetic algorithm to solve parallel machine problem scheduling problem with sequence dependent setups. International journal of manufacturing technology and management 1, 3-4 (2000)