Scheduling Tasks with AND/OR Precedence Constraints
From MaRDI portal
Publication:4852624
DOI10.1137/S0097539791218664zbMath0830.68012OpenAlexW2019285863MaRDI QIDQ4852624
Jane W. S. Liu, Donald W. Gillies
Publication date: 1 November 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539791218664
list schedulingnonpreemptive schedulingimprecise computationNP- complete problemsminimal length schedulespriority-driven algorithms
Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs ⋮ A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows ⋮ An approach using SAT solvers for the RCPSP with logical constraints ⋮ Network construction/restoration problems: cycles and complexity ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ A graph-based constraint programming approach for the integrated process planning and scheduling problem ⋮ Intractability of assembly sequencing: Unit disks in the plane ⋮ Resource leveling in projects with flexible structures ⋮ A new approach for solving the network problems ⋮ Project scheduling under uncertainty: survey and research potentials ⋮ Tree optimization based heuristics and metaheuristics in network construction problems ⋮ Machine scheduling with soft precedence constraints ⋮ Scheduling of tasks with effectiveness precedence constraints ⋮ Makespan minimization with OR-precedence constraints ⋮ Precedence-Constrained Min Sum Set Cover ⋮ On the complexity of scheduling unit-time jobs with or-precedence constraints
