Title from PDF of title page. / Document formatted into pages; contains 80 pages. / Thesis (M.S.I.E.)--University of South Florida, 2003. / Includes bibliographical references. / Text (Electronic thesis) in PDF format. / ABSTRACT: This study focuses on the study of a unique but commonly occurring manufacturing problem of scheduling of customized jobs consisting of two operations on a single multi-purpose machine with the performance objective of minimizing the number of tardy jobs (jobs that are not completed by their due dates). Each customized job to be complete needs one unique operation and one common operation performed on it. We considered a static case in this work. The objective of minimizing the number of tardy jobs is considered where all jobs have equal weights and the maximum tardiness has no effect on the performance. This problem is proved in literature as NP-hard and hence practically very difficult to obtain optimal solution within reasonable computational time. Till date only a pseudo-polynomial algorithm is given to solve this problem with no concrete computational experiments designed to prove the efficiency and working of the algorithm for different problem instances. / ABSTRACT: We propose a heuristic algorithm based on the Moore-Hodgson's algorithm combining with other procedures and optimal schedule properties from the literature to solve this problem. In literature, Moore-Hodgson's algorithm is an efficient heuristic algorithm that minimizes the number of tardy jobs for the classical single machine one-operation problems. The performance of the heuristic is evaluated through extensive computational experiments for large real size data. The obtained results are compared to the solutions obtained by implementing the optimal pseudo-polynomial algorithm and the performance of the heuristic is tested on large data sets. The test data for the computational experiments are generated randomly using MATLAB 6.1. Future directions of research and development on the problem to improve the obtained solution by the heuristic algorithm are given. / System requirements: World Wide Web browser and PDF reader. / Mode of access: World Wide Web.

This study focuses on the study of a unique but commonly occurring manufacturing problem of scheduling of customized jobs consisting of two operations on a single multi-purpose machine with the performance objective of minimizing the number of tardy jobs (jobs that are not completed by their due dates). Each customized job to be complete needs one unique operation and one common operation performed on it. We considered a static case in this work. The objective of minimizing the number of tardy jobs is considered where all jobs have equal weights and the maximum tardiness has no effect on the performance. This problem is proved in literature as NP-hard and hence practically very difficult to obtain optimal solution within reasonable computational time. Till date only a pseudo-polynomial algorithm is given to solve this problem with no concrete computational experiments designed to prove the efficiency and working of the algorithm for different problem instances. We propose a heuristic algorithm based on the Moore-Hodgson's algorithm combining with other procedures and optimal schedule properties from the literature to solve this problem. In literature, Moore-Hodgson's algorithm is an efficient heuristic algorithm that minimizes the number of tardy jobs for the classical single machine one-operation problems. The performance of the heuristic is evaluated through extensive computational experiments for large real size data. The obtained results are compared to the solutions obtained by implementing the optimal pseudo-polynomial algorithm and the performance of the heuristic is tested on large data sets. The test data for the computational experiments are generated randomly using MATLAB 6.1. Future directions of research and development on the problem to improve the obtained solution by the heuristic algorithm are given.

Pendant les dernières décennies, le travail d'une partie toujours croissante de chercheurs qui s'occupent de robotique s'est focalisé sur un groupe spécifique de robots qui fait partie de la famille des manipulateurs parallèles: les robots à câbles. Malgré les nombreuses études que l'on a consacrées à ce sujet, ces robots présentent encore aujourd'hui plusieurs problématiques complètement ou partiellement irrésolues. En particulier l'étude de leur cinématique, qui se révèle déjà complexe pour les manipulateurs parallèles traditionnels, est rendu encore plus compliqué par la nature non linéaire des câbles qui peuvent seulement exercer des efforts de traction. Le travail présenté dans cette thèse concentre donc son attention sur l'étude de la cinématique des robots à câbles et sur la mise au point de techniques numériques capables d'aborder une partie des problématiques liées à cela. La plupart du travail se concentre sur l'élaboration d'un algorithme pour la résolution du problème géométrique direct pour n'importe quel manipulateur à câbles qui se fonde sur l'analyse par intervalles. Cette technique d'analyse permet non seulement de résoudre rapidement le problème mais également de garantir les résultats obtenus en cas d'erreurs d'élimination et d'arrondi et de prendre en considération les incertitudes éventuellement présentes dans le modèle du problème. Le code développé a été testé grâce à un petit prototype de manipulateur à câbles dont la réalisation, qui a eu lieu pendant le parcours de doctorat, est décrite à l'intérieur du mémoire en accord avec la phase de conception du projet et de simulation. / In the past two decades the work of a growing portion of researchers in robotics focused on a particular group of machines, belonging to the family of parallel manipulators: the cable robots. Although these robots share several theoretical elements with the better known parallel robots, they still present completely (or partly) unsolved issues. In particular, the study of their kinematic, already a difficult subject for conventional parallel manipulators, is further complicated by the non-linear nature of cables, which can transmit forces only when they are taut. The work presented in this thesis therefore focuses on the study of the kinematics of these robots and on the development of numerical techniques able to address some of the problems related to it. Most of the work is focused on the development of an interval-analysis-based procedure for the solution of the direct geometric problem (DGP) of a generic cable manipulator. This technique, as well as allowing for a rapid solution of the problem, also guarantees the results obtained against rounding and elimination errors and can take into account any uncertainties in the model of the problem. The developed code has been tested with the help of a small manipulator whose realization is described in this dissertation together with its design and simulation phases.