A probe-based algorithm for piecewise linear optimization in scheduling

DOI10.1023/A:1021897321637MaRDI QIDQ1861934zbMATH OpenOpenAlexFDO

Authors Farid Ajili, Hani El-Sakkout

Publication date 10 March 2003

Published in Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingconstraint programmingschedulinghybrid algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• On the optimality of linear schedules
• Line search method for solving a non-preemptive strictly periodic scheduling problem
• Probe backtrack search for minimal perturbation in dynamic scheduling
• An experimental study of LP-based approximation algorithms for scheduling problems
• scientific article; zbMATH DE number 1131737
• Synthesizing optimization algorithms for scheduling partially ordered set of problems
• scientific article; zbMATH DE number 1418275
• scientific article; zbMATH DE number 1982192
• On the optimality of exact and approximation algorithms for scheduling problems
• A note on appointment scheduling with piecewise linear cost functions

Cited in

(2)

• Probe backtrack search for minimal perturbation in dynamic scheduling
• A parametric simplex algorithm for biobjective piecewise linear programming problems

This page was built for publication: A probe-based algorithm for piecewise linear optimization in scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861934)