NDLI: Scheduling with AND/OR Precedence Constraints

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Stork, Frederik Mhring, Rolf H. Skutella, Martin
Copyright Year	2004
Abstract	In many scheduling applications it is required that the processing of some job be postponed until some other job, which can be chosen from a pregiven set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions. Therefore, the concept has been generalized to so-called AND/OR precedence constraints which can cope with this kind of requirement. In the context of traditional precedence constraints, feasibility, transitivity, and the computation of earliest start times for jobs are fundamental, well-studied problems. The purpose of this paper is to provide efficient algorithms for these tasks for the more general model of AND/OR precedence constraints. We show that feasibility as well as many questions related to transitivity can be solved by applying essentially the same linear-time algorithm. In order to compute earliest start times we propose two polynomial-time algorithms to cope with different classes of time distances between jobs.
Starting Page	393
Ending Page	415
Page Count	23
File Format	PDF
ISSN	00975397
DOI	10.1137/S009753970037727X
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	2
Volume Number	33
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2004-01-01
Access Restriction	Subscribed
Subject Keyword	project scheduling \andor precedence constraints mean payoff games Games involving graphs earliest start schedule Graph algorithms Scheduling theory, deterministic Hypergraphs Combinatorial optimization
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast Algorithms for Bipartite Network Flow

The Tournament Scheduling Problem with Absences

Efficient Solution of a Stochastic Scheduling Problem on an Out-ForestRevisited

Very Simple Methods for All Pairs Network Flow Analysis

Flow in Planar Graphs with Multiple Sources and Sinks

Edge-Chromatic Scheduling with Simultaneity Constraints

An algebraic approach to project schedule development under precedence constraints

Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines

The Capacitated K-Center Problem

Scheduling with AND/OR Precedence Constraints

Similar Documents

Fast Algorithms for Bipartite Network Flow

The Tournament Scheduling Problem with Absences

Efficient Solution of a Stochastic Scheduling Problem on an Out-ForestRevisited

Very Simple Methods for All Pairs Network Flow Analysis

Flow in Planar Graphs with Multiple Sources and Sinks

Edge-Chromatic Scheduling with Simultaneity Constraints

An algebraic approach to project schedule development under precedence constraints

Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines

The Capacitated K-Center Problem

Scheduling with AND/OR Precedence Constraints