Library

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
  • 1
    Electronic Resource
    Electronic Resource
    Multiprocessor task scheduling with resource requirements (1994)
    Springer
    Real-time systems 6 (1994), S. 37-53 
    Details
    ISSN: 1573-1383
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract One of the most important problems arising in multiprocessor systems is scheduling of tasks on a set of parallel processors. Recently, new models of task processing have been formulated in which certain tasks can require more than one processor at a time. This model is especially justified in some applications of multi-microprocessor systems. In this paper, we extend the above model to cover the case of scheduling in the presence of additional scarce resources. First a subcase of the problem is considered in which preemptable tasks need simultaneously one or two processors and one additional resource in the amount of one unit. For this case a low order polynomial-time algorithm is presented. Then the general case is solved via a linear programming approach.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01245298
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A local search approach for two-dimensional irregular cutting (1995)
    Springer
    OR spectrum 17 (1995), S. 93-98 
    Details
    ISSN: 1436-6304
    Keywords: Packing ; cutting ; irregular shapes ; tabu search ; polygon placement ; Packproblem ; Zuschnittproblem ; irreguläre Formen ; Tabu Search ; Unterbringung der Vielecken
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Die vorliegende Arbeit behandelt ein zweidimensionales irreguläres Zuschnittproblem. Zwei neue Approximationsalgorithmen in Anlehnung an Tabu Search und Simulated Annealing wurden in [7] vorgeschlagen und realisiert. Die Überlegenheit der Tabu Methode über Gurel, Albano-Sapuppo und Simulated Annealing hinsichtlich der Lösungsqualität wurde in [5, 7] dargestellt. Dieser Artikel enthält eine Übersicht über verschiedene Versionen der Tabu Search Methode zur Lösung des Problems. Die erreichten Ergebnisse für verschiedene Algorithmen werden präsentiert und zusammengestellt.
    Notes: Abstract A two-dimensional irregular cutting problem is considered. Two new approximation algorithms based on tabu search and simulated annealing, have been proposed and implemented in [7]. The advantage, in terms of the solution's quality, of the tabu method over Albano-Sapuppo's, Gurel's and simulated annealing ones has been shown in [5,7]. This paper provides a study of the various versions of the tabu search approach used for the problem. The results obtained for different methods are presented and compared.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01719251
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Scheduling unit — time tasks on flow — shops under resource constraints (1988)
    Springer
    Annals of operations research 16 (1988), S. 255-266 
    Details
    ISSN: 1572-9338
    Keywords: Scheduling ; flow shops ; resource constraints ; message transmission
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We consider the problem of scheduling tasks on flow shops when each task may also require the use of additional resources. It is assumed that all operations have unit lengths, the resource requirements are of 0–1 type and there is one type of the additional resource in the system. It is proved that when the number of machines is arbitrary, the problem of minimizing schedule length is NP-hard, even when only one unit of the additional resource is available in the system. On the other hand, when the number of machines is fixed, then the problem is solvable in polynomial time, even for an arbitrary number of resource units available. For the two machine case anO(n log 2 2 n) algorithm minimizing maximum lateness is also given. The presented results are also of importance in some message transmission systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283747
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Sequencing of parts and robot moves in a robotic cell (1992)
    Springer
    International journal of flexible manufacturing systems 4 (1992), S. 331-358 
    Details
    ISSN: 1572-9370
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this paper, we deal with the problem of sequencing parts and robot moves in a robotic cell where the robot is used to feed machines in the cell. The robotic cell, which produces a set of parts of the same or different types, is a flow-line manufacturing system. Our objective is to maximize the long-run average throughput of the system subject to the constraint that the parts are to be produced in proportion of their demand. The cycle time formulas are developed and analyzed for this purpose for cells producing a single part type using two or three machines. A state space approach is used to address the problem. Both necessary and sufficient conditions are obtained for various cycles to be optimal. Finally, in the case of many part types, the problem of scheduling parts for a specific sequence of robot moves in a two machine cell is formulated as a solvable case of the traveling salesman problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01324886
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Using a tabu search approach for solving the two-dimensional irregular cutting problem (1993)
    Springer
    Annals of operations research 41 (1993), S. 313-325 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, a new approach to cutting a rectangular sheet of material into pieces of arbitrary shapes is presented. The proposed method consists of two stages. After the generation of an initial solution, a tabu search is applied for finding a final cutting pattern. The presentation of the main ideas of the method is followed by a description of an implementation and some experimental results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02022998
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (1995)
    Springer
    Annals of operations research 58 (1995), S. 493-517 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In the classical scheduling theory, it is widely assumed that a task can be processed by only one processor at a time. With the rapid development of technology, this assumption is no longer valid. In this work we present a problem of scheduling tasks, each of which requires for its processing a set of processors simultaneously and which can be executed on several alternative sets of processors. Scheduling algorithms based on dynamic and linear programming are presented that construct minimum length non-preemptive and preemptive schedules, respectively. Results of computational experiments are also reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02057160
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Preemptive multiprocessor task scheduling with release times and time windows (1997)
    Springer
    Annals of operations research 70 (1997), S. 43-55 
    Details
    ISSN: 1572-9338
    Keywords: Parallel processing ; multiprocessor tasks ; preemptive scheduling ; release times ; scheduling in time windows ; polynomial time algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Classical scheduling theory assumed that a task may require for its processing only one processor at a time. This assumption is not obvious in the context of new parallel computer systems and parallel algorithms. In this work, we consider preemptive deterministic scheduling of multiprocessor tasks, each of which may require a set of processors at a time. In general, tasks may appear in the system in different moments of time. We will also consider the problem of scheduling such tasks in time windows on particular processors. The existence of low-order polynomial time algorithms for the above problems with C max and L max criteria will be analyzed. The general case of the problem can be solved using a linear programming approach.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018994726051
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Minimizing mean flow-time with parallel processors and resource constraints (1987)
    Springer
    Acta informatica 24 (1987), S. 513-524 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary The problem to be considered is one of scheduling nonpreemptable tasks in multiprocessor systems when tasks need for their processing processors and other limited resources, and when mean flow time is the system performance measure. For each task the time required for its processing and the amount of each resource which it requires, are given. Special attention is paid to the computational complexity of algorithms for determining the optimal schedules for different assumptions concerning the environment. For the case of scheduling independent, arbitrary length tasks when each task may require a unit of an additional resource of one type, an O(n 3) algorithm is given. For more complicated resource requirements, however, it is proved that the problem under consideration is NP-hard in the strong sense, even for the case of two processors.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00263292
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Book
    Book
    Scheduling under resource constraints - deterministic models; 7 (1986)
    Basel :Baltzer,
    Details
    Title: Scheduling under resource constraints - deterministic models; 7
    Author: Blazewicz, Jacek
    Contributer: Cellary, Wojciech , Slowinski, Roman , Weglarz, Jan , Blazewicz, J.
    Publisher: Basel :Baltzer,
    Year of publication: 1986
    Pages: 359 S.
    Series Statement: Annals of operations research 7
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...