Annals of Operations Research

, Volume 118, Issue 1–4, pp 35–48

A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling

  • Farid Ajili
  • Hani El Sakkout
Article

DOI: 10.1023/A:1021897321637

Cite this article as:
Ajili, F. & El Sakkout, H. Annals of Operations Research (2003) 118: 35. doi:10.1023/A:1021897321637

Abstract

A scheduling problem with piecewise linear (PL) optimization extends conventional scheduling by imposing a conjunction of combinatorial PL constraints involving the objective function variables. To solve this problem, this paper presents a hybrid algorithm where Constraint Programming (CP) search is supported and driven by a (integer) linear programming solver running on a well-controlled subproblem which is dynamically tightened. The paper discusses and compares different ways of decomposing the problem constraints between the CP search and the solver. We show how the subproblem structure and the piecewise linearity are exploited by the search.

linear programming constraint programming scheduling hybrid algorithms 

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Farid Ajili
    • 1
  • Hani El Sakkout
    • 2
  1. 1.IC-ParcImperial CollegeLondonUnited Kingdom
  2. 2.Parc Technologies LtdLondonUnited Kingdom

Personalised recommendations