ScholarLens Back to search
2003•Unpublished venueRequires access

Constraint-based scheduling: a recursive approach

Jiaxin Wang, Pierre Gaspart

Open publisher page 0 citations

Abstract

The authors introduce the idea of constraint-based scheduling and consider some constraints as a good factor in scheduling. The idea is used to develop a novel scheduling method. A schedule problem is used to present the method. The parallel-serial plan (PSP) is defined. A recursive approach to find the best scheduling for a PSP is outlined. The complexity of the algorithm is discussed, and the algorithm is extended for the scheduling of a plan.>

About this research paper

What this paper is about

The authors introduce the idea of constraint-based scheduling and consider some constraints as a good factor in scheduling. The idea is used to develop a novel scheduling method. A schedule problem is used to present the method. The parallel-serial plan (PSP) is defined. A recursive approach to find the best scheduling for a PSP is outlined. The complexity of the algorithm is discussed, and the algorithm is extended for the scheduling of a plan.>

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The authors introduce the idea of constraint-based scheduling and consider some constraints as a good factor in scheduling. The idea is used to develop a novel scheduling method. A schedule problem is used to present the method. The parallel-serial plan (PSP) is defined. A recursive approach to find the best scheduling for a PSP is outlined. The complexity of the algorithm is discussed, and the algorithm is extended for the scheduling of a plan.>

Key concepts: Computer science, Scheduling (production processes), Dynamic priority scheduling, Fair-share scheduling, Two-level scheduling, Mathematical optimization, Rate-monotonic scheduling, Schedule

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Constraint-based scheduling: a recursive approach — Research Paper | ScholarLens