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  (4)
  • Articles: DFG German National Licenses  (4)
  • Latest Papers from Table of Contents or Articles in Press
  • scheduling  (4)
  • Springer  (4)
  • American Chemical Society (ACS)
  • 2020-2024
  • 2015-2019
  • 1985-1989  (4)
  • 1980-1984
  • 1970-1974
  • 1965-1969
  • 1935-1939
  • 1988  (4)
  • 1966
  • Economics  (4)
  • Natural Sciences in General
  • Architecture, Civil Engineering, Surveying
Collection
  • Articles  (4)
Source
  • Articles: DFG German National Licenses  (4)
  • Latest Papers from Table of Contents or Articles in Press
Keywords
Publisher
  • Springer  (4)
  • American Chemical Society (ACS)
Years
  • 2020-2024
  • 2015-2019
  • 1985-1989  (4)
  • 1980-1984
  • 1970-1974
    • +
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
    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
  • 3
    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
  • 4
    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
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...