Open-shop scheduling problems with dominated machines

Open-shop scheduling problems with dominated machines

0.00 Avg rating—0 Votes
Article ID: iaor19881015
Country: United States
Volume: 36
Issue: 3
Start Page Number: 273
End Page Number: 281
Publication Date: Jun 1989
Journal: Naval Research Logistics
Authors:
Abstract:

This article deals with special cases of open-shop scheduling where n jobs have to be processed by m, m≥3, machines to minimize the schedule length. The main result obtained is an O(n) algorithm for the three-machine problem with a dominated machine.

Reviews

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