991 resultados para SON enhanced algorithm
Resumo:
Titre original : Theophron. Adaptation
Resumo:
The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.
Resumo:
Collection : Collection de documents inédits sur l'histoire de France
Resumo:
Collection : Collection de documents inédits sur l'histoire de France
Resumo:
Collection : Collection de documents inédits sur l'histoire de France
Resumo:
Collection : Collection de documents inédits sur l'histoire de France
Resumo:
Collection : Collection de documents inédits sur l'histoire de France
Resumo:
Collection : Collection de documents inédits sur l'histoire de France
Resumo:
Collection : Collection de documents inédits sur l'histoire de France
Resumo:
Collection : Collection de documents inédits sur l'histoire de France