Khalil S. Hindi

23 papers Misc 1Journal 22
YearRankTypeTitle / Venue / Authors
2018 J jnl
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint.
Eur. J. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2012 J jnl
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times.
J. Intell. Manuf.
Krzysztof Fleszar, Christoforos Charalambous, Khalil S. Hindi
2010 Misc conf
A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem.
AIAI
Christoforos Charalambous, Krzysztof Fleszar, Khalil S. Hindi
2009 J jnl
A variable neighbourhood search algorithm for the open vehicle routing problem.
Eur. J. Oper. Res.
Krzysztof Fleszar, Ibrahim H. Osman, Khalil S. Hindi
2009 J jnl
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem.
Comput. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2008 J jnl
A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times.
Comput. Oper. Res.
Mohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi
2008 J jnl
An effective VNS for the capacitated p-median problem.
Eur. J. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2007 J jnl
A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs.
Eur. J. Oper. Res.
Mohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi
2004 J jnl
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem.
Comput. Ind. Eng.
Khalil S. Hindi, Krzysztof Fleszar
2004 J jnl
Editorial.
J. Math. Model. Algorithms
Ibrahim H. Osman, Khalil S. Hindi
2004 J jnl
Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
Eur. J. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2003 J jnl
An effective heuristic for the CLSP with set-up times.
J. Oper. Res. Soc.
Khalil S. Hindi, Krzysztof Fleszar, Christoforos Charalambous
2003 J jnl
An enumerative heuristic and reduction methods for the assembly line balancing problem.
Eur. J. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2002 J jnl
An evolutionary algorithm for resource-constrained project scheduling.
IEEE Trans. Evol. Comput.
Khalil S. Hindi, Hongbo Yang, Krzysztof Fleszar
2002 J jnl
New heuristics for one-dimensional bin-packing.
Comput. Oper. Res.
Krzysztof Fleszar, Khalil S. Hindi
2001 J jnl
Minimum-weight spanning tree algorithms A survey and empirical study.
Comput. Oper. Res.
Cüneyt F. Bazlamaçci, Khalil S. Hindi
2000 J jnl
Assignment of program modules to processors: A simulated annealing approach.
Eur. J. Oper. Res.
Yskandar Hamam, Khalil S. Hindi
2000 J jnl
Modelling multi-stage manufacturing systems for efficient scheduling.
Eur. J. Oper. Res.
Christoforos Charalambous, Turaj Tahmassebi, Khalil S. Hindi
1999 J jnl
Efficient solution of large scale, single-source, capacitated plant location problems.
J. Oper. Res. Soc.
Khalil S. Hindi, Krzysztof Pienkosz
1991 J jnl
A multilevel multilayer framework for manufacturing control.
J. Intell. Robotic Syst.
Madan G. Singh, Khalil S. Hindi
1991 J jnl
Optimized routing in flexible manufacturing systems with blocking.
IEEE Trans. Syst. Man Cybern.
Chang-Qing Jiang, Madan G. Singh, Khalil S. Hindi
1987 J jnl
Control systems design: An introduction to state-space methods : Bernard Friedland.
Autom.
Khalil S. Hindi
1987 J jnl
Optimized Design of Low-Voltage Distribution Networks a Comprehensive Algorithm.
IEEE Trans. Syst. Man Cybern.
Yskandar Hamam, Khalil S. Hindi