ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
Sammlung
Schlagwörter
Verlag/Herausgeber
Sprache
Erscheinungszeitraum
  • 1
    facet.materialart.
    Unbekannt
    Mathematics of Economics and Business (2021)
    Taylor & Francis
    Details
    Publikationsdatum: 2023-09-12
    Beschreibung: For all students who wish to understand current economic and business literature, knowledge of mathematical methods has become a prerequisite. Clear and concise, with precise definitions and theorems, Werner and Sotskov cover all the major topics required to gain a firm grounding in this subject including sequences, series, applications in finance, functions, differentiations, differentials and difference equations, optimizations with and without constraints, integrations and much more. Containing exercises and worked examples, precise definitions and theorems as well as economic applications, this book provides the reader with a comprehensive understanding of the mathematical models and tools used in both economics and business.
    Schlagwort(e): inverse ; mapping ; horners ; scheme ; linear ; real ; number ; cos ; equations ; matrix ; bic Book Industry Communication::K Economics, finance, business & management::KC Economics ; bic Book Industry Communication::K Economics, finance, business & management::KJ Business & management ; bic Book Industry Communication::P Mathematics & science::PB Mathematics
    Sprache: Englisch
    Format: image/jpeg
    Format: image/jpeg
    Format: image/jpeg
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    E-BOOK
  • 2
    facet.materialart.
    Unbekannt
    Exact and Heuristic Scheduling Algorithms (2021)
    MDPI - Multidisciplinary Digital Publishing Institute
    Details
    Publikationsdatum: 2024-04-11
    Beschreibung: This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others.
    Schlagwort(e): TA1-2040 ; T1-995 ; repairing scheme ; makespan ; complexity ; uniform parallel machine problems ; flow shop ; uniform parallel machines ; total tardiness ; permutations ; uncertainty ; shop floor performance ; heuristic algorithm ; s-precedence constraints ; heuristics ; time windows ; auto-carrier transportation problem (ACTP) ; blocking ; computational experiment ; scheduling ; manufacturing ; optimal algorithm ; precedence constraints ; flowshop ; flow-shop ; flow shop problem ; simulated annealing ; traveling salesman problem ; resource leveling ; makespan criterion ; project scheduling ; uncertain duration ; time complexity ; heuristic ; quadratic programming ; feasible loading ; exact algorithms ; resource leveling problem ; job shop problem ; unavailability constraints ; job shop ; job-shop ; job shop scheduling ; thema EDItEUR::T Technology, Engineering, Agriculture, Industrial processes::TB Technology: general issues::TBX History of engineering and technology
    Sprache: Englisch
    Format: application/octet-stream
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    E-BOOK
  • 3
    facet.materialart.
    Unbekannt
    Graph-Theoretic Problems and Their New Applications (2021)
    MDPI - Multidisciplinary Digital Publishing Institute
    Details
    Publikationsdatum: 2023-12-20
    Beschreibung: Graph theory is an important area of applied mathematics with a broad spectrum of applications in many fields. This book results from aSpecialIssue in the journal Mathematics entitled “Graph-Theoretic Problems and Their New Applications”. It contains 20 articles covering a broad spectrum of graph-theoretic works that were selected from 151 submitted papers after a thorough refereeing process. Among others, it includes a deep survey on mixed graphs and their use for solutions ti scheduling problems. Other subjects include topological indices, domination numbers of graphs, domination games, contraction mappings, and neutrosophic graphs. Several applications of graph theory are discussed, e.g., the use of graph theory in the context of molecular processes.
    Schlagwort(e): QA1-939 ; Q1-390 ; Zagreb indices ; n/a ; generating function ; mitotic cell cycle ; Mycielskian graph ; evolution theory ; grids ; “partitions” of wheel graph ; generalized hypertree ; connectivity ; single-valued neutrosophic graph ; degree of a vertex ; domination game ; interval-valued intuitionistic fuzzy graph ; directed cycle ; makespan criterion ; total-colored graph ; bipartite matching extendable graph ; stochastic convergence ; bipartite neutrosophic graph ; signless Laplacian ; complete neutrosophic graph ; k-trees ; enhanced hypercube ; b-metric space ; resistance distance ; Wiener index ; mixed graph ; line graph ; NP-hard ; generalized first Zagreb index ; inverse degree index ; sum lordeg index ; Edge Wiener ; chromatic polynomial ; degree of vertex ; complement neutrosophic graph ; graphic contraction mappings ; embedding ; Cartesian product ; k-rainbow domination number ; distance between two vertices ; evolution algebra ; k-rainbow dominating function ; PI index ; subtree ; component ; competition-independence game ; interval-valued fuzzy graph ; b-metric-like space ; induced matching extendable ; edge coloring ; degree of edge ; approximation methods ; chromatic index ; join of graphs ; genetic algorithm ; hypergraph ; edge congestion ; complement ; polynomials in graphs ; vertex coloring ; interval-valued neutrosophic graph ; spanning tree ; Kempe chain ; general contractive mappings ; DD index ; wireless multihop network and social network ; distance ; evolutionary approach ; complexity analysis ; neutrosophic graph ; Kempe-locking ; wheel graph ; Birkhoff diamond ; domination number ; k-extendable ; degree-Kirchhoff index ; adjacent matrix ; perfect matching ; spectral radius ; normalized Laplacian ; corona product ; road transport network ; extremal values ; bound ; chromatic number ; graph coloring ; combinatorial optimization ; reformulated Zagreb indices ; wirelength ; intuitionistic fuzzy graph ; unit-time scheduling ; fan graph ; bic Book Industry Communication::P Mathematics & science
    Sprache: Englisch
    Format: application/octet-stream
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    E-BOOK
  • 4
    Digitale Medien
    Digitale Medien
    Heuristics for permutation flow shop scheduling with batch setup times (1996)
    Springer
    OR spectrum 18 (1996), S. 67-80 
    Details
    ISSN: 1436-6304
    Schlagwort(e): Flow shop scheduling ; batch setup times ; group technology ; manufactoring cells ; heuristics ; Flow Shop Probleme ; Setup Zeiten ; Gruppentechnologie ; Heuristiken
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung In dieser Arbeit werden Permutationsflußprobleme mit Batch Setup Zeiten betrachtet. Jeder Job hat die gleiche technologische Reihenfolge. Die Jobs sind in Gruppen eingeteilt. Gegeben sind Bearbeitungszeient ij für Jobi auf Maschinej sowie Setup Zeitens rj auf Maschinej, wenn ein Job derr-ten Gruppe nach einem Job einer anderen Gruppe bearbeitet wird. Es wird vorausgesetzt, daß auf allen Maschinen die gleiche Reihenfolge der Jobs gewählt wird. In der Arbeit werden sowohl das Problem der Minimierung der Gesamtbearbeitungszeit als auch das Problem der Minimierung der Summe der Bearbeitungsendtermine mit Item oder Batch Verfügbarkeit betrachtet. Für diese Probleme werden konstruktive und iterative Algorithmen entwickelt. Die konstruktiven Algorithmen basieren auf Einfügungstechniken mit Beamsuche. Es werden geeignete Nachbarschaftsstrukturen eingeführt und auf lokaler Suche und Wiedereinfügungstechniken basierende iterative Algorithmen entwickelt. Die Algorithmen wurden an Beispielen mit bis zu 80 Jobs getestet.
    Notizen: Abstract In this paper we consider permutation flow shop scheduling problems with batch setup times. Each job has to be processed on each machine once and the technological routes are identical for all jobs. The set of jobs is divided into groups. There are given processing timest ij of jobi on machinej and setup timess rj on machinej when a job of ther-th group is processed after a job of another group. It is assumed that the same job order has to be chosen on each machine. We consider both the problems of minimizing the makespan and of minimizing the sum of completion times, where batch or item availability of the jobs is assumed. For these problems we give various constructive and iterative algorithms. The constructive algorithms are based on insertion techniques combined with beam search. We introduce suitable neighbourhood structures for such problems with batch setup times and describe iterative algorithms that are based on local search and reinsertion techniques. The developed algorithms have been tested on a large collection of problems with up to 80 jobs.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01539731
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 5
    Digitale Medien
    Digitale Medien
    Preface (1998)
    Springer
    Annals of operations research 83 (1998), S. 0-0 
    Details
    ISSN: 1572-9338
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1018976501287
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 6
    Digitale Medien
    Digitale Medien
    On the calculation of the stability radiusof an optimal or an approximate schedule (1998)
    Springer
    Annals of operations research 83 (1998), S. 213-252 
    Details
    ISSN: 1572-9338
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract The main objective of this paper is to stimulate interest in stability analysis for scheduling problems. In spite of impressive theoretical results in sequencing and scheduling, up to now the implementation of scheduling algorithms with a rather deep mathematical back-ground in production planning, scheduling and control, and in other real-life problems with sequencing aspects is limited. In classical scheduling theory, mainly deterministic systems are considered and the processing times of all operations are supposed to be given in advance. Such problems do not often arise in practice: Even if the processing times are known before applying a scheduling procedure, OR workers are forced to take into account the precision of equipment, which is used to calculate the processing times, round-off errors in the calculation of a schedule, errors within the practical realization of a schedule, machine breakdowns, additional jobs, and so on. This paper is devoted to the calculation of the stability radius of an optimal or an approximate schedule. We survey some recent results in this field and derive new results in order to make this approach more suitable for practical use. Computational results on the calculation of the stability radius for randomly generated job shop scheduling problems are presented. The extreme values of the stability radius are considered in more detail. The new results are amply illustrated with examples.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1018960030420
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 7
    Digitale Medien
    Digitale Medien
    Batch scheduling with deadlines on parallel machines (1998)
    Springer
    Annals of operations research 83 (1998), S. 23-40 
    Details
    ISSN: 1572-9338
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract The problem of scheduling G groups of jobs on m parallel machines is considered. Each group consists of several identical jobs. We have to find splittings of groups into batches (i.e. sets of jobs to be processed contiguously) and to schedule the batches on the machines. It is possible for different batches of the same group to be processed concurrently on different machines. However, at any time, a batch can be processed on at most one machine. A sequence-independent machine set-up time is required immediately before a batch of a group is processed. A deadline is associated with each group. The objective is to find a schedule which is feasible with respect to deadlines. The problem is shown to be NP-hard even for the case of two identical machines, unit processing times, unit set-up times and a common deadline. It is strongly NP-hard if machines are uniform, the number of jobs in each group is equal and processing times, set-up times and deadlines are unit. Special cases which are polynomially solvable are discussed. For the general problem, a family {DPɛ} of approximation algorithms is constructed. A new dynamic rounding technique is used to develop DP ɛ. For any ɛ 〉 0, DP ɛ delivers a schedule in which the completion time of each group is at most (1 + ɛ) times the value of its deadline if there exists a schedule which is feasible with respect to the deadlines. The time complexity of DP ɛ is O(G 2m+1/ɛ2m).
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1018912114491
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 8
    Digitale Medien
    Digitale Medien
    Besonderheiten bei der Ozonolyse substituierter Cyclopentene (1995)
    New York, NY : Wiley-Blackwell
    Journal für Praktische Chemie/Chemiker-Zeitung 337 (1995), S. 409-412 
    Details
    ISSN: 0941-1216
    Schlagwort(e): Chemistry ; Organic Chemistry
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie
    Notizen: Details on Ozonolyses of Substituted Cyclopentenes
    Zusätzliches Material: 1 Tab.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1002/prac.19953370187
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 9
    Digitale Medien
    Digitale Medien
    α-Oxosulfone, 5. Reaktionen eines cyclischen α-Ketosulfons (1983)
    Weinheim : Wiley-Blackwell
    Liebigs Annalen 1983 (1983), S. 1739-1743 
    Details
    ISSN: 0170-2041
    Schlagwort(e): Chemistry ; Organic Chemistry
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie
    Beschreibung / Inhaltsverzeichnis: α-Oxosulfones, 5. - reactions of a Cyclic α-Ketosulfone5,5-Dioxo-6H-dibenzo[b,d]thiopyran-6-one (4) as the first „real α-ketosulfone“ was isolated, and some of its reactions were studied. Apparently, 4 represents formally a border case between a thioester S,S-dioxide and an „α-ketosulfone“.
    Notizen: Als erstes „wirkliches α-Ketosulfon“ wurde 5,5-Dioxo-6H-dibenzo[b,d]-thiopyran-6-on (4) isoliert. Beim Studium einiger seiner Reaktionen zeigte sich, daß 4 formal einen Grenzfall zwischen einem Carbonsäurethioester-S,S-dioxid und einem „α-Ketosulfon“ darstellt.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1002/jlac.198319831009
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 10
    Digitale Medien
    Digitale Medien
    α-Oxosulfone, 2. Synthesen von α-Oxosulfonen durch Ozonspaltungen (1979)
    Weinheim : Wiley-Blackwell
    Liebigs Annalen 1979 (1979), S. 1977-1991 
    Details
    ISSN: 0170-2041
    Schlagwort(e): Chemistry ; Organic Chemistry
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie
    Beschreibung / Inhaltsverzeichnis: α-Oxosulfones, 2.  -  Synthesis of α-Oxosulfones by OzonolysisThe hitherto unknown α-oxosulfones 2 have been synthesized by ozonolytic cleavage of α-diazosulfones 1 (method A) or α-(methoxymethylene)sulfones 6 (method B).
    Notizen: Durch Ozonspaltung von α-Diazosulfonen 1 (Methode A) oder von α-(Methoxymethylen)sulfonen 6 (Methode B) in aprotischem Medium werden bisher nicht bekannte α-Oxosulfone 2 hergestellt.
    Zusätzliches Material: 6 Tab.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1002/jlac.197919791208
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...