Procedures for the bin packing problem with precedence constraints

The bin packing problem with precedence constraints (BPP-P) is a recently proposed variation of the classical bin packing problem (BPP), which corresponds to a basic model featuring many underlying characteristics of several scheduling and assembly line balancing problems. The formulation builds upon the BPP by incorporating precedence constraints among items, which force successor items to be packed into later bins than their predecessors.

[1]  Mohamed Haouari,et al.  Fast lifting procedures for the bin packing problem , 2005, Discret. Optim..

[2]  John Augustine,et al.  Strip packing with precedence constraints and strip packing with release times , 2009, Theor. Comput. Sci..

[3]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[4]  Jordi Pereira,et al.  A branch-and-bound algorithm for assembly line worker assignment and balancing problems , 2014, Comput. Oper. Res..

[5]  Mauro Dell'Amico,et al.  The Bin Packing Problem with Precedence Constraints , 2012, Oper. Res..

[6]  Thomas M. Tirpak.  Developing and Deploying Electronics Assembly Line Optimization Tools: A Motorola Case Study , 2008 .

[7]  François Vanderbeck,et al.  Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..

[8]  Jordi Pereira,et al.  An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time , 2013, Eur. J. Oper. Res..

[9]  Joaquín Bautista,et al.  Procedures for the Time and Space constrained Assembly Line Balancing Problem , 2011, Eur. J. Oper. Res..

[10]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[11]  Paolo Toth,et al.  Algorithms for the Bin Packing Problem with Conflicts , 2010, INFORMS J. Comput..

[12]  J. Pereira.  Empirical evaluation of lower bounding methods for the simple assembly line balancing problem , 2015 .

[13]  Zeger Degraeve,et al.  An linear programming based lower bound for the simple assembly line balancing problem , 2006, Eur. J. Oper. Res..

[14]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[15]  Michel Gendreau,et al.  Heuristics and lower bounds for the bin packing problem with conflicts , 2004, Comput. Oper. Res..

[16]  Johannes Sternatz,et al.  Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry , 2014, Eur. J. Oper. Res..

[17]  Alexandre Dolgui,et al.  Algorithms and implementation of a set partitioning approach for modular machining line design , 2012, Comput. Oper. Res..

[18]  Daniele Vigo,et al.  Bin Packing Approximation Algorithms: Combinatorial Analysis , 1999, Handbook of Combinatorial Optimization.

[19]  Joaquín Bautista,et al.  A dynamic programming based heuristic for the assembly line balancing problem , 2009, Eur. J. Oper. Res..

[20]  J. M. J. Schutten,et al.  Restricted dynamic programming: A flexible framework for solving realistic VRPs , 2012, Comput. Oper. Res..

[21]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[22]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[23]  Alberto Ceselli,et al.  Mathematical programming algorithms for bin packing problems with item fragmentation , 2014, Comput. Oper. Res..

[24]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[25]  Sheldon Howard Jacobson,et al.  A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem , 2012, INFORMS J. Comput..

[26]  Alexandre Dolgui,et al.  A taxonomy of line balancing problems and their solutionapproaches , 2013 .

[27]  Alexandre Dolgui,et al.  Combinatorial design of a minimum cost transfer line with parallel operations at workstations , 2007 .

[28]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[29]  Mhand Hifi,et al.  Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem , 2007, Comput. Oper. Res..

[30]  Sheldon H. Jacobson,et al.  An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset , 2014, Eur. J. Oper. Res..

[31]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[32]  Ruslan Sadykov,et al.  Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm , 2013, INFORMS J. Comput..

[33]  Armin Scholl,et al.  Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing , 2013, Eur. J. Oper. Res..

[34]  Cláudio Alves,et al.  A survey of dual-feasible and superadditive functions , 2010, Ann. Oper. Res..