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
    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
  • 2
    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
  • 3
    Electronic Resource
    Electronic Resource
    Minimizing total completion time subject to release dates and sequence‐dependentprocessing times (1999)
    Springer
    Annals of operations research 86 (1999), S. 393-415 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We consider the problem of scheduling jobs with release dates and sequence‐dependentprocessing times on a single machine to minimize the total completion time. We show thatthis problem is equivalent to the Cumulative Traveling Salesman Problem with additionaltime constraints. For this latter problem, we give a dynamic programming formulation fromwhich lower bounds are derived. Two heuristic algorithms are proposed. Performanceanalysis of both lower bounds and heuristics on randomly generated test problems are carriedout. Moreover, the application of the model and algorithms to the real problem of sequencinglanding aircraft in the terminal area of a congested airport is analyzed. Computational resultson realistic data sets show that heuristic solutions can be effective in practical contexts.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018975323093
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets (1997)
    Springer
    Computational optimization and applications 8 (1997), S. 197-210 
    Details
    ISSN: 1573-2894
    Keywords: partially ordered sets ; linear extensions ; heuristic algorithm ; dynamic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The jump number of a partially ordered set (poset) P isthe minimum number of incomparable adjacent pairs (jumps) in some linearextension of P. The problem of finding a linear extension of Pwith minimum number of jumps (jump number problem) is known to beNP-hard in general and, at the best of our knowledge, no exactalgorithm for general posets has been developed. In this paper, wegive examples of applications of this problem and propose for thegeneral case a new heuristic algorithm and an exactalgorithm. Performances of both algorithms are experimentallyevaluated on a set of randomly generated test problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008625405476
    Library Location Call Number Volume/Issue/Year 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...