Finding the optimal order for processing two conflict jobs

Finding the optimal order for processing two conflict jobs

0.00 Avg rating0 Votes
Article ID: iaor2008201
Country: Belarus
Volume: 4
Start Page Number: 103
End Page Number: 110
Publication Date: Dec 2006
Journal: Mathematical Sciences
Authors: ,
Keywords: queues: theory
Abstract:

The two-machine flow-shop scheduling problem with uncertain and bounded processing times and makespan criterion is considered. For the on-line version of the problem, sufficient conditions have been developed for the finding the optimal order for processing two conflict jobs.

Reviews

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