ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (9)
  • scheduling  (9)
  • 2020-2024
  • 1985-1989  (9)
  • 1965-1969
  • Economics  (9)
  • Political Science
  • Energy, Environment Protection, Nuclear Power Engineering
Collection
  • Articles  (9)
Source
Keywords
Publisher
Years
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Scheduling flexible machining and assembly systems (1988)
    Springer
    Annals of operations research 15 (1988), S. 337-352 
    Details
    ISSN: 1572-9338
    Keywords: Flexible systems ; machining ; assembly ; scheduling ; algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Most scheduling papers consider flexible machining and assembly systems as being independent. In this paper, a heuristic two-level scheduling algorithm for a system consisting of a machining and an assembly subsystem is developed. It is shown that the upper level problem is equivalent to the two machine flow shop problem. The algorithm at the lower level schedules jobs according to the established product and part priorities. Related issues, such as batching, due dates, process planning and alternative routes, are discussed. The algorithm and associated concepts are illustrated on a number of numerical examples.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186802
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Experimental investigation of real-time scheduling in flexible manufacturing systems (1985)
    Springer
    Annals of operations research 3 (1985), S. 355-377 
    Details
    ISSN: 1572-9338
    Keywords: Flexible manufacturing systems ; scheduling ; manufacturing systems ; simulation ; computer integrated manufacturing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper presents a new two-phase (TP) approximate method for real-time scheduling in a flexible manufacturing system (FMS). This method combines a reduced enumeration schedule generation algorithm with a 0–1 optimization algorithm. In order to make the combined algorithm practicable, heuristic rules are introduced for the selection of jobs to be scheduled. The relative performance of the TP method vis-a-vis conventional heuristic dispatching rules such as SPT, LPT, FCFS, MWKR, and LWKR is investigated using combined process-interaction/discrete-event simulation models. An efficient experimental procedure is designed and implemented using these models, and the statistical analysis of the results is presented. For the particular case investigated, the conclusions are very encouraging. In terms of mean flow time, the TP method performs significantly better than any other tested heuristic dispatching rules. Also, the experimental results show that using global information significantly improves the FMS performance.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023749
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Scheduling of project networks (1985)
    Springer
    Annals of operations research 4 (1985), S. 227-252 
    Details
    ISSN: 1572-9338
    Keywords: Distance matrix ; earliest start scheduling ; feasible partial orders ; Graham anomalies ; project networks ; regular cost functions ; resource constrained project networks ; scheduling ; stochastic scheduling problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The paper deals with the network optimization problem of minimizing regular project cost subject to an arbitrary precedence relation on the sets of activities and to arbitrarily many resource constraints. The treatment is done via a purely structural approach that considerably extends the disjunctive graph concept. It is based on so-called feasible posets and includes a quite deep and useful representation theorem. This theorem permits many insights concerning the analytical behaviour of the optimal value function, the description and counting of all essentially different optimization problems, the nature of Graham anomalies, connections with the on-line stochastic generalizations, and several others. In addition, it also allows the design of a quite powerful class of branch-and-bound algorithms for such problems, which is based on an iterative construction of feasible posets. Using so-called distance matrices, this approach permits the restriction of the exponential part of the algorithm to the often comparatively small set of ‘resource and cost essential’ jobs. The paper reports on computational experience with this algorithm for examples from the building industry and includes a rough comparison with the integer programming approach by Talbot and Patterson.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02022042
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Simulated annealing: Use of a new tool in bin packing (1988)
    Springer
    Annals of operations research 16 (1988), S. 327-332 
    Details
    ISSN: 1572-9338
    Keywords: Monte Carlo technique ; cooling strategies ; scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Simulated annealing (statistical cooling) is applied to bin packing problems. Different cooling strategies are compared empirically and for a particular 100 item problem a solution is given which is most likely the best known so far.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283751
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Parallel computing in combinatorial optimization (1988)
    Springer
    Annals of operations research 14 (1988), S. 245-289 
    Details
    ISSN: 1572-9338
    Keywords: 90C27 ; 68Q15 ; 68Q25 ; 68Rxx ; Parallel computer ; computational complexity ; polylog parallel algorithm ; P-completeness ; sorting ; shortest paths ; minimum spanning tree ; matching ; maximum flow ; linear programming ; knapsack ; scheduling ; traveling salesman ; dynamic programming ; branch and bound
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This is a review of the literature on parallel computers and algorithms that is relevant for combinatorial optimization. We start by describing theoretical as well as realistic machine models for parallel computations. Next, we deal with the complexity theory for parallel computations and illustrate the resulting concepts by presenting a number of polylog parallel algorithms andP-completeness results. Finally, we discuss the use of parallelism in enumerative methods.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186483
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Viewing scheduling as an opportunistic problem-solving process (1988)
    Springer
    Annals of operations research 12 (1988), S. 85-108 
    Details
    ISSN: 1572-9338
    Keywords: Artificial intelligence ; knowledge-based systems ; opportunistic search ; scheduling ; planning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In a search for more efficient yet effective ways of solving combinatorially complex problems such as jobshop scheduling, we move towards opportunistic approaches that attempt to exploit the structure of a given problem. Rather than adhere to a single problem-solving plan, such approaches are characterized by almost continual surveillance of the current problem-solving state to possibly modify plans so that activity is consistently directed toward those actions that currently seem most promising. Opportunistic behavior may occur in problem decomposition down to selective application of scheduling heuristics. We developed and performed limited testing of a scheduling system, called OPIS 0, that exhibits such behavior to some extent. The results are encouraging when compared to ISIS and a dispatching system. It is believed that such opportunistic views of scheduling would lead to systems that allow more flexibility in terms of designing scheduling procedures and supporting the scheduling function.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186362
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Analysis of flexible manufacturing systems with priority scheduling: PMVA (1985)
    Springer
    Annals of operations research 3 (1985), S. 113-139 
    Details
    ISSN: 1572-9338
    Keywords: FMS ; scheduling ; mean value analysis ; HOL ; performance analysis ; queueing networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A new methodology for performance analysis of flexible manufacturing systems (FMSs) with priority scheduling is presented. The analytic model developed extends the mean value analysis of closed networks of queues with multiple product types, various non-preemptive priority service disciplines, and with parallel machine stations. Performance measures derived include the expected throughput per product and per station, utilization of machines and transporters, queuing times and queue length measures for various configurations. Extensive numerical calculations have shown that the algorithm used for solving the problem converges rapidly and retains numerical stability for large models. The paper also illustrates the application of the model to a system with a mixture of FCFS and HOL disciplines which gives insights into various priority assignment policies in FMSs. Special attention was given to the problem of scheduling the robot carriers (transporters).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02024742
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Interactive optimization (1985)
    Springer
    Annals of operations research 5 (1985), S. 539-556 
    Details
    ISSN: 1572-9338
    Keywords: Programming ; interactive algorithms ; graphics ; scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Optimization algorithms or heuristics in which the user interacts significantly either during the solution process or as part of post-optimality analysis are becoming increasingly popular. An important underlying premise of such man/machine systems is that there are some steps in solving a problem in which the computer has an advantage and other steps in which a human has an advantage. This paper first discusses how man/machine systems can be useful in facilitating model specification and revision, coping with aspects of a problem that are difficult to quantify and assisting in the solution process. We then survey successful systems that have been developed in the areas of vehicle scheduling, location problems, job shop scheduling, course scheduling, and planning language-based optimization.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023610
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Preemptive scheduling with staircase and piecewise linear resource availability (1989)
    Springer
    Mathematical methods of operations research 33 (1989), S. 297-313 
    Details
    ISSN: 1432-5217
    Keywords: scheduling ; production ; resource constraints ; flexible manufacturing systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Abstract Some variations are presented for the preemptive scheduling problem on unrelated processors, one shows how nonrenewable resources with a time-varying supply may be taken into account in an extension of the two-phase method; phase 1 consists in solving an LP problem and phase 2 is the construction of the schedule; such a construction reduces to the determination of integral vectors in polyhedra defined by totally unimodular matrices. In special cases, this is simply a compatible flow problem.
    Notes: Zusammenfassung Es werden Variationen für Reihenfolgeprobleme mit Unterbrechungen betrachtet bei denen die Aufgaben mit unterschiedlicher Bearbeitungszeit auf den einzelnen Maschinen gelöst werden können. Insbesondere wird ein Problem mit nichterneuerbaren Resourcen und zeitabhängigen Nachfragen behandelt und es wird gezeigt, daß dieses Problem durch eine Erweiterung der 2-Phasenmethode gelöst werden kann. In Phase 1 wird ein LP gelöst, während in Phase 2 ein zugehöriger Schedule konstruiert wird. Diese Konstruktion erfolgt durch die Bestimmung ganzzahliger Vektoren, die Ecken eines Polyeders entsprechen, der durch eine vollständig unimodulare Matrix definiert wird. In Spezialfällen reduziert sich dies auf Flußprobleme.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01416077
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...