Review of properties of different precedence graphs for scheduling problems
type: Item
instance of: scholarly article
title: Review of properties of different precedence graphs for scheduling problems
zbMATH Open document ID: 1081.90553
DOI: 10.1016/S0377-2217(01)00379-4
author: Daniel Kobler
author: Jacek Blazewicz
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1829933
zbMATH Keywords: Scheduling
zbMATH Keywords: Precedence constraints
zbMATH Keywords: Graph theory
Wikidata QID: Q57387817
describes a project that uses: Algorithm 520
MaRDI profile type: Publication
cites work: On the linegraph of a directed-graph
cites work: Q3941433
cites work: Q4380372
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Q4131987
cites work: Intransitive Indifference in Preference Theory: A Survey
cites work: A linear-time recognition algorithm for interval dags
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3872508
cites work: Q5345642
cites work: Analysis of scheduling problems with typed task systems
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3050157
cites work: Q4918387
cites work: Scheduling Interval-Ordered Tasks
cites work: Q3525910
cites work: Preemptive scheduling of interval orders is polynomial
cites work: Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
cites work: A labeling algorithm to recognize a line digraph and output its root graph
cites work: Q3676161
cites work: The jump number problem on interval orders: A 3/2 approximation algorithm
cites work: An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
cites work: Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
full work available at URL: s0377-2217(01)00379-4
OpenAlex ID: W2120730808
description: scientific article; zbMATH DE number 1829933