Location of Repository

Approximation results for flow shop scheduling problems with machine availability constraints

By Mikhail A. Kubzin, Chris N. Potts and Vitaly A. Strusevich

Abstract

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<br/>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

Topics: QA
Year: 2009
OAI identifier: oai:eprints.soton.ac.uk:149837
Provided by: e-Prints Soton

Suggested articles

Preview

Citations

  1. (2000). An improved heuristic for two-machine flowshop scheduling with an availability constraint. doi
  2. (1985). Analysis of a linear programming heuristic for scheduling unrelated parallel machines, doi
  3. (2001). Complexity results on and approximation algorithms for the two machine no-wait flow-shop with limited machine availability. doi
  4. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. doi
  5. (2001). Heuristics for two-machine no-wait flowshop scheduling with an availability constraint. doi
  6. (1996). Machine scheduling with an availability constraint. doi
  7. (1998). Machine scheduling with availability constraints. doi
  8. (1998). Minimizing makespan in open shops: A polynomial time approximation scheme, doi
  9. (1999). Minimizing the makespan in the two machine no-wait flow-shop with limited machine availability. doi
  10. (1997). Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. doi
  11. (2003). Non-preemptive two-machine open shop scheduling with non-availability constraints. doi
  12. (1954). Optimal two- and three-stage production schedules with Setup times included. doi
  13. (2000). Scheduling with limited machine availability. doi
  14. (1964). Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. doi
  15. (1993). Sequencing and scheduling: algorithms and complexity,” doi
  16. (1989). Speeding up linear programming using fast matrix multiplication. In: doi
  17. (2002). Two-machine flow shop no-wait scheduling with a non-availability interval. Paper 02/IM/99, doi
  18. (2002). Two-machine flow shop with limited machine availability. doi
  19. (1999). Two-machine flowshop scheduling with availability constraints. doi
  20. (1999). Two-machine flowshop scheduling with consecutive availability constraints. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.