Skip to main navigation Skip to main content
info(at)avldigital.remove-this.de
Deutsch English
Narrow Search
Search narrowed by
Last searches

Results for *

Displaying results 1 to 25 of 489.

  1. Simulation-based performance analysis and optimisation of electronics assembly equipment
    Author: Grunow, Martin; Günther, Hans-Otto; Föhrenbach, Andreas
    Published: 2000
    Publisher:  Techn. Univ., Wirtschaftswiss. Dokumentation, Berlin

    Location:
    Staatsbibliothek zu Berlin - Preußischer Kulturbesitz, Haus Potsdamer Straße
    Signature:
    1 B 70646
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Staats- und Universitätsbibliothek Bremen
    Signature:
    bc 1351-2000,3
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Niedersächsische Staats- und Universitätsbibliothek Göttingen
    Signature:
    1 : Z 104.510:2000/3
    Inter-library loan:
    No inter-library loan

    Location:
    Technische Informationsbibliothek (TIB) / Leibniz-Informationszentrum Technik und Naturwissenschaften und Universitätsbibliothek
    Signature:
    RA 3077(2000,3)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    W 66 (2000.3)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan
    Export to reference management software   RIS file
      BibTeX file
    Source: Staatsbibliothek zu Berlin
    Language: English
    Media type: Book
    Format: Print
    Series: Diskussionspapier / Technische Universität Berlin, Wirtschaftswissenschaftliche Dokumentation ; 2000,3
    Subjects: Produktionsplanung; Scheduling-Verfahren; Halbleiter; Theorie
    Scope: 14, IV Bl, graph. Darst
  2. Modifikationsbedarf und -möglichkeiten der auftragsorientierten Produktionsprogrammplanung aus der Perspektive der opportunistischen Koordinierung
    Author: Corsten, Hans
    Published: 2000
    Publisher:  Univ., Lehrstuhl für Produktionswirtschaft, Kaiserslautern

    Location:
    Universitätsbibliothek Braunschweig
    Signature:
    3489-2640
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Technische Universität Hamburg, Universitätsbibliothek
    Signature:
    3218-3652

    Location:
    Technische Informationsbibliothek (TIB) / Leibniz-Informationszentrum Technik und Naturwissenschaften und Universitätsbibliothek
    Signature:
    RR 7811(35)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Thüringer Universitäts- und Landesbibliothek
    Signature:
    WIR:AJ:700:U58 K1:-35:2000
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    W 1034 (35)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Bibliotheks-und Informationssystem der Carl von Ossietzky Universität Oldenburg (BIS)
    Signature:
    bwl 328 SA 0701-35
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Universitätsbibliothek Osnabrück
    Signature:
    QBB / Pro 35
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Universitätsbibliothek Rostock
    Signature:
    ZB 6739 (35)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    UB Weimar
    Signature:
    Mag Wg 4082
    Inter-library loan:
    Unlimited inter-library loan, copies and loan
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Source: Union catalogues
    Language: German
    Media type: Book
    Format: Print
    RVK Categories: QP 500
    Series: Schriften zum Produktionsmanagement ; 35
    Subjects: Produktprogramm; Auftragsfertigung; Scheduling-Verfahren; Computernetz; Theorie
    Scope: 17 Bl, graph. Darst, 30 cm
    Notes:

    Literaturverz. Bl. 14 - 17
  3. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches
    Author: Feldmann, Martin; Biskup, Dirk
    Published: 1999
    Publisher:  Univ., Fak. für Wirtschaftswiss., Bielefeld

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    W 111 (425)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan
    Export to reference management software   RIS file
      BibTeX file
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Print
    Series: Discussion paper / Universität Bielefeld, Fak. für Wirtschaftswissenschaften ; Nr. 425
    Subjects: Produktionssteuerung; Scheduling-Verfahren; Heuristik; Theorie
    Scope: 28 Bl, 30 cm
    Notes:

    Literaturverz. Bl. 18 - 19
  4. Reducing passenger delays by rolling stock rescheduling
    Author: Hoogervorst, Rowan; Dollevoet, Twan; Maróti, Gábor; Huisman, Dennis
    Published: [2018]
    Publisher:  [Econometric Institute, Erasmus School of Economics], [Rotterdam]

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    VS 57
    Inter-library loan:
    No inter-library loan
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Volltext (kostenfrei)
    Volltext (kostenfrei)
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 1765/113842
    Series: Econometric Institute research papers ; EI2018, 29
    Subjects: Linienverkehr; Schienenverkehr; Schienenfahrzeug; Scheduling-Verfahren; Niederlande
    Scope: 1 Online-Ressource (circa 33 Seiten), Illustrationen
  5. Optimal policies in hybrid manufacturing, remanufacturing systems with product substitution
    Author: Inderfurth, Karl
    Published: 2002
    Publisher:  Univ., FEMM, Magdeburg

    Location:
    Universitätsbibliothek Braunschweig
    Signature:
    2811-1515
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Universitäts- und Landesbibliothek Sachsen-Anhalt / Zentrale
    Signature:
    ZA 15240 (2002,1/15)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    W 1300 (2002.1)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Print
    Series: Working paper series / Otto von Guericke University, FEMM, Faculty of Economics and Management ; 2002,1
    Subjects: Produktionsplanung; Betriebliche Kreislaufwirtschaft; Substitutionsgüter; Scheduling-Verfahren; Theorie
    Scope: 23 S, graph. Darst
  6. An optimal lot and batch size policy for a single item produced and remanufactured on one machine
    Author: Lindner, Gerd; Buscher, Udo; Flapper, Simme Douwe P.
    Published: 2001
    Publisher:  Univ., FEMM, Magdeburg

    Location:
    Universitätsbibliothek Braunschweig
    Signature:
    2802-2303
    Inter-library loan:
    Unlimited inter-library loan, copies and loan

    Location:
    Universitäts- und Landesbibliothek Sachsen-Anhalt / Zentrale
    Signature:
    ZA 15240 (2001,1/10)
    Inter-library loan:
    No loan of volumes, only paper copies will be sent

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    W 1300 (2001.10)
    Inter-library loan:
    Unlimited inter-library loan, copies and loan
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Print
    Series: Working paper series / Otto von Guericke Univ., FEMM, Faculty of Economics and Management ; 2001,10
    Subjects: Produktionsplanung; Kostenfunktion; Betriebliche Kreislaufwirtschaft; Losgröße; Scheduling-Verfahren; Theorie
    Scope: 40 S, graph. Darst, 21 cm
    Notes:

    Literaturverz. S. 39 - 40
  7. Adaptive control schemes for parameterized heuristic scheduling
    Author: Schirmer, Andreas
    Published: 1998
    Publisher:  [Inst. f. Betriebswirtschaftslehre], Kiel

    For most computationally intractable problems there exists no heuristic which performs best on all instances. Usually, a heuristic characterized as best will perform good on the majority of instances but leave a minority on which other heuristics do... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (488)
    Inter-library loan:
    No inter-library loan

     

    For most computationally intractable problems there exists no heuristic which performs best on all instances. Usually, a heuristic characterized as best will perform good on the majority of instances but leave a minority on which other heuristics do better. In priority rule-based scheduling, attempts to remedy this have been made by combining simple priority rules in a fixed and predetermined way. We investigate another way, viz. the design of adaptive control schemes which dynamically combine algorithms as appropriate, taking into account instance-specific knowledge. We scrutinize recently proposed algorithmic approaches from the open literature. Although these have been used in various settings (e.g. lotsizing and scheduling, course scheduling), a thorough experimental investigation, comparing their performance on standard benchmark instances to that of other contemporary methods, has been lacking. Our research aims to close this gap by validating these approaches on one of the best-researched scheduling problems, viz. the resource-constrained project scheduling problem (RCPSP). We provide the results of a comprehensive computational study. We then show how to improve algorithmic effectiveness by adding a sampling stage; the arising algorithm is almost as effective as the most effective construction methods currently known, and it enjoys several additional advantages over these which facilitate the researcher's task of designing good algorithms.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147585
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 488
    Subjects: Projektmanagement; Scheduling-Verfahren; Heuristik; Theorie
    Scope: II, 34 S., graph. Darst.
  8. Schedulung European soccer leagues
    models, methods, and applications
    Author: Bartsch, Thomas; Drexl, Andreas; Kröger, Stefan
    Published: 2002
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    Generating a regular season schedule is a demanding task for any sports league. In Europe, the creation of a suitable schedule for every national top soccer league not only has to address numerous conflicting inner-league requirements and... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (557)
    Inter-library loan:
    No inter-library loan

     

    Generating a regular season schedule is a demanding task for any sports league. In Europe, the creation of a suitable schedule for every national top soccer league not only has to address numerous conflicting inner-league requirements and preferences. Additionally, the games of the European Cup matches (Champions League, UEFA Cup, National Cup Winners) have to be taken into account. In this paper we consider the case of Germany and Austria, that is the planning problem the "Deutsche Fußball-Bund" (DFB) and the "Österreichische Fußball-Bund" (ÖFB) are confronted with. For both leagues we develop models and algorithms which yield reasonable schedules quickly. The models borrow their expressive power from so-called partially renewable resources. Our approach generates schedules which have been accepted for play once by the DFB and five times by the ÖFB.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147626
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 557
    Subjects: Fußball; Terminplanung; Scheduling-Verfahren; Theorie; Deutschland; Österreich
    Scope: 27 S.
  9. Combinatorial optimisation problems of the assignment type and a partitioning approach
    Author: Klose, Andreas; Drexl, Andreas
    Published: 2001
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    Assignment type problems consist in optimally assigning or allocating a given set of "activities" to a given set of "resources". Optimisation problems of the assignment type have numerous applications in production planning and logistics. A popular... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (545)
    Inter-library loan:
    No inter-library loan

     

    Assignment type problems consist in optimally assigning or allocating a given set of "activities" to a given set of "resources". Optimisation problems of the assignment type have numerous applications in production planning and logistics. A popular approach to solve such problems or to compute lower bounds on the optimal solution value (in case of a minimisation problem) is to employ column generation. By means of considering subsets of "activities" which can feasibly be assigned to a single resource, the problem is reformulated as some kind of set-partitioning problem. Column generation is then used in order to solve the linear relaxation of the reformulation. The lower bound obtainable from this approach may, however, be improved by partitioning the set of resources into subsets and by considering subsets of activities which can feasibly be assigned to subsets of resources. This paper outlines the application of this partitioning method to a number of important combinatorial optimisation problems of the assignment type.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147623
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 545
    Subjects: Scheduling-Verfahren; Ganzzahlige Optimierung; Theorie
    Scope: 23 S.
  10. Professional course scheduling in airline transport pilot training
    a case from Lufthansa flight training
    Author: Schirmer, Andreas; Potzhar, Kathrin
    Published: 2001
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    Several well-known and well-researched problem fields, such as school scheduling or university scheduling, reside in the realm of educational scheduling. Recently, some new course scheduling problems have begun to draw attention, which turn out to... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (539)
    Inter-library loan:
    No inter-library loan

     

    Several well-known and well-researched problem fields, such as school scheduling or university scheduling, reside in the realm of educational scheduling. Recently, some new course scheduling problems have begun to draw attention, which turn out to sport substantially more complex requirements and objectives than the classical course scheduling problems. We refer to their problem field as professional course scheduling. In order to demonstrate its practical relevance, we describe a real-world application. Lufthansa Flight Training GmbH (LFT) offers license, recurrency, emergency, and human factors training for airline, navy, and air force pilots as well as service and emergency training for cabin attendants of more than 50 airlines worldwide. This charges LFT with the problem to develop a monthly schedule for courses, instructors, and rooms that optimizes an objective function measuring adherence to seven different soft constraints while meeting a number of complex precedence, temporal, and resource-related constraints. In the past, LFT did all its scheduling manually, but management was dissatisfied with this process due to the significant cost and time involved. LFT commissioned us to carry out a feasibility study in which the applicability of operations research methods was to be demonstrated. We developed a prototype decision support system which utilizes construction and neighborhood search methods based upon concepts from project scheduling and graph theory. It turned out that significant improvements over the manual process could be realized; in addition, the algorithmic ideas employed are general enough to be easily adapted to other problems in the field of professional course scheduling. The development of a full-fledged decision support system is currently in progress at LFT.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147617
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 539
    Subjects: Unterricht; Luftverkehrsberufe; Scheduling-Verfahren; Deutschland
    Scope: I, 26 S
  11. Lehrgangsplanung für die Ausbildung von Verkehrsflugzeugführern
    Ergebnisse einer Studie bei Lufthansa Flight Training
    Author: Schirmer, Andreas; Potzahr, Kathrin
    Published: 2001
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    Dieser Beitrag ist der Zeit- und Ressourcenplanung der fliegerischen Theorieausbildung bei der Lufthansa Flight Training GmbH (LFT) gewidmet, Gemeinsamkeiten mit ähnlichen Problemen anderer Schulungsanbieter veranlaßten uns, diese als Elemente eines... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (538)
    Inter-library loan:
    No inter-library loan

     

    Dieser Beitrag ist der Zeit- und Ressourcenplanung der fliegerischen Theorieausbildung bei der Lufthansa Flight Training GmbH (LFT) gewidmet, Gemeinsamkeiten mit ähnlichen Problemen anderer Schulungsanbieter veranlaßten uns, diese als Elemente eines eigenständigen Problemfeldes zu betrachten, der Lehrgangsplanung. Der Vergleich mit anderen Gebieten der Ausbildungs- und Schulungsplanung läßt jedoch erkennen, daß die Lehrgangsplanung in ihren Anforderungen deutlich komplexer ist als traditionelle Problemfelder, und begründet damit den Bedarf an geeigneten Lösungsverfahren. Anhand der Problemstellung der LFT haben wir daher beispielhaft Verfahren erarbeitet; diese verwenden diverse algorithmische Ansätze für den Aufbau und die anschließende Verbesserung von Lehrgangsplänen, für die dann mit weiteren Verfahren geeignete Raumzuordnungen entwickelt und verbessert werden. Gemeinsam liefern die Algorithmen Lösungen, die im Hinblick auf alle betrachteten Ziele erheblich besser abschneiden als die von erfahrenene Planern der LFT manuell erstellten Pläne. Ferner benötigt die algorithmische Planung nur Minuten, um die endgültigen fünf Alternativvorschläge zu ermitteln, während die manuelle Planung mehrere Beschäftigungstage beansprucht. Außerdem sind die Verfahrensideen hinreichend allgemein, so daß sie ohne allzugroßen Aufwand an andere Probleme der Lehrgangsplanung angepaßt werden können. Im Ergebnis ist der Nachweis gelungen, daß der Einsatz eines methodengestützten Entscheidungssystems für die Lehrgangsplanung bei der LFT möglich und sinnvoll ist.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: German
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147616
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 538
    Subjects: Unterricht; Luftverkehrsberufe; Scheduling-Verfahren; Deutschland
    Scope: I, 30 S
  12. Self-adapting genetic algorithms with an application to project scheduling
    Author: Hartmann, Sönke
    Published: 1999
    Publisher:  Inst. für Betriebswirtschaftslehre, Kiel

    This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (506)
    Inter-library loan:
    No inter-library loan

     

    This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the best alternative (e.g., the best crossover strategy) a priori. For such cases, we suggest to include alternative components into the genetic algorithm. Indicating the component to be actually used in the genotype, this allows the genetic algorithm to adapt itself. That is, the genetic algorithm learns which of the alternative components is the most successful by means of genetic optimization. In order to demonstrate the potential of the self-adapting genetic algorithm concept, we apply it to the classical resource-constrained project scheduling problem (RCPSP). Motivated by previous computational studies as well as theoretical insight, we employ two different decoding procedures and leave the decision which of them to select to the evolution. The approach is further enhanced by a problem-specific local search extension. An in-depth computational experimental analysis shows that the self-adapting genetic algorithm approach is currently the most promising heuristic for the RCPSP.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147594
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 506
    Subjects: Projektmanagement; Scheduling-Verfahren; Mathematische Optimierung; Theorie; Genetische Algorithmen
    Scope: 22 S, graph. Darst
  13. Network decomposition techniques for resource-constrained project scheduling
    Author: Sprecher, Arno
    Published: 1999
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    Numerous exact algorithms have been developed for solving the resource-constrained project scheduling problem. Experimental studies have shown that currently even projects with only 60 activities cannot be optimally solved within a reasonable amount... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (505)
    Inter-library loan:
    No inter-library loan

     

    Numerous exact algorithms have been developed for solving the resource-constrained project scheduling problem. Experimental studies have shown that currently even projects with only 60 activities cannot be optimally solved within a reasonable amount of time. Therefore heuristics employing genetic concepts, sampling strategies, simulated annealing or taboo search have been developed. Additionally truncated versions of the branch-and-bound algorithms are studied. By limiting the CPU-time, the total number of node evaluations, or the number of branching alternatives, the solution time is reduced at the expense of the quality of the generated schedules. The purpose of this paper is to study a combination of exact and heuristic elements. The project to be considered is decomposed into subprojects, the related subproblems are optimally solved, and the solutions are concatenated. The solution strategy has been implemented and tested on the benchmark instances provided by ProGen. The numerical results show that the decomposition approach outperforms the truncated version of the branch-and-bound algorithm employed. On average, the quality of the overall solution depends on the size of the subproblems, and the quality of the solutions of the subproblems. Consequently the approach will benefit from the progress made in the development of exact solution procedures.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147593
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 505
    Subjects: Projektmanagement; Scheduling-Verfahren; Engpass; Theorie
    Scope: 16 S
  14. Lagrangean relaxation for scheduling projects under resource constraints to maximize the net present value
    Author: Kimms, Alf
    Published: 1999
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    Resource-constrained project scheduling under a net present value objective attracts growing interest. Because this is an NP-hard problem, it is unlikely that optimum solutions can be computed for large instances. Thus, heuristics have become a... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (504)
    Inter-library loan:
    No inter-library loan

     

    Resource-constrained project scheduling under a net present value objective attracts growing interest. Because this is an NP-hard problem, it is unlikely that optimum solutions can be computed for large instances. Thus, heuristics have become a popular research field. Up to now, however, tight upper bounds have not been proposed. Therefore, most researchers evaluate their heuristics on the basis of a best known lower bound, but it is unclear how good the performance really is. With this contribution we close this gap and derive tight upper bounds on the basis of a Lagrangean relaxation of the resource constraints. We also use this approach as a basis for a heuristic and show that our heuristic as well as the cash flow weight heuristic proposed by Baroum and Patterson yield solutions very close to the optimum result. Furthermore, we discuss the proper choice of a test-bed, and, by reviewing the literature, emphasize that discount rates must be carefully chosen to give realistic instances.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147592
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 504
    Subjects: Scheduling-Verfahren; Projektmanagement; Dynamische Investitionsrechnung; Mathematische Optimierung; Theorie
    Scope: 21 S, graph. Darst
  15. Belastungsorientierte Just-in-Time Variantenfließfertigung
    Author: Drexl, Andreas; Kimms, Alf
    Published: 1999
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    Gegenstand der vorliegenden Arbeit sind zwei praktisch und theoretisch bedeutsame Probleme, die bei just-in-time orientierter Variantenfließfertigung auftreten. Ein Problem besteht darin, den Teilebedarf in der Endmontage so konstant wie möglich zu... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (502)
    Inter-library loan:
    No inter-library loan

     

    Gegenstand der vorliegenden Arbeit sind zwei praktisch und theoretisch bedeutsame Probleme, die bei just-in-time orientierter Variantenfließfertigung auftreten. Ein Problem besteht darin, den Teilebedarf in der Endmontage so konstant wie möglich zu halten ("Level Scheduling Problem"). Das zweite Problem versucht, die Belastung der Arbeitsstationen möglichst konstant zu halten ("Car Sequencing Problem"). In der vorliegenden Arbeit werden beide Probleme als kombiniertes ganzzahliges Optimierungsproblem formuliert. Die LP-Relaxation des Modells wird mit Hilfe der Methode der Spaltengenerierung gelöst. In einer experimentellen Studie zeigt sich, daß mit dieser Technik auch größere Instanzen näherungsweise optimal gelöst werden können. This paper deals with two problems arising in sequencing mixed-model assembly lines. These problems are most important from both practical and theoretical standpoints. Mixed-model assembly lines have become core components of modern repetitive manufacturing, and just-in-time manufacturing in particular. One problem is to keep usage rate of all parts fed into the final assembly as constant as possible ("level scheduling problem") while the other is to keep the line's Workstations loads as constant as possible ("car sequencing problem"). In this paper the combined problem is formulated as a Single integer programming model. The LP-relaxation of this model is solved by column generation techniques. The results of an experimental evaluation show that the lower bounds are tight.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: German
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147590
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; Nr. 502
    Subjects: Just in Time; Produktdifferenzierung; Fließfertigung; Scheduling-Verfahren; Theorie
    Scope: 17 S., graph. Darst.
  16. Fast iterative improvement methods for project scheduling under partially renewable resources
    Author: Schirmer, Andreas
    Published: 1999
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    It is well-known that for many project scheduling problems the Space AS of active schedules contains at least one optimal solution for each feasible instance, so restricting heuristic construction methods to AS will improve algorithmic efficiency... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (501)
    Inter-library loan:
    No inter-library loan

     

    It is well-known that for many project scheduling problems the Space AS of active schedules contains at least one optimal solution for each feasible instance, so restricting heuristic construction methods to AS will improve algorithmic efficiency without foresaking the chance to eventually find an optimal schedule. Yet, for some problems such results are not directly applicable. We address one such problem, namely the resource-constrained project scheduling problem under partially renewable resources (RCPSP/TI). Here delaying certain activities may yield better solutions than starting each activity as soon as possible. Since AS is the smallest space guaranteed to contain optimal schedules, it would be desirable to devise methods which sample AS, or at least the next-larger Space SAS of semi-active schedules. However, no such methods are in sight because the "delay problem" of which activities should be delayed and by how many periods cannot be properly addressed during the construction process, when not all remaining resource capacities are known. Indeed, all priority rulebased construction methods for the RCPSP/TI use scheduling schemes which sample the next-larger space FS of feasible schedules. But while the delay problem withstands solution during the construction of schedules, it can be solved afterwards, suggesting the idea of fast iterative improvement algorithms which use appropriate shift operations to improve heuristically constructed feasible schedules. We develop several such approaches, using local and global shifts, and evaluate the effect of different design choices on effectiveness and efficiency of the algorithms. Computational results validate the efficacy of our approach.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147589
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 501
    Subjects: Projektmanagement; Scheduling-Verfahren; Theorie
    Scope: II, 30 S
  17. Non-equivalent search strategies for resource-constrained project scheduling
    Author: Sprecher, Arno
    Published: 1998
    Publisher:  Inst. für Betriebswirtschaftslehre, Kiel

    Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (493)
    Inter-library loan:
    No inter-library loan

     

    Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible completion times or feasible subsets, they all aim at finding as fast as possible a makespan minimal schedule among the resource and precedence feasible ones. Some of the enumeration schemes have been modified to solve variants of the so-called resource-constrained project scheduling problem, like the resource-constrained project scheduling problem with multiple modes or with work content defined modes. We compare the enumeration of delaying alternatives and the enumeration of extension alternatives. Roughly considered the concepts that analyze only minimal delaying alternatives and the concept that analyze only maximal extension alternatives seem to be equivalent. Counterexamples will show that - in contrast to claims made in the literature - search tree reduction to minimal delaying alternatives and search tree reduction to maximal extension alternatives are not equivalent. While the former reduction preserves optimality the latter one is neither correct for the RCPSP with single execution modes nor for the RCPSP with work content defined modes.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147586
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 493
    Subjects: Projektmanagement; Scheduling-Verfahren; Suchtheorie; Theorie
    Scope: 9 S., graph. Darst.
  18. Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling
    Author: Sprecher, Arno; Drexl, Andreas
    Published: 1996
    Publisher:  Inst. für Betriebswirtschaftslehre, Kiel

    Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (426)
    Inter-library loan:
    No inter-library loan

     

    Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible a makespan minimal schedule among the resource and precedence feasible ones. The enumeration is oftenly reduced to the dominant set of semi-active schedules by checking feasibility of local left-shifts. In this paper we show that combining the concepts of minimal delaying alternatives and local left-shifts, if not properly done, does not, as claimed in the literature, reduce the enumeration to the set of semi-active schedules.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147572
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 426
    Subjects: Projektmanagement; Scheduling-Verfahren; Engpass; Theorie
    Scope: 9 Bl.
  19. Constraint propagation algorithms for the car sequencing problem
    Author: Matthiessen, Lars; Drexl, Andreas; Kimms, Alf
    Published: 2000
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    The car sequencing problem is to find feasible sequences of product variants requiring specific options while taking care of sequencing constraints. First, a branching scheme and constraint propagation algorithms for the computation of feasible... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (531)
    Inter-library loan:
    No inter-library loan

     

    The car sequencing problem is to find feasible sequences of product variants requiring specific options while taking care of sequencing constraints. First, a branching scheme and constraint propagation algorithms for the computation of feasible sequences are provided. Second, an algorithm is presented which can optimize a level scheduling objective while taking care of the car sequencing constraints. Computational results are presented which show that feasible sequences can be obtained quickly for large problem instances.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147610
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 531
    Subjects: Produktdifferenzierung; Scheduling-Verfahren; Just in Time; Fließfertigung; Produktionssteuerung; Theorie
    Scope: 26 S., graph. Darst.
  20. Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
    Author: Akkan, Can; Drexl, Andreas; Kimms, Alf
    Published: 2000
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    In project management, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the so-called time-cost tradeoff problem which has been extensively studied in the past. However, the... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (527)
    Inter-library loan:
    No inter-library loan

     

    In project management, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the so-called time-cost tradeoff problem which has been extensively studied in the past. However, the discrete version of the problem which is of great practical relevance, did not receive much attention so far. Given a set of modes (time-cost pairs) for each activity, the objective of the discrete time-cost tradeoff problem is to select a mode for each activity so that the total cost is minimized while meeting a given project deadline. The discrete time-cost tradeoff problem is a strongly NP-hard optimization problem for general activity networks. In terms of what current state-of-art-algorithms can do, instances with (depending on the structure of the network and the number of processing alternatives per activity) no more than twenty to fifty activities can be solved to optimality in reasonable amount of time. Hence, heuristics must be employed to solve larger instances. To evaluate such heuristics, lower bounds are needed. The aim of this paper is to provide such lower bounds using column generation techniques based on "network decomposition". We will show that a heuristic solution can be derived from that result as well. Furthermore, a computational study is provided to demonstrate that the presented bounds are tight and that large and hard instances can be solved in short run-time.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147607
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 527
    Subjects: Projektmanagement; Scheduling-Verfahren; Netzplantechnik; Terminplanung; Kostenmanagement; Theorie
    Scope: 24 S., graph. Darst.
  21. SALBLIB
    challenging instances for assembly line balancing
    Author: Sprecher, Arno
    Published: 2000
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    In this paper an improved set of benchmark instances for the simple assembly line balancing problem is presented. The benchmark set currently available consists of instances with 7 to 297 tasks to be executed. Although claims made in the literature... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (526)
    Inter-library loan:
    No inter-library loan

     

    In this paper an improved set of benchmark instances for the simple assembly line balancing problem is presented. The benchmark set currently available consists of instances with 7 to 297 tasks to be executed. Although claims made in the literature state that instances with up to 1000 tasks can be solved to optimality (less than) ten instances of these benchmark sets are still unsolved. The majority of the unsolved instances consists of 297 tasks, and the smallest unsolved instance consists of only 75 tasks. On the one hand the instance set is very heterogenous, and on the other hand, the instances are, at least partly, highly correlated through identical networks and processing times. Consequently, the available set is not suited that well to analyze the performance of heuristic and exact algorithms experimentally. This paper presents a generator that allows the systematic generation of benchmark instances, and thus the systematic evaluation of algorithmic performance. In this paper new systematically generated benchmark instances are presented. The instance generator employs some features of the well-known program package ProGen, which has been developed for the generation of benchmark instances for the resource-constrained project scheduling problem. However, for the simple assembly line balancing problem the generation of the processing times of the tasks is of particular importance. The instances generated consist of 50, 75, and 100 tasks. The computational results obtained by one of the most efficient exact solution procedures are reported. The study reveals that even instances with 50 tasks cannot be solved to optimality within a reasonable amount of time. The instances as well as the lower and the upper bounds can be loaded from our web-server. Moreover, improved solutions can be submitted via e-mail. The solutions are checked and the library is updated accordingly. Depending on the progress made in the development of exact and heuristic solution procedures the library is enhanced and new benchmark instances are added.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147606
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 526
    Subjects: Fließfertigung; Scheduling-Verfahren; Expertensystem; Theorie
    Scope: 22 S
  22. Balancing u-shaped assembly lines heuristically
    Author: Kimms, Alf
    Published: 2000

    While balancing straight assembly lines is a well-studied problem, the Situation where the assembly line has a U-shaped Iayout is a still emerging research field. The advantage of these lines is that workers may simply turn around to operate at two... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (524)
    Inter-library loan:
    No inter-library loan

     

    While balancing straight assembly lines is a well-studied problem, the Situation where the assembly line has a U-shaped Iayout is a still emerging research field. The advantage of these lines is that workers may simply turn around to operate at two legs of the line. Hence, there is an additional degree of freedom for assigning Operations to stations. This bears the hope that U-lines are more efficient than straight lines. Since work on this NP-hard problem has mainly focused on exact algorithms, we study priority rule heuristics. We adapted 16 priority rules which have been applied to the straight line case before and examine their Performance with a computational study.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/149074
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 524
    Subjects: Fließfertigung; Scheduling-Verfahren; Heuristik; Theorie
    Scope: 11 S, graph. Darst
  23. Adaptive control schemes applied to project scheduling with partially renewable resources
    Author: Schirmer, Andreas
    Published: 1999
    Publisher:  Inst. f. Betriebswirtschaftslehre, Kiel

    For most computationally intractable problems there exists no heuristic that is equally effective on all instances. Rather, any given heuristic may do well on some instances but will do worse on others. Indeed, even the 'best' heuristics will be... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (520)
    Inter-library loan:
    No inter-library loan

     

    For most computationally intractable problems there exists no heuristic that is equally effective on all instances. Rather, any given heuristic may do well on some instances but will do worse on others. Indeed, even the 'best' heuristics will be dominated by others on at least some subclasses of instances. It thus seems worthwhile to identify - for each instance anew - a heuristic that is appropriate for the instance at hand, instead of applying always the same algorithm, regardless of its suitability. Adaptive control schemes attempt to do this with iterative algorithms by dynamically exploiting the experience gained in earlier iterations to guide the underlying algorithm in later iterations. In a recent study, several adaptive control schemes have been evaluated on one of the most fundamental scheduling problems, the resource-constrained project scheduling problem (RCPSP). With this contribution, we intend to complement that research by results on a substantially more general problem, viz. the RCPSP under partially renewable resources. This new resource concept allows to formulate a variety of temporal and logical relations between scheduling objects, and is thus of interest in many practical settings pertaining to time-tabling and manpower scheduling.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147603
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 520
    Subjects: Projektmanagement; Scheduling-Verfahren; Engpass; Erneuerbare Ressourcen; Theorie
    Scope: I, 35 S, graph. Darst
  24. Retail business staff scheduling under complex labor relations
    Author: Haase, Knut
    Published: 1999
    Publisher:  Inst. für Betriebswirtschaftslehre, Kiel

    The staff scheduling problem in the retail business is considered for which a new mathematical model and new solution methods are introduced. The problem is formalized as a set covering type problem. Columns represent feasible weekly working time... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (511)
    Inter-library loan:
    No inter-library loan

     

    The staff scheduling problem in the retail business is considered for which a new mathematical model and new solution methods are introduced. The problem is formalized as a set covering type problem. Columns represent feasible weekly working time patterns of one sales clerk. Rows correspond to periods derived from the weekly opening time. For each period the number of required sales clerks is given. Based on the complex labor rules in Germany a graph is constructed in such a way that a path through the graph represents a weekly working time pattern. A feasible weekly working time pattern is generated by solving a restricted minimum cost path problem in the graph. Different approaches are introduced to compute lower and upper bounds. In particular, a new upper bounding method is presented in which dual variables are defined heuristically. The different approaches are compared by a numerical investigation.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147598
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; Nr. 511
    Subjects: Einzelhandel; Verkaufspersonal; Personaleinsatzplanung; Scheduling-Verfahren; Arbeitsrecht; Arbeitszeitgestaltung; Theorie; Deutschland
    Scope: 18 S, graph. Darst
  25. Packing problems and project scheduling models
    an integrated perspective
    Author: Hartmann, Sönke
    Published: 1999
    Publisher:  Inst. für Betriebswirtschaftslehre, Kiel

    This paper considers two problem classes that are important to researchers as well as practitioners, namely packing and project scheduling problems. First, the two problem categories are described. This includes a classification of packing problems... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 504 (509)
    Inter-library loan:
    No inter-library loan

     

    This paper considers two problem classes that are important to researchers as well as practitioners, namely packing and project scheduling problems. First, the two problem categories are described. This includes a classification of packing problems as well as of project scheduling concepts. While both problem classes are different with respect to their fields of application, similarities of their mathematical structures are examined. It is shown that all packing problems considered here are special cases of models for project scheduling. The aim is to indicate which project scheduling models can be used to capture the different types of packing problems. Finally, some implications for research on optimization algorithms for these two problem classes are discussed.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/147597
    Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; no. 509
    Subjects: Verpackung; Projektmanagement; Scheduling-Verfahren; Packproblem; Theorie
    Scope: 14 S