Krzysztof Fleszar

According to our database, Krzysztof Fleszar authored at least 21 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2023

A new MILP model and fast heuristics for the variable-sized bin packing problem with time windows.

Krzysztof Fleszar

Comput. Ind. Eng., 2023

2022

A branch-and-bound algorithm for the quadratic multiple knapsack problem.

Krzysztof Fleszar

Eur. J. Oper. Res., 2022

A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation.

Krzysztof Fleszar

Eur. J. Oper. Res., 2022

2018

Algorithms for the unrelated parallel machine scheduling problem with a resource constraint.

Krzysztof Fleszar, Khalil S. Hindi

Eur. J. Oper. Res., 2018

2017

A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2).

Krzysztof Fleszar

Eur. J. Oper. Res., 2017

2016

An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem.

Krzysztof Fleszar

INFORMS J. Comput., 2016

2013

Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts.

Krzysztof Fleszar

Comput. Oper. Res., 2013

2012

A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times.

Krzysztof Fleszar, Christoforos Charalambous, Khalil S. Hindi

J. Intell. Manuf., 2012

Variable Neighborhood Descent for the Unrelated Parallel Machine Scheduling Problem.

Christoforos Charalambous, Krzysztof Fleszar

Int. J. Artif. Intell. Tools, 2012

2011

Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem.

Krzysztof Fleszar, Christoforos Charalambous

Eur. J. Oper. Res., 2011

A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts.

Christoforos Charalambous, Krzysztof Fleszar

Comput. Oper. Res., 2011

2010

A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem.

Christoforos Charalambous, Krzysztof Fleszar, Khalil S. Hindi

Proceedings of the Artificial Intelligence Applications and Innovations, 2010

2009

A variable neighbourhood search algorithm for the open vehicle routing problem.

Krzysztof Fleszar, Ibrahim H. Osman, Khalil S. Hindi

Eur. J. Oper. Res., 2009

Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem.

Krzysztof Fleszar, Khalil S. Hindi

Comput. Oper. Res., 2009

2008

An effective VNS for the capacitated p-median problem.

Krzysztof Fleszar, Khalil S. Hindi

Eur. J. Oper. Res., 2008

2004

Solving the resource-constrained project scheduling problem by a variable neighbourhood search.

Krzysztof Fleszar, Khalil S. Hindi

Eur. J. Oper. Res., 2004

A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem.

Khalil S. Hindi, Krzysztof Fleszar

Comput. Ind. Eng., 2004

2003

An effective heuristic for the CLSP with set-up times.

Khalil S. Hindi, Krzysztof Fleszar, Christoforos Charalambous

J. Oper. Res. Soc., 2003

An enumerative heuristic and reduction methods for the assembly line balancing problem.

Krzysztof Fleszar, Khalil S. Hindi

Eur. J. Oper. Res., 2003

2002

An evolutionary algorithm for resource-constrained project scheduling.

Khalil S. Hindi, Hongbo Yang, Krzysztof Fleszar

IEEE Trans. Evol. Comput., 2002

New heuristics for one-dimensional bin-packing.

Krzysztof Fleszar, Khalil S. Hindi

Comput. Oper. Res., 2002