ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (11)
  • linear programming  (11)
  • AMS(MOS): 65N30
  • Springer  (11)
  • American Meteorological Society
  • Blackwell Publishing Ltd
  • Elsevier
  • International Union of Crystallography
  • Taylor & Francis
  • 1995-1999  (11)
  • 1985-1989
  • 1980-1984
  • 1930-1934
  • 1997  (11)
  • Mathematics  (10)
  • Economics  (7)
  • Geography  (1)
  • Political Science
  • Natural Sciences in General
  • Geosciences
Collection
  • Articles  (11)
Keywords
Publisher
  • Springer  (11)
  • American Meteorological Society
  • Blackwell Publishing Ltd
  • Elsevier
  • International Union of Crystallography
  • +
Years
  • 1995-1999  (11)
  • 1985-1989
  • 1980-1984
  • 1930-1934
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 19 (1997), S. 147-157 
    ISSN: 1436-6304
    Keywords: Key words: production ; scheduling ; printed circuit board assembly ; modelling ; linear programming ; aggregational error ; decision support ; Schlüsselwörter: Produktion ; Ablaufplanung ; Leiterplattenbestückung ; Modellierung ; lineare Programmierung ; Aggregationsfehler ; Entscheidungsunterstützung ; S′jm = Sjm ; SFj(r)(12)
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung. Bei der Kleinserienmontage von Leiterplatten besteht das Problem der Einlastungsplanung darin, ein Tagesprogramm an Produktionsaufträgen zusammenzustellen, die gemeinsam in das Produktionssystem eingeschleust werden. Jeder Produktionsauftrag entspricht einem bestimmten Leiterplattentyp. Wechselt man bei der automatischen Bestückung von Leiterplatten zu einem neuen Leiterplattentyp, so fallen erhebliche Rüstzeiten an, die davon abhängen, wie viele Bauteilezuführungen im Magazin der Bestückungsautomaten ausgewechselt werden müssen. Zur Unterstützung dieses Entscheidungsproblems werden zwei unterschiedliche Modelle der linearen Optimierung entwickelt. Die beiden Modelle unterscheiden sich vor allem durch ihren Aggregationsgrad und ihren Rechenaufwand. Zur Verringerung des Aggregationsfehlers wird ein auf der Fuzzy-Set-Theorie beruhender Ansatz zur Abschätzung der bei automatischen SMD-Bestückungsautomanten auftretenden Rüstzeiten entwickelt. Hierbei wird als industrielles Anwendungsbeispiel die Leiterplattenbestückung in einem bedeutenden Elektronikunternehmen betrachtet. Die durchgeführte numerische Untersuchung zeigt, daß das hochaggregierte Fuzzy-LP-Modell zu hinreichend genauen Lösungen führt und erheblich geringeren Rechenaufwand verursacht als ein detaillierteres LP-Modell. Außerdem wird die praktische Eignung des Fuzzy-LP-Modells für den Einsatz innerhalb eines interaktiven Entscheidungsunterstützungssystems verdeutlicht.
    Notes: Abstract. The problem of workload planning in small lot printed circuit board (PCB) assembly concerns the determination of the daily mix of production orders to be released into the production system. When switching from one production order (board type) to another, a considerable set-up time is incurred based on the number of component feeders to be replaced in the component magazine of the assembly machines. To support the order-mix decision faced by a major electronics manufacturer, two versions of a linear programming model are developed. The models differ primarily in their degree of aggregation and their computational effort. In order to reduce the aggregational error incurred, a fuzzy approach is developed to estimate the number of component set-ups at automatic SMD placement machines. Our numerical investigation reveals that sufficiently accurate solutions may be obtained from a highly aggregate fuzzy LP-model and this is achieved with considerably less computational effort than with a more detailed LP-model. We also demonstrate the potential suitability of the fuzzy LP-model for implementation within an interactive decision support system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 19 (1997), S. 147-157 
    ISSN: 1436-6304
    Keywords: production ; scheduling ; printed circuit board assembly ; modelling ; linear programming ; aggregational error ; decision support ; Produktion ; Ablaufplanung ; Leiterplattenbestückung ; Modellierung ; lineare Programmierung ; Aggregationsfehler ; Entscheidungsunterstützung
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Bei der Kleinserienmontage von Leiterplatten besteht das Problem der Einlastungsplanung darin, ein Tagesprogramm an Produktionsaufträgen zusammenzustellen, die gemeinsam in das Produktionssystem eingeschleust werden. Jeder Produktionsauftrag entspricht einem bestimmten Leiterplattentyp. Wechselt man bei der automatischen Bestückung von Leiterplatten zu einem neuen Leiterplattentyp, so fallen erhebliche Rüstzeiten an, die davon abhängen, wie viele Bauteilezuführungen im Magazin der Bestückungsautomaten ausgewechselt werden müssen. Zur Unterstützung dieses Entscheidungsproblems werden zwei unterschiedliche Modelle der linearen Optimierung entwickelt. Die beiden Modelle unterscheiden sich vor allem durch ihren Aggregationsgrad und ihren Rechenaufwand. Zur Verringerung des Aggregationsfehlers wird ein auf der Fuzzy-Set-Theorie beruhender Ansatz zur Abschätzung der bei automatischen SMD-Bestückungsautomanten auftretenden Rüstzeiten entwickelt. Hierbei wird als industrielles Anwendungsbeispiel die Leiterplattenbestückung in einem bedeutenden Elektronikunternehmen betrachtet. Die durchgeführte numerische Untersuchung zeigt, daß das hochaggregierte Fuzzy-LP-Modell zu hinreichend genauen Lösungen führt und erheblich geringeren Rechenaufwand verursacht als ein detaillierteres LP-Modell. Außerdem wird die praktische Eignung des Fuzzy-LP-Modells für den Einsatz innerhalb eines interaktiven Entscheidungsunterstützungssystems verdeutlicht.
    Notes: Abstract The problem of workload planning in small lot printed circuit board (PCB) assembly concerns the determination of the daily mix of production orders to be released into the production system. When switching from one production order (board type) to another, a considerable set-up time is incurred based on the number of component feeders to be replaced in the component magazine of the assembly machines. To support the order-mix decision faced by a major electronics manufacturer, two versions of a linear programming model are developed. The models differ primarily in their degree of aggregation and their computational effort. In order to reduce the aggregational error incurred, a fuzzy approach is developed to estimate the number of component set-ups at automatic SMD placement machines. Our numerical investigation reveals that sufficiently accurate solutions may be obtained from a highly aggregate fuzzy LP-model and this is achieved with considerably less computational effort than with a more detailed LP-model. We also demonstrate the potential suitability of the fuzzy LP-model for implementation within an interactive decision support system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 19 (1997), S. 67-74 
    ISSN: 1436-6304
    Keywords: Deckung des Bedarfs an Klassenräumen ; lineare Optimierung ; gemischt ganzzahlige Optimierung ; Covering classroom requirements ; linear programming ; mixed integer programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Abstract The city of Hamburg expects for the next years enormously increasing rates of pupils. Covering the additional need of classrooms by new building is very expensive. It would be better to avoid this by making good use of the existing resources. The possible steps for covering the requirements and the restrictions are explained subsequently. There are a lot of alternatives, which must be coordinated for a “good” solution in a suitable way. The mathematical model for this problem is described furthermore. The model in question belongs to the class of mixed integer problems. Finally the standard optimization software SCICONIC, which is used for solving the mixed integer problem, is introduced and the embedding of SCICONIC into the architecture of the evolved planning system is described. Because the users of the system are officers without knowledge in electronic data processing and mathematical programming, a user friendly interface is of special importance in this case. This paper does not include new mathematical cognition, but describes the skilled use of known OR-techniques in a real software project.
    Notes: Zusammenfassung Die Stadt Hamburg sieht in den nächsten Jahren eine beträchtliche Schülerwelle auf sich zukommen. Daraus resultiert zusätzlicher Klassenraumbedarf, der durch Neubau nur sehr kostspielig gedeckt werden kann. Durch systematische Ausnutzung von bestehenden Raumreserven lassen sich teure Neubaumaßnahmen weitgehend vermeiden. Im folgenden werden zunächst die möglichen Maßnahmen zur Raumbedarfsdeckung mit ihren einschränkenden Bedingungen aufgezeigt. Die Maßnahmen erlauben eine Vielzahl von Handlungsalternativen, die zum wirksamen Einsatz optimal aufeinander abgestimmt werden müssen. Das mathematische Modell zur Lösung dieses Problems wird in der weiteren Folge beschrieben. Es handelt sich um ein gemischt ganzzahliges Optimierungsproblem. Abschließend wird die zur Lösung eingesetzte Standard-Optimierungs-Software SCICONIC vorgestellt und die Einbindung von SCICONIC in das entwickelte Raumplanungssystem geschildert. Da die Anwender des Systems Sachbearbeiter ohne DV- und OR-Erfahrung sind, hat hier Benutzerfreundlichkeit eine besonders hohe Bedeutung. Der vorliegende Aufsatz erhebt nicht den Anspruch auf neue mathematische Erkenntnisse, sondern er beschreibt die fachgerechte Anwendung bekannter OR-Verfahren in einem Software-Projekt der Praxis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 19 (1997), S. 67-74 
    ISSN: 1436-6304
    Keywords: Schlüsselwörter: Deckung des Bedarfs an Klassenräumen ; lineare Optimierung ; gemischt ganzzahlige Optimierung ; Key words: Covering classroom requirements ; linear programming ; mixed integer programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Abstract. The city of Hamburg expects for the next years enormously increasing rates of pupils. Covering the additional need of classrooms by new building is very expensive. It would be better to avoid this by making good use of the existing resources. The possible steps for covering the requirements and the restrictions are explained subsequently. There are a lot of alternatives, which must be coordinated for a ``good'' solution in a suitable way. The mathematical model for this problem is described furthermore. The model in question belongs to the class of mixed integer problems. Finally the standard optimization software SCICONIC, which is used for solving the mixed integer problem, is introduced and the embedding of SCICONIC into the architecture of the evolved planning system is described. Because the users of the system are officers without knowledge in electronic data processing and mathematical programming, a user friendly interface is of special importance in this case. This paper does not include new mathematical cognition, but describes the skilled use of known OR-techniques in a real software project.
    Notes: Zusammenfassung. Die Stadt Hamburg sieht in den nächsten Jahren eine beträchtliche Schülerwelle auf sich zukommen. Daraus resultiert zusätzlicher Klassenraumbedarf, der durch Neubau nur sehr kostspielig gedeckt werden kann. Durch systematische Ausnutzung von bestehenden Raumreserven lassen sich teure Neubaumaßnahmen weitgehend vermeiden. Im folgenden werden zunächst die möglichen Maßnahmen zur Raumbedarfsdeckung mit ihren einschränkenden Bedingungen aufgezeigt. Die Maßnahmen erlauben eine Vielzahl von Handlungsalternativen, die zum wirksamen Einsatz optimal aufeinander abgestimmt werden müssen. Das mathematische Modell zur Lösung dieses Problems wird in der weiteren Folge beschrieben. Es handelt sich um ein gemischt ganzzahliges Optimierungsproblem. Abschließend wird die zur Lösung eingesetzte Standard-Optimierungs-Software SCICONIC vorgestellt und die Einbindung von SCICONIC in das entwickelte Raumplanungssystem geschildert. Da die Anwender des Systems Sachbearbeiter ohne DV- und OR-Erfahrung sind, hat hier Benutzerfreundlichkeit eine besonders hohe Bedeutung. Der vorliegende Aufsatz erhebt nicht den Anspruch auf neue mathematische Erkenntnisse, sondern er beschreibt die fachgerechte Anwendung bekannter OR-Verfahren in einem Software-Projekt der Praxis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Order 14 (1997), S. 269-278 
    ISSN: 1572-9273
    Keywords: preemptive scheduling ; non preemptive scheduling ; linear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The general non preemptive multiprocessor scheduling problem (NPMS) is NP-Complete, while in many specific cases, the same problem is Time-polynomial. A first connection between PMS and linear programming was established by Yannanakis, Sauer and Stone, who associated to any PMS instance some specific linear program. The main result inside this paper consists in a characterization of the partially ordered structures which allow the optimal values of any associated PMS instance to be equal to the optimal values of the corresponding linear programs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 73 (1997), S. 253-276 
    ISSN: 1572-9338
    Keywords: Data Envelopment Analysis ; game theory ; efficiency ; linear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Dominant Competitive Factors, unique solutions to a new class of two-person ratio efficiency games, are introduced as a means for distinguishing exceptional aspects of individual performance. The vectors of input-output multipliers thus obtained may be analyzed collectively so that commonalities within groups and differences across groups may be discovered. The method is applied to "Program Follow-Through", the original impetus for developing Data Envelopment Analysis. Our results are compared with those of the earlier study, whereupon substantial new insights are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 73 (1997), S. 299-321 
    ISSN: 1572-9338
    Keywords: Discriminant Analysis ; linear programming ; Data Envelopment Analysis ; insurance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Data Envelopment Analysis (DEA) and Discriminant Analysis (DA) are similar in that both may be used to classify units as exhibiting either good or poor performance. Both use linear programming to select a set of factor weights that determines group membership relative to a "threshold" or hyperplane. This similarity was pointed out in an earlier paper, in which several methods which combine aspects of DA and DEA were suggested. This paper further develops one of these hybrid methods, which can be described as an efficiency approach to Discriminant Analysis. The various formulation options are considered with respect to their effects on solution quality and stability. The stability issue is raised by the fact that solution equivalence under data transformation (including both translation and rotation) is considered important in DA, and has significantly affected model formulation. Thus, the data transformation issue is studied for the hybrid method, and also for DEA. The hybrid method is applied to an insurance data set, where some firms are solvent and others in financial distress, to further evaluate the method and its possible formulations. DA methods are applied to the same data set to provide a basis for comparison. The hybrid method is shown to outperform the general discriminant models.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Water resources management 11 (1997), S. 165-184 
    ISSN: 1573-1650
    Keywords: optimization ; linear programming ; simulation ; irrigation planning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract A methodology is presented for planning the operation of the Fuerte-Carrizo irrigation system in northwest Mexico. The system has two storage dams, two irrigation districts, and water transfer capabilities between both dams. The methodology uses a combination of linear programming (LP) and simulation. The LP model maximizes the net return of the farmers, subject to restrictions of the system, availability of water and land, and water transfer relationships. The simulation model is programmed as a microcomputer interactive package simulating the performance of the system. The methodology has proven to be a useful tool to assist those responsible for the operation of the irrigation system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 93 (1997), S. 301-319 
    ISSN: 1573-2878
    Keywords: Convex sets ; polyhedral convex sets ; separation theorem ; Banach spaces ; duality theory ; weak topology ; linear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The subject of this paper is to study the problem of the minimum distance to the complement of a convex set. Nirenberg has stated a duality theorem treating the minimum norm problem for a convex set. We state a duality result which presents some analogy with the Nirenberg theorem, and we apply this result to polyhedral convex sets. First, we assume that the polyhedral set is expressed as the intersection of some finite collection of m given half-spaces. We show that a global solution is determined by solving m convex programs. If the polyhedral set is expressed as the convex hull of a given finite set of extreme points, we show that a global minimum for a polyhedral norm is obtained by solving a finite number of linear programs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 46 (1997), S. 131-142 
    ISSN: 1432-5217
    Keywords: Ellipsoid method ; linear programming ; simplex ; volume
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Yamnitsky and Levin proposed a variant of Khachiyan's ellopsoid method for testing feasibility of systems of linear inequalities that also runs in polynomial time but uses simplices instead of ellipsoids. Starting with then-simplexS and the half-space {x¦a Tx ≤ β}, the algorithm finds a simplexS YL of small volume that enclosesS ∩ {x¦a Tx ≤ β}. We interpretS YL as a simplex obtainable by point-sliding and show that the smallest such simplex can be determined by minimizing a simple strictly convex function. We furthermore discuss some numerical results. The results suggest that the number of iterations used by our method may be considerably less than that of the standard ellipsoid method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...