Systems, Man, and Cybernetics

 

Home

• [P798] Dynamic heuristics for the generalized job-shop scheduling problem
  Author(s): Fatima Ghedjati
  
  

  Abstract
  This paper proposes a solution of the generalized job-shop scheduling problem by using several original static and dynamic heuristics relying on the potential load of the machines. We consider a generalized job-shop problem with unrelated parallel machines which can process the operations of the different jobs and, moreover, any precedence constraints between the operations are allowed. The objective is to minimize the completion date of all the jobs (makespan). This problem is NP-hard. Experimental results using various important randomly generated benchmarks are satisfactory and promising.

  
   

Full Text (PDF)