Approximation results for flow shop scheduling problems with machine availability constraints
Kubzin, Mikhail A., Potts, Chris N. and Strusevich, Vitaly A. (2009) Approximation results for flow shop scheduling problems with machine availability constraints. Computers & Operations Research, 36, (2), 379-390. (doi:10.1016/j.cor.2007.10.013).
- Post print
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenarios in which some proportion of the processing is repeated but the job is otherwise resumable. For the
resumable scenario, problems with non-availability intervals on one of the machines are shown to admit fully polynomial-time approximation schemes that are based on an extended dynamic programming algorithm. For the problem with several non-availability intervals on the first machine, we present a fast 3/2-approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, polynomial-time approximation schemes are developed.
|Keywords:||flow shop scheduling, machine non-availability, approximation algorithm|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||04 May 2010 08:43|
|Last Modified:||08 Jun 2012 12:45|
|Contributors:||Kubzin, Mikhail A. (Author)
Potts, Chris N. (Author)
Strusevich, Vitaly A. (Author)
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)