In this study, a single machine batch-scheduling problem with incompatible jobs
and dynamic arrivals is examined. The objective function is the minimization of
the total flow time of the jobs. For solving problems a case specific branch and
bound algorithm with a heuristic upper bound scheme and two alternative lower
bound procedures is used. An extensive computational experiment is conducted
to investigate the effects of certain parameters on the computation time. For the
most difficult parameter combination branch and bound algorithm can solve the
problems about 25 jobs with 4 different job types in a 10 minutes time on
average. For the problem types with higher number of jobs and the most difficult
parameter combination proposed upper bound heuristic can be used to obtain
near optimal solutions.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12605096/index.pdf |
| Date | 01 June 2004 |
| Creators | Korkmaz, Gediz |
| Contributors | Kayaligil, Sinan |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0015 seconds