Some comments on sequencing with controllable processing items

Some comments on sequencing with controllable processing items

0.00 Avg rating0 Votes
Article ID: iaor2005169
Country: United States
Volume: 68
Issue: 2
Start Page Number: 181
End Page Number: 192
Publication Date: Jan 2002
Journal: Computing
Authors: ,
Abstract:

We discuss sequencing problems on a single machine with controllable job processing times. For the maximum job cost criterion, we present several polynomial time results. For the total weighted job completion time criterion, we present an NP-hardness result. Our results settle several open questions in this area.

Reviews

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