ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Treffer pro Seite

Treffer 1 - 4 | 4 Treffer

Sortierung

Digitale Medien

Scheduling project networks with resource constraints and time windows (1988)

Bartusch, M. ; Möhring, R. H. ; Radermacher, F. J.

Springer

Annals of operations research 16 (1988), S. 199-240

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1572-9338

Schlagwort(e): Scheduling ; project networks ; MPM-networks ; time-windows ; order theoretic approach to scheduling ; disjunctive graph method

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik , Wirtschaftswissenschaften

Notizen: Abstract Project networks with time windows are generalizations of the well-known CPM and MPM networks that allow for the introduction of arbitrary minimal and maximal time lags between the starting and completion times of any pair of activities. We consider the problem to schedule such networks subject to arbitrary (even time dependent) resource constraints in order to minimize an arbitrary regular performance measure (i.e. a non-decreasing function of the vector of completion times). This problem arises in many standard industrial construction or production processes and is therefore particularly suited as a background model in general purpose decision support systems. The treatment is done by a structural approach that involves a generalization of both the disjunctive graph method in job shop scheduling [1] and the order theoretic methods for precedence constrained scheduling [18,23,24]. Besides theoretical insights into the problem structure, this approach also leads to rather powerful branch-and-bound algorithms. Computational experience with this algorithm is reported.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF02283745

Permalink

	Standort	Signatur	Erwartet	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Digitale Medien

Scheduling unit — time tasks on flow — shops under resource constraints (1988)

Błażewicz, J. ; Kubiak, W. ; Szwarcfiter, J.

Springer

Annals of operations research 16 (1988), S. 255-266

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1572-9338

Schlagwort(e): Scheduling ; flow shops ; resource constraints ; message transmission

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik , Wirtschaftswissenschaften

Notizen: 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.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF02283747

Permalink

	Standort	Signatur	Erwartet	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Digitale Medien

A task and resource scheduling system for automated planning (1988)

Miller, David P.

Springer

Annals of operations research 12 (1988), S. 169-198

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1572-9338

Schlagwort(e): Scheduling ; automated planning ; heuristic search ; temporal reasoning

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik , Wirtschaftswissenschaften

Notizen: Abstract Planning is done at both the strategic and tactical levels. This paper classifies some previous planning techniques into these different levels, and details of some of their problems. A planning technique known as heuristic task scheduling is then presented along with a planner architecture that integrates task-scheduling with more traditional techniques to form a system that bridges the strategic/tactical division

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF02186366

Permalink

	Standort	Signatur	Erwartet	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Digitale Medien

On the matrix permutation problem (1986)

Tegze, M. ; Vlach, M.

Springer

Mathematical methods of operations research 30 (1986), S. A155

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1432-5217

Schlagwort(e): Scheduling ; Schur-convexity ; rearrangement inqualities

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik , Wirtschaftswissenschaften

Beschreibung / Inhaltsverzeichnis: Zusammenfassung Diese Note behandelt das Problem, die Spaltenelemente einer reellen Matrix so zu permutieren, daß eine reellwertige Funktion der Zeilensummen minimiert wird. Der Spezialfall der Minimierung der maximalen Zeilensumme wurde jüngst von mehreren Autoren [1, 4, 6, 7] untersucht. Hier betrachten wir primär den Fall, daß die Matrix nur zwei Spalten hat und die Zielfunktion Schur-konvex ist.

Notizen: Abstract This note deals with the problem of permuting elements within columns of a real matrix so as to minimize a real-valued function of row sums. The special case dealing with minimization of maximum row sum has been studied by several authors [1, 4, 6, 7] recently. Here we are concerned primarily with the case in which the matrix has two columns only and the function is Schur-convex.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF01919177

Permalink

	Standort	Signatur	Erwartet	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 4 | 4 Treffer