New heuristics for one-dimensional bin-packing. - Krzysztof Fleszar 002; Khalil S. Hindi (Comput. Oper. Res., 2002)

An evolutionary algorithm for resource-constrained project scheduling. - Khalil S. Hindi; Hongbo Yang; Krzysztof Fleszar 002 (IEEE Trans. Evol. Comput., 2002)

An enumerative heuristic and reduction methods for the assembly line balancing problem. - Krzysztof Fleszar 002; Khalil S. Hindi (Eur. J. Oper. Res., 2003)

An effective heuristic for the CLSP with set-up times. - Khalil S. Hindi; Krzysztof Fleszar 002; Christoforos Charalambous (J. Oper. Res. Soc., 2003)

A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem. - Khalil S. Hindi; Krzysztof Fleszar 002 (Comput. Ind. Eng., 2004)

Solving the resource-constrained project scheduling problem by a variable neighbourhood search. - Krzysztof Fleszar 002; Khalil S. Hindi (Eur. J. Oper. Res., 2004)

An effective VNS for the capacitated p-median problem. - Krzysztof Fleszar 002; Khalil S. Hindi (Eur. J. Oper. Res., 2008)

Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem. - Krzysztof Fleszar 002; Khalil S. Hindi (Comput. Oper. Res., 2009)

A variable neighbourhood search algorithm for the open vehicle routing problem. - Krzysztof Fleszar 002; Ibrahim H. Osman; Khalil S. Hindi (Eur. J. Oper. Res., 2009)

A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem. - Christoforos Charalambous; Krzysztof Fleszar 002; Khalil S. Hindi (AIAI, 2010)

A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts. - Christoforos Charalambous; Krzysztof Fleszar 002 (Comput. Oper. Res., 2011)

Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. - Krzysztof Fleszar 002; Christoforos Charalambous (Eur. J. Oper. Res., 2011)

Variable Neighborhood Descent for the Unrelated Parallel Machine Scheduling Problem. - Christoforos Charalambous; Krzysztof Fleszar 002 (Int. J. Artif. Intell. Tools, 2012)

A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. - Krzysztof Fleszar 002; Christoforos Charalambous; Khalil S. Hindi (J. Intell. Manuf., 2012)

Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts. - Krzysztof Fleszar 002 (Comput. Oper. Res., 2013)

An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem. - Krzysztof Fleszar 002 (INFORMS J. Comput., 2016)

A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2). - Krzysztof Fleszar 002 (Eur. J. Oper. Res., 2017)

Algorithms for the unrelated parallel machine scheduling problem with a resource constraint. - Krzysztof Fleszar 002; Khalil S. Hindi (Eur. J. Oper. Res., 2018)

A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation. - Krzysztof Fleszar 002 (Eur. J. Oper. Res., 2022)

A branch-and-bound algorithm for the quadratic multiple knapsack problem. - Krzysztof Fleszar 002 (Eur. J. Oper. Res., 2022)

A new MILP model and fast heuristics for the variable-sized bin packing problem with time windows. - Krzysztof Fleszar 002 (Comput. Ind. Eng., 2023)