Krzysztof Fleszar

According to our database1, Krzysztof Fleszar authored at least 18 papers between 2002 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint.
Eur. J. Oper. Res., 2018

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

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

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

2012
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times.
J. Intell. Manuf., 2012

Variable Neighborhood Descent for the Unrelated Parallel Machine Scheduling Problem.
Int. J. Artif. Intell. Tools, 2012

2011
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem.
Eur. J. Oper. Res., 2011

A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts.
Comput. Oper. Res., 2011

2010
A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem.
Proceedings of the Artificial Intelligence Applications and Innovations, 2010

2009
A variable neighbourhood search algorithm for the open vehicle routing problem.
Eur. J. Oper. Res., 2009

Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem.
Comput. Oper. Res., 2009

2008
An effective VNS for the capacitated p-median problem.
Eur. J. Oper. Res., 2008

2004
Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
Eur. J. Oper. Res., 2004

A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem.
Comput. Ind. Eng., 2004

2003
An effective heuristic for the CLSP with set-up times.
J. Oper. Res. Soc., 2003

An enumerative heuristic and reduction methods for the assembly line balancing problem.
Eur. J. Oper. Res., 2003

2002
An evolutionary algorithm for resource-constrained project scheduling.
IEEE Trans. Evol. Comput., 2002

New heuristics for one-dimensional bin-packing.
Comput. Oper. Res., 2002


  Loading...