A Lagrangian heuristic for sprint planning in agile software development

DOI10.1016/J.COR.2013.09.007zbMATH Open1348.68036DBLPjournals/cor/BoschettiGRT14OpenAlexW2091413362WikidataQ59374167 ScholiaQ59374167MaRDI QIDQ336900FDOQ336900

Authors: Matteo Golfarelli, Stefano Rizzi, Elisa Turricchia, Marco A. Boschetti 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.007

Recommendations

• Bin-packing-based planning of agile releases
• Heuristics, metaheuristics and approximate methods in planning and scheduling
• Lagrangian heuristics for instructor scheduling in executive development programmes
• A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
• An LP-Based Heuristic for Optimal Planning
• scientific article; zbMATH DE number 4068572
• scientific article; zbMATH DE number 4199945
• Lagrangian relaxation and constraint generation for allocation and advanced scheduling
• AgileGIST - a Framework for Iterative Development and Rapid Prototyping of DSS for Combinatorial Problems

zbMATH Keywords

mixed integer linear programmingmatheuristicsoptimization modelssoftware engineeringagile methodsLagrangian heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• An exact algorithm for the two-dimensional strip-packing problem
• Title not available (Why is that?)
• A computational study of exact knapsack separation for the generalized assignment problem

Cited In (3)

• AgileGIST - a Framework for Iterative Development and Rapid Prototyping of DSS for Combinatorial Problems
• A meta-heuristic extension of the Lagrangian heuristic framework
• Bin-packing-based planning of agile releases

Uses Software

• CPLEX

This page was built for publication: A Lagrangian heuristic for sprint planning in agile software development

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