The Library
On-line scheduling of small open shops
Tools
Tools
Tools
UNSPECIFIED (2001) On-line scheduling of small open shops. DISCRETE APPLIED MATHEMATICS, 110 (2-3). pp. 133-150. ISSN 0166-218X
Full text not available from this repository.Abstract
We investigate the problem of on-line scheduling open shops of two and three machines with an objective of minimizing the schedule makespan. We first propose a 1.848-competitive permutation algorithm for the non-preemptive scheduling problem of two machines and show that no permutation algorithm can be better than 1.754-competitive. Secondly, we develop a (27/19)-competitive algorithm for the preemptive scheduling problem of three machines, which is most competitive. (C) 2001 Elsevier Science B.V. All rights reserved.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Journal or Publication Title: | DISCRETE APPLIED MATHEMATICS |
| Publisher: | ELSEVIER SCIENCE BV |
| ISSN: | 0166-218X |
| Date: | 15 June 2001 |
| Volume: | 110 |
| Number: | 2-3 |
| Number of Pages: | 18 |
| Page Range: | pp. 133-150 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/12189 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
