Abstract
We consider the makespan problem on uniform parallel machines, given that some resource consumption cannot exceed a certain level. Several meta-heuristic methods are proposed to generate approximate solutions. Computational results are also provided to demonstrate the performance of the proposed heuristic algorithms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
