zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Modeling the planning and scheduling across the outsourcing supply chain: a chaos-based fast tabu-SA approach. (English) Zbl 1141.90408
Summary: Planning and scheduling are the interrelated manufacturing functions and should be solved simultaneously to achieve the real motives of integration in manufacturing. In this paper, we have addressed the advanced integrated planning and scheduling problem in a rapidly changing environment, where the selection of outsourcing machine/operation, meeting the customers (single or multiple) due date, minimizing the makespan are the main objectives while satisfying several technological constraints. We developed a mixed integer programming model for integrated planning and scheduling across the outsourcing supply chain and showed how such models can be used to make strategic decisions. It is a computationally complex and mathematically intractable problem to solve. In this paper, a chaos-based fast Tabu-simulated annealing (CFTSA) incorporating the features of SA, Tabu and Chaos theory is proposed and applied to solve a large number of problems with increased complexity. In CFTSA algorithm, five types of perturbation schemes are developed and Cauchy probability function is used to escape from local minima and achieve the optimal/near optimal solution in a lesser number of iterations. An intensive comparative study shows the robustness of proposed algorithm. Percentage Heuristic gap is used to show the effectiveness and two ANOVA analyses are carried out to show the consistency and accuracy of the proposed approach.
MSC:
90B30Production models
90B35Scheduling theory, deterministic
90B06Transportation, logistics