Today's commercial rapid prototyping systems (i.e., solid freeform fabrication, layered manufacturing) rely on human intervention to load and unload build jobs. Hence, jobs are processed subject to both the machine's and the operator's schedules. In particular, first-in-first-out (FIFO) queuing of such systems will result in machine idle time whenever a build job has been completed and an operator is not available to unload that build job and start up the next one. These machine idle times can significantly affect the system throughput, and, hence, the effective cost rate.
This thesis addresses this problem by rearranging the job queue to minimizing the machine idle time, subject to the machine's and operator's schedules. This is achieved by employing a general branch-and-bound search method, that, for efficiency, reduces the search space by identifying contiguous sequences and avoiding reshuffling of those sequences during the branching procedure. The effectiveness of this job scheduling optimization has been demonstrated using a sequence of 30 jobs extracted from the usage log for the FDM 1600 rapid prototyping system in the Department of Mechanical Engineering at Virginia Tech. / Master of Science
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/35845 |
| Date | 29 November 2001 |
| Creators | Wu, Yingxiang |
| Contributors | Mechanical Engineering, Bohn, Jan Helge, Sarin, Subhash C., Myklebust, Arvid |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Detected Language | English |
| Type | Thesis |
| Format | application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | thesis.pdf |
Page generated in 0.0018 seconds