Krzysztof Fleszar

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 6

Top Topics

Packing Problem

Assembly Line Balancing

Guillotine Cutting

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Comput. Ind. Eng.

INFORMS J. Comput.

Publications

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