Folgen
Krzysztof Fleszar
Krzysztof Fleszar
Professor, American University of Beirut, Olayan School of Business
Bestätigte E-Mail-Adresse bei aub.edu.lb - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A variable neighbourhood search algorithm for the open vehicle routing problem
K Fleszar, IH Osman, KS Hindi
European Journal of Operational Research 195 (3), 803-809, 2009
3012009
New heuristics for one-dimensional bin-packing
K Fleszar, KS Hindi
Computers & operations research 29 (7), 821-839, 2002
2722002
Solving the resource-constrained project scheduling problem by a variable neighbourhood search
K Fleszar, KS Hindi
European Journal of Operational Research 155 (2), 402-413, 2004
2422004
An evolutionary algorithm for resource-constrained project scheduling
KS Hindi, H Yang, K Fleszar
IEEE Transactions on Evolutionary Computation 6 (5), 512-518, 2002
1332002
An enumerative heuristic and reduction methods for the assembly line balancing problem
K Fleszar, KS Hindi
European Journal of Operational Research 145 (3), 606-620, 2003
1232003
An effective VNS for the capacitated p-median problem
K Fleszar, KS Hindi
European Journal of Operational Research 191 (3), 612-622, 2008
1162008
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
K Fleszar, C Charalambous
European Journal of Operational Research 210 (2), 176-184, 2011
892011
An effective heuristic for the CLSP with set-up times
KS Hindi, K Fleszar, C Charalambous
Journal of the Operational Research Society 54 (5), 490-498, 2003
692003
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
C Charalambous, K Fleszar
Computers & Operations Research 38 (10), 1443-1451, 2011
592011
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
K Fleszar, KS Hindi
European Journal of Operational Research 271 (3), 839-848, 2018
582018
Fast, effective heuristics for the 0–1 multi-dimensional knapsack problem
K Fleszar, KS Hindi
Computers & Operations Research 36 (5), 1602-1607, 2009
582009
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times
K Fleszar, C Charalambous, KS Hindi
Journal of Intelligent Manufacturing 23 (5), 1949-1958, 2012
502012
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
K Fleszar
Computers & Operations Research 40 (1), 463-474, 2013
492013
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem
KS Hindi, K Fleszar
Computers & Industrial Engineering 47 (1), 91-101, 2004
482004
A branch-and-bound algorithm for the quadratic multiple knapsack problem
K Fleszar
European Journal of Operational Research 298 (1), 89-98, 2022
182022
A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
K Fleszar
European Journal of Operational Research 259 (1), 169-174, 2017
102017
A hybrid searching method for the unrelated parallel machine scheduling problem
C Charalambous, K Fleszar, KS Hindi
Artificial Intelligence Applications and Innovations: 6th IFIP WG 12.5 …, 2010
102010
Hybrid of the weighted minimum slack and shortest processing time dispatching rules for the total weighted tardiness single machine scheduling problem with availability constraints
I Osman, H Belouadah, K Fleszar, M Saffar
Multidisciplinary International Conference on Scheduling: Theory and …, 2009
92009
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
K Fleszar
INFORMS Journal on Computing 28 (4), 703-720, 2016
82016
A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
K Fleszar
European Journal of Operational Research 303 (1), 37-53, 2022
62022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20