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-objective genetic algorithm for mixed-model sequencing on JIT assembly lines. (English) Zbl 1077.90027
Summary: This paper presents a Multi-Objective Genetic Algorithm (MOGA) approach to a Just-In-Time (JIT) sequencing problem where variation of production rates and number of setups are to be optimized simultaneously. These two objectives are typically inversely correlated with each other, and therefore, simultaneously optimization of both is challenging. Moreover, this type of problem is NP-hard, hence attainment of IP/LP solutions, or solutions via Total Enumeration (TE) is computationally prohibitive. The MOGA approach searches for locally Pareto-optimal or locally non-dominated frontier where simultaneous minimization of the production rates variation and the number of setups is desired. Performance of the proposed MOGA was compared against a TE scheme in small problems and also against three other search heuristics in small, medium and large problems. Experimental results show that the MOGA performs very well when compared against TE in a considerably shorter time. It also outperforms the comparator algorithms in terms of quality of solutions at the same level of diversity in reasonable amount of CPU time.
90B35Scheduling theory, deterministic
90C29Multi-objective programming; goal programming
90C59Approximation methods and heuristics