Non-preemptive two-machine open shop scheduling with non-availability constraints
Breit, J., Schmidt, G. and Strusevich, V.A. (2003) Non-preemptive two-machine open shop scheduling with non-availability constraints. Mathematical Methods of Operations Research, 57 (2). pp. 217-234. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860200267)
Full text not available from this repository.Abstract
We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability intervals and present an approximation algorithm with a worst-case ratio of 4/3 for the problem with a single non-availability interval.
Item Type: | Article |
---|---|
Additional Information: | [1] Final version of paper received: October 2002. [2] Published in print: May 2003. |
Uncontrolled Keywords: | open shop scheduling, availability constraints, worst-case analysis |
Subjects: | Q Science > QA Mathematics > QA76 Computer software T Technology > TJ Mechanical engineering and machinery |
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 |
Related URLs: | |
Last Modified: | 14 Oct 2016 09:01 |
URI: | http://gala.gre.ac.uk/id/eprint/656 |
Actions (login required)
View Item |