The job shop scheduling problem, in which we must determine the order or sequence for processing a set of jobs through several machines in an optimum manner, has received considerable attention. In this paper a number of the methods and techniques are reviewed and an attempt to categorize them according to their appropriateness for effective use in job shop scheduling has been made. Approaches are classified in two categories: a) analytical techniques and b) graphical methods. Also, it should be noticed that this report does not include all the attempts and trials, especially the heuristic approaches.
| Identifer | oai:union.ndltd.org:ucf.edu/oai:stars.library.ucf.edu:rtd-1389 |
| Date | 01 January 1977 |
| Creators | Yang, Yoo Baik |
| Publisher | Florida Technological University |
| Source Sets | University of Central Florida |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Retrospective Theses and Dissertations |
| Rights | Public Domain |
Page generated in 0.0019 seconds