A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

0.00 Avg rating—0 Votes
Article ID: iaor19992317
Country: Netherlands
Volume: 106
Issue: 1
Start Page Number: 101
End Page Number: 107
Publication Date: Apr 1998
Journal: European Journal of Operational Research
Authors:
Keywords: computational analysis
Abstract:

This paper considers the no-wait scheduling of n jobs, where each job is a chain of unit processing time operations to be processed alternately on two machines. The objective is to minimize the mean flow time. We propose an O(n6)-time algorithm to produce an optimal schedule. It is also shown that if zero processing time operations are allowed, then the problem is NP-hard in the strong sense.

Reviews

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