A Heuristic for the Two-Machine Open Shop Scheduling Problem with Transportation Time
Tools
Strusevich, V (1998) A Heuristic for the Two-Machine Open Shop Scheduling Problem with Transportation Time. CASSM R & D Paper. (Unpublished)
Full text not available from this repository.Item Type: | Other |
---|---|
Additional Information: | 98/71 |
Uncontrolled Keywords: | job shop scheduling, approximation algorithm, worst-case analysis |
Subjects: | Q Science > QA Mathematics > QA76 Computer software T Technology > TA Engineering (General). Civil engineering (General) T Technology > TF Railroad engineering and operation |
Pre-2014 Departments: | School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Department of Mathematical Sciences School of Computing & Mathematical Sciences > Statistics & Operational Research Group |
Last Modified: | 14 Oct 2016 08:59 |
URI: | http://gala.gre.ac.uk/id/eprint/210 |
Actions (login required)
View Item |
Altmetric