Khalil S. Hindi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2018

Algorithms for the unrelated parallel machine scheduling problem with a resource constraintKrzysztof Fleszar 0002, Khalil S. Hindi. eor, 271(3):839-848, 2018. [doi]

2012

A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup timesKrzysztof Fleszar, Christoforos Charalambous, Khalil S. Hindi. jim, 23(5):1949-1958, 2012. [doi]

2010

A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling ProblemChristoforos Charalambous, Krzysztof Fleszar, Khalil S. Hindi. ifip12 2010: 230-237 [doi]

2009

Fast, effective heuristics for the 0-1 multi-dimensional knapsack problemKrzysztof Fleszar, Khalil S. Hindi. cor, 36(5):1602-1607, 2009. [doi]

A variable neighbourhood search algorithm for the open vehicle routing problemKrzysztof Fleszar, Ibrahim H. Osman, Khalil S. Hindi. eor, 195(3):803-809, 2009. [doi]

2008

An effective VNS for the capacitated p-median problemKrzysztof Fleszar, Khalil S. Hindi. eor, 191(3):612-622, 2008. [doi]

A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release timesMohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi. cor, 35(4):1099-1111, 2008. [doi]

2007

A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costsMohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi. eor, 183(1):74-86, 2007. [doi]

2004

Solving the resource-constrained project scheduling problem by a variable neighbourhood searchKrzysztof Fleszar, Khalil S. Hindi. eor, 155(2):402-413, 2004. [doi]

A constraint propagation heuristic for the single-hoist, multiple-products scheduling problemKhalil S. Hindi, Krzysztof Fleszar. candie, 47(1):91-101, 2004. [doi]

EditorialIbrahim H. Osman, Khalil S. Hindi. jmma, 3(3):179-181, 2004. [doi]

2003

An enumerative heuristic and reduction methods for the assembly line balancing problemKrzysztof Fleszar, Khalil S. Hindi. eor, 145(3):606-620, 2003. [doi]

An effective heuristic for the CLSP with set-up timesKhalil S. Hindi, Krzysztof Fleszar, Christoforos Charalambous. jors, 54(5):490-498, 2003. [doi]

2002

New heuristics for one-dimensional bin-packingKrzysztof Fleszar, Khalil S. Hindi. cor, 29(7):821-839, 2002. [doi]

An evolutionary algorithm for resource-constrained project schedulingKhalil S. Hindi, Hongbo Yang, Krzysztof Fleszar. tec, 6(5):512-518, 2002.

2001

Minimum-weight spanning tree algorithms A survey and empirical studyCüneyt F. Bazlamaçci, Khalil S. Hindi. cor, 28(8):767-785, 2001. [doi]

2000

Modelling multi-stage manufacturing systems for efficient schedulingChristoforos Charalambous, Turaj Tahmassebi, Khalil S. Hindi. eor, 122(2):329-338, 2000. [doi]

Assignment of program modules to processors: A simulated annealing approachYskandar Hamam, Khalil S. Hindi. eor, 122(2):509-513, 2000. [doi]

1999

Efficient solution of large scale, single-source, capacitated plant location problemsKhalil S. Hindi, Krzysztof Pienkosz. jors, 50(3):268-274, 1999. [doi]

1991

Optimized routing in flexible manufacturing systems with blockingChang-Qing Jiang, Madan G. Singh, Khalil S. Hindi. tsmc, 21(3):589-595, 1991. [doi]

1987

Optimized Design of Low-Voltage Distribution Networks a Comprehensive AlgorithmYskandar Hamam, Khalil S. Hindi. tsmc, 17(3):502-507, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL