Hindi Khalil S.

Khalil S. Hindi

Information about the author Khalil S. Hindi will soon be added to the site.
Found 10 papers in total
A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
2008
This paper addresses scheduling a set of jobs with specified release times on a single...
Solving the resource-constrained project scheduling problem by a variable neighbourhood search
2004
The well-known, challenging problem of resource-constrained project scheduling is...
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem
2004
A heuristic algorithm for solving the single-hoist, multiple-product scheduling...
An enumerative heuristic and reduction methods for the assembly line balancing problem
2003
A new heuristic algorithm and new reduction techniques for the type 1 assembly line...
New heuristics for one-dimensional bin-packing
2002
Several new heuristics for solving the one-dimensional bin packing problem are...
Minimum-weight spanning tree algorithms: A survey and empirical study
2001
The minimum-weight spanning tree problem is one of the most typical and well-known...
Assignment of program modules to processors: A simulated annealing approach
2000
A simulated annealing approach to the assignment of program modules to processors in a...
Modelling multi-stage manufacturing systems for efficient scheduling
2000
A novel approach to modelling complex, multi-stage manufacturing systems is presented....
Enhanced adjacent extreme-point search and tabu search for the minimum concave-cost uncapacitated transshipment problem
1996
Practicable methods for optimising concave-cost, uncapacitated transshipment networks...
Approximate decomposition for closed queueing network models of FMSs with a block-and-wait and state-dependent routing mechanism
1993
Closed queueing networks with a central server configuration are used to analyse the...
Papers per page: