Krzysztof Fleszar

发表

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

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2003, Eur. J. Oper. Res..

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

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2009, Comput. Oper. Res..

An evolutionary algorithm for resource-constrained project scheduling

Krzysztof Fleszar, Khalil S. Hindi, Hongbo Yang, 2002, IEEE Trans. Evol. Comput..

An effective heuristic for the CLSP with set-up times

Krzysztof Fleszar, Khalil S. Hindi, Christoforos Charalambous, 2003, J. Oper. Res. Soc..

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

Krzysztof Fleszar, Khalil S. Hindi, Christoforos Charalambous, 2012, J. Intell. Manuf..

New heuristics for one-dimensional bin-packing

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2002, Comput. Oper. Res..

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

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2018, Eur. J. Oper. Res..

Variable Neighborhood Descent for the Unrelated Parallel Machine Scheduling Problem

Krzysztof Fleszar, Christoforos Charalambous, 2012, Int. J. Artif. Intell. Tools.

An effective VNS for the capacitated p-median problem

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2008, Eur. J. Oper. Res..

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

Krzysztof Fleszar, 2017, Eur. J. Oper. Res..

A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem

Krzysztof Fleszar, Khalil S. Hindi, Christoforos Charalambous, 2010, AIAI.

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

Krzysztof Fleszar, Christoforos Charalambous, 2011, Comput. Oper. Res..

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

Krzysztof Fleszar, Christoforos Charalambous, Krzysztof Fleszar, 2011, Eur. J. Oper. Res..

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

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2004, Eur. J. Oper. Res..

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

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2004, Comput. Ind. Eng..

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

Krzysztof Fleszar, 2016, INFORMS J. Comput..

A variable neighbourhood search algorithm for the open vehicle routing problem

Krzysztof Fleszar, Khalil S. Hindi, Ibrahim H. Osman, 2009, Eur. J. Oper. Res..

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

Krzysztof Fleszar, Krzysztof Fleszar, 2013, Comput. Oper. Res..

MINIMUM RECTILINEAR POLYGONS FOR GIVEN ANGLE SEQUENCES

Alexander Wolff, Chan-Su Shin, Krzysztof Fleszar, 2022 .

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

Krzysztof Fleszar, Krzysztof Fleszar, 2021, Eur. J. Oper. Res..

A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median pdf

Jaroslaw Byrka, Krzysztof Fleszar, Joachim Spoerhase, 2013, ArXiv.

Hybrid of the weighted minimum slack and shortest processing time dispatching rules for the total weighted tardiness single machine scheduling problem with availability constraints

Krzysztof Fleszar, Ibrahim H. Osman, Hocine Belouadah, 2009 .