| Titre : | Scheduling, to minimize total cost |
| Auteurs : | Hocine Belouadah, Auteur ; C. N. Potts, Directeur de thèse |
| Type de document : | texte imprimé |
| Editeur : | Keele [England] : [s.n.], 1985 |
| Format : | 90 f. / ill. / 30 cm. |
| Note générale : |
Master Thesis : Mathematics : University of Keele : 1985
Bibliogr. f. I - VIII |
| Langues : | Anglais |
| Index. décimale : | Ms01085 |
| Tags : | Machine scheduling Splitting technique Costs Lower bound |
| Résumé : |
The research carried out in this thesis falls in the general area of machine scheduling.
The plan of the thesis is as follows. The initial chapters focus on a description of machine scheduling problems to minimize total cost, and the approaches that are used to solve them. Also included is a review of the relevant literature. The next chapter gives a general description of a new job splitting technique that is used to derive lower bounds. It is shown that the technique can be applied in the case where costs are either a linear or an exponential function of completion times. The two following chapters apply the job splitting technique to a single machine scheduling problem and to a problem of scheduling on identical parallel machines. In earch case, a lower bound is obtained from job splitting, and various dominance rules are derived; these are incorporated into a branch and bound algorithm. Computational experience indicates that the branch and bound algorithms are reasonably efficient. Finally, a conclusion and possible further development of the results derived are included in the final chapter. |
Exemplaires (1)
| Cote | Support | Localisation | Section | Disponibilité | Spécialité | Etat_Exemplaire |
|---|---|---|---|---|---|---|
| Ms01085 | Papier | Bibliothèque centrale | Mémoire de Master | Disponible |
