Krzysztof Fleszar

21 papers Misc 1Journal 20
YearRankTypeTitle / Venue / Authors
2023 J jnl
A new MILP model and fast heuristics for the variable-sized bin packing problem with time windows.
Comput. Ind. Eng.
Krzysztof Fleszar
2022 J jnl
A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation.
Eur. J. Oper. Res.
Krzysztof Fleszar
2022 J jnl
A branch-and-bound algorithm for the quadratic multiple knapsack problem.
Eur. J. Oper. Res.
Krzysztof Fleszar
2018 J jnl
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint.
Eur. J. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2017 J jnl
A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2).
Eur. J. Oper. Res.
Krzysztof Fleszar
2016 J jnl
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem.
INFORMS J. Comput.
Krzysztof Fleszar
2013 J jnl
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts.
Comput. Oper. Res.
Krzysztof Fleszar
2012 J jnl
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times.
J. Intell. Manuf.
Krzysztof Fleszar, Christoforos Charalambous, Khalil S. Hindi
2012 J jnl
Variable Neighborhood Descent for the Unrelated Parallel Machine Scheduling Problem.
Int. J. Artif. Intell. Tools
Christoforos Charalambous, Krzysztof Fleszar
2011 J jnl
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts.
Comput. Oper. Res.
Christoforos Charalambous, Krzysztof Fleszar
2011 J jnl
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem.
Eur. J. Oper. Res.
Krzysztof Fleszar, Christoforos Charalambous
2010 Misc conf
A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem.
AIAI
Christoforos Charalambous, Krzysztof Fleszar, Khalil S. Hindi
2009 J jnl
A variable neighbourhood search algorithm for the open vehicle routing problem.
Eur. J. Oper. Res.
Krzysztof Fleszar, Ibrahim H. Osman, Khalil S. Hindi
2009 J jnl
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem.
Comput. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2008 J jnl
An effective VNS for the capacitated p-median problem.
Eur. J. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2004 J jnl
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem.
Comput. Ind. Eng.
Khalil S. Hindi, Krzysztof Fleszar
2004 J jnl
Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
Eur. J. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2003 J jnl
An effective heuristic for the CLSP with set-up times.
J. Oper. Res. Soc.
Khalil S. Hindi, Krzysztof Fleszar, Christoforos Charalambous
2003 J jnl
An enumerative heuristic and reduction methods for the assembly line balancing problem.
Eur. J. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2002 J jnl
An evolutionary algorithm for resource-constrained project scheduling.
IEEE Trans. Evol. Comput.
Khalil S. Hindi, Hongbo Yang, Krzysztof Fleszar
2002 J jnl
New heuristics for one-dimensional bin-packing.
Comput. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi