Non-chronological scheduling

Fox, Barry

doi:10.1109/aihas.1990.93922

Cited by 3 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…operations, where n = | N| and r = | R | . Note that the calculation of c X (t) is similar to the Resource profile calculation presented in Fox (1990) ; Pape (1988) . The idea of the following algorithm is close to sweep algorithms presented in Beldiceanu and Carlsson (20 01, 20 02) ; Letort, Beldiceanu, and Carlsson (2012) , the difference lies in the utilization of function c X (t) which is actively used and dynamically changed in our algorithm.…”

Section: Procedures 1: Pre-processingmentioning

confidence: 82%

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

Arkhipov

Battaïa

Lazarev

2019

European Journal of Operational Research

View full text Add to dashboard Cite

Several algorithms for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem (RCPSP) were proposed in the literature. However, fast computable lower bounds usually do not provide the best estimations and the methods that obtain better bounds are mainly based on the cooperation between linear and constraint programming and therefore are time-consuming. In this paper, a new pseudo-polynomial algorithm is proposed to find a makespan lower bound for RCPSP with time-dependent resource capacities. Its idea is based on a consecutive evaluation of pairs of resources and their cumulated workload. Using the proposed algorithm, several bounds for the PSPLIB benchmark were improved. The results for industrial applications are also presented where the algorithm could provide good bounds even for very large problem instances.

show abstract

Section: Procedures 1: Pre-processingmentioning

confidence: 82%

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

Arkhipov

Battaïa

Lazarev

2019

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…A lot of constraints can be obtained by considering Cumulative Scheduling Problem (CuSP) -a single-resource version of RCPSP. Calculation of compulsory parts [12], time-tables [13], resource profile [7], resource histogram [6] allow to clarify resource usage by tasks under any feasible schedule. Time tabling sweep algorithms ( [2], [3], [14]) can be used to adjust release times and tails of tasks.…”

Section: State Of the Artmentioning

confidence: 99%

“…For this procedure algorithm presented by [7] can be applied adjusted for piecewise constant resource capacity function. The complexity of this procedure is O(n r + m) operations for single resource where n r -number of tasks which require resource r during the processing and m -number of breakpoints of c r (t).…”

Section: Data Preprocessingmentioning

confidence: 99%

See 1 more Smart Citation

New Task Domain Propagators with Polynomial Complexity for Resource-Constrained Project Scheduling Problem

Arkhipov¹,

Battaïa²,

Lazarev³

et al. 2019

dtcse

View full text Add to dashboard Cite

We consider a classic Resource-Constrained Project Scheduling Problem (RCPSP) which is known to be NP-hard. For defined project deadline T , each task of the pro ject can be associated with its temporal domain -a time interval in which this task can be processed. In this research, we adopt existing resource-based methods of task domain propagation to generalized statement with time-dependent resource capacity and show how to improve its propagation efficiency. We also present new polynomial-time algorithms (propagators) to tighten such temporal task domains in order to make the optimization problem easier to solve. Moreover, we show how these propagators can be used to calculate lower bound on project makespan.

show abstract

“…Well-documented examples include DAS [10] , COMPASS [43] , REPORT [44] and TOSCA [45] . Most stochastic models of resource allocation [46][47][48][49][50] are also interpretable as computing "expected" time-tables.…”

mentioning

confidence: 99%

Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems

Pape¹

1994

Intell. Syst. Eng. UK

129

View full text Add to dashboard Cite

show abstract

Non-chronological scheduling

Cited by 3 publications

References 0 publications

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

New Task Domain Propagators with Polynomial Complexity for Resource-Constrained Project Scheduling Problem

Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems

Contact Info

Product

Resources

About