default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhalil S. Hindi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j22]Krzysztof Fleszar
, Khalil S. Hindi:
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint. Eur. J. Oper. Res. 271(3): 839-848 (2018)- 2012
- [j21]Krzysztof Fleszar, Christoforos Charalambous, Khalil S. Hindi:
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. J. Intell. Manuf. 23(5): 1949-1958 (2012) - 2009
- [j20]Krzysztof Fleszar, Khalil S. Hindi:
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem. Comput. Oper. Res. 36(5): 1602-1607 (2009) - [j19]Krzysztof Fleszar, Ibrahim H. Osman, Khalil S. Hindi:
A variable neighbourhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 195(3): 803-809 (2009) - 2008
- [j18]Mohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi:
A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times. Comput. Oper. Res. 35(4): 1099-1111 (2008) - [j17]Krzysztof Fleszar, Khalil S. Hindi:
An effective VNS for the capacitated p-median problem. Eur. J. Oper. Res. 191(3): 612-622 (2008) - 2007
- [j16]Mohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi:
A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs. Eur. J. Oper. Res. 183(1): 74-86 (2007) - 2004
- [j15]Khalil S. Hindi, Krzysztof Fleszar:
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem. Comput. Ind. Eng. 47(1): 91-101 (2004) - [j14]Krzysztof Fleszar, Khalil S. Hindi:
Solving the resource-constrained project scheduling problem by a variable neighbourhood search. Eur. J. Oper. Res. 155(2): 402-413 (2004) - [j13]Ibrahim H. Osman, Khalil S. Hindi:
Editorial. J. Math. Model. Algorithms 3(3): 179-181 (2004) - 2003
- [j12]Krzysztof Fleszar, Khalil S. Hindi:
An enumerative heuristic and reduction methods for the assembly line balancing problem. Eur. J. Oper. Res. 145(3): 606-620 (2003) - [j11]Khalil S. Hindi, Krzysztof Fleszar, Christoforos Charalambous:
An effective heuristic for the CLSP with set-up times. J. Oper. Res. Soc. 54(5): 490-498 (2003) - 2002
- [j10]Krzysztof Fleszar, Khalil S. Hindi:
New heuristics for one-dimensional bin-packing. Comput. Oper. Res. 29(7): 821-839 (2002) - [j9]Khalil S. Hindi, Hongbo Yang, Krzysztof Fleszar:
An evolutionary algorithm for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6(5): 512-518 (2002) - 2001
- [j8]Cüneyt F. Bazlamaçci, Khalil S. Hindi:
Minimum-weight spanning tree algorithms A survey and empirical study. Comput. Oper. Res. 28(8): 767-785 (2001) - 2000
- [j7]Christoforos Charalambous, Turaj Tahmassebi, Khalil S. Hindi:
Modelling multi-stage manufacturing systems for efficient scheduling. Eur. J. Oper. Res. 122(2): 329-338 (2000) - [j6]Yskandar Hamam, Khalil S. Hindi:
Assignment of program modules to processors: A simulated annealing approach. Eur. J. Oper. Res. 122(2): 509-513 (2000) - 1999
- [j5]Khalil S. Hindi, Krzysztof Pienkosz:
Efficient solution of large scale, single-source, capacitated plant location problems. J. Oper. Res. Soc. 50(3): 268-274 (1999) - 1991
- [j4]Madan G. Singh, Khalil S. Hindi:
A multilevel multilayer framework for manufacturing control. J. Intell. Robotic Syst. 4(1): 75-93 (1991) - [j3]Chang-Qing Jiang, Madan G. Singh, Khalil S. Hindi:
Optimized routing in flexible manufacturing systems with blocking. IEEE Trans. Syst. Man Cybern. 21(3): 589-595 (1991) - 1987
- [j2]Khalil S. Hindi:
Control systems design: An introduction to state-space methods : Bernard Friedland. Autom. 23(6): 803-804 (1987) - [j1]Yskandar Hamam, Khalil S. Hindi:
Optimized Design of Low-Voltage Distribution Networks a Comprehensive Algorithm. IEEE Trans. Syst. Man Cybern. 17(3): 502-507 (1987)
Conference and Workshop Papers
- 2010
- [c1]Christoforos Charalambous, Krzysztof Fleszar, Khalil S. Hindi:
A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem. AIAI 2010: 230-237
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
