Semi-on-line scheduling problems for maximizing the minimum machine completion time

Semi-on-line scheduling problems for maximizing the minimum machine completion time

0.00 Avg rating0 Votes
Article ID: iaor20022778
Country: China
Volume: 17
Issue: 1
Start Page Number: 107
End Page Number: 113
Publication Date: Jan 2001
Journal: Acta Mathematicae Applicatae Sinica
Authors:
Abstract:

This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time. For each problem, we propose a best possible algorithm.

Reviews

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