A fully polynomial time approximation scheme for scheduling a two-machine flowshop with one unavailability interval

A fully polynomial time approximation scheme for scheduling a two-machine flowshop with one unavailability interval

0.00 Avg rating0 Votes
Article ID: iaor20052148
Country: United States
Volume: 51
Issue: 3
Start Page Number: 307
End Page Number: 315
Publication Date: Apr 2004
Journal: Naval Research Logistics
Authors: ,
Keywords: maintenance, repair & replacement, heuristics
Abstract:

We study a deterministic two-machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP-hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n54) time complexity.

Reviews

Required fields are marked *. Your email address will not be published.