Probe backtrack search for minimal perturbation in dynamic scheduling

DOI10.1023/A:1009856210543zbMath0970.68014OpenAlexW1496031892MaRDI QIDQ1591427

Hani El-Sakkout, Mark G. Wallace

Publication date: 5 July 2001

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009856210543

zbMATH Keywords

probe backtrackingunimodular probing algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (18)

A hybrid constraint programming approach to a wood procurement problem with bucking decisions ⋮ ECLⁱPS^e – From LP to CLP ⋮ Integer programming for minimal perturbation problems in university course timetabling ⋮ Unnamed Item ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ Heuristic stability: a permutation disarray measure ⋮ \(\Gamma\)-robust optimization of project scheduling problems ⋮ Hybrid search for minimal perturbation in dynamic CSPs ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Quality recovering of university timetables ⋮ Integrating operations research in constraint programming ⋮ Integrating operations research in constraint programming ⋮ A hybrid constraint programming approach to the log-truck scheduling problem ⋮ Project scheduling under uncertainty: survey and research potentials ⋮ A theoretic and practical framework for scheduling in a stochastic environment ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation ⋮ Constraint solving in uncertain and dynamic environments: A survey

This page was built for publication: Probe backtrack search for minimal perturbation in dynamic scheduling