Scheduling Algorithms

Brucker, P. (2007). Scheduling Algorithms. Springer.

Type

Book

Intellectual base

Review or monograph

Year

2007

DOI

10.1007/978-3-540-69516-5

ISBN

9783540695158

Link

https://doi.org/10.1007/978-3-540-69516-5

Cited from

operations_research

Cited by

2 citations across 2 artifacts.

Primes

• Scheduling
  • A scheduling problem, in Brucker's (2007) formal treatment, is a tuple (J, R, C, f) where J is a set of jobs (each with attributes such as processing time p_j, release time r_j, deadline d_j, weight w_j), R is a set of resources (each with capacity profile and availability windows), C is a set of constraints (precedence (partial order ≺), capacity (machine availability), compatibility, release dates, deadlines), and f is an objective function mapping feasible schedules to real values.

Domain-specific

• Job-shop scheduling
  • Exact branch-and-bound, mixed-integer or constraint programming, and heuristic search explore the large space of machine orderings, but none of these solution methods is the problem identity.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:fa41448eab2b · see in the full table