A heuristic algorithm for open-shop problem with release times and its worst-case analysis

A heuristic algorithm for open-shop problem with release times and its worst-case analysis

0.00 Avg rating—0 Votes
Article ID: iaor20041560
Country: China
Volume: 20
Issue: 4
Start Page Number: 62
End Page Number: 65
Publication Date: Dec 2002
Journal: Journal of Hubei Institute for Nationalities
Authors:
Abstract:

We consider the open-shop problem with release times. Given a simple heuristic algorithm, we discuss the worst-case performance, and prove that the worst-case performance is 2–1/m. When m=2, the worst-case performance is 3/2. The bound is tight.

Reviews

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