ILP and CP Formulations for the Lazy Bureaucrat Problem

  • Fabio Furini
  • Ivana LjubićEmail author
  • Markus Sinnl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9075)


Lazy reformulations of classical combinatorial optimization problems are new and challenging classes of problems. In this paper we focus on the Lazy Bureaucrat Problem (LBP) which is the lazy counterpart of the knapsack problem. Given a set of tasks with a common arrival time and deadline, the goal of a lazy bureaucrat is to schedule a least profitable subset of tasks, while having an excuse that no other tasks can be scheduled without exceeding the deadline.

Three ILP formulations and their CP counterparts are studied and implemented. In addition, a dynamic programming algorithm that runs is pseudo-polynomial time and polynomial greedy heuristics are implemented and computationally compared with ILP/CP approaches. For the computational study, a large set of knapsack-type instances with various characteristics is used to examine the applicability and strength of the proposed approaches.


Integer Linear Programming Knapsack Problem Constraint Programming Valid Inequality Critical Item 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arkin, E.M., Bender, M.A., Mitchell, J.S., Skiena, S.S.: The lazy bureaucrat scheduling problem. Information and Computation 184(1), 129–146 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Boyar, J., Epstein, L., Favrholdt, L.M., Kohrt, J.S., Larsen, K.S., Pedersen, M.M., Wøhlk, S.: The maximum resource bin packing problem. Theoretical Computer Science 362(1–3), 127–139 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Casazza, M., Ceselli, A.: Mathematical programming algorithms for bin packing problems with item fragmentation. Computers & Operations Research 46, 1–11 (2014)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Gai, L., Zhang, G.: On lazy bureaucrat scheduling with common deadlines. Journal of Combinatorial Optimization 15(2), 191–199 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Gourvés, L., Monnot, J., Pagourtzis, A.T.: The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design. In: Gasieniec, L., Wolter, F. (eds.) FCT 2013. Lecture Notes in Computer Science, vol. 8070, pp. 171–182. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  6. 6.
    Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0–1 knapsack problem. Management Science 45, 414–424 (1999)CrossRefzbMATHGoogle Scholar
  7. 7.
    Pisinger, D.: David Pisinger’s optimization codes (2014).
  8. 8.
    Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Trick, M.A.: A dynamic programming approach for consistency and propagation for knapsack constraints. Annals of Operations Research 118(1–4), 73–84 (2003)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.PSLUniversité Paris-Dauphine, CNRS, LAMSADE UMR 7243Paris Cedex 16France
  2. 2.Department of Statistics and Operations ResearchUniversity of ViennaViennaAustria

Personalised recommendations