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

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

0.00 Avg rating—0 Votes
Article ID: iaor1991177
Country: Netherlands
Volume: 43
Issue: 3
Start Page Number: 267
End Page Number: 270
Publication Date: Dec 1989
Journal: European Journal of Operational Research
Authors:
Abstract:

An O(n5N) algorithm is proposed for the n-job problem 2/n/J, no-wait, ptji=1/Cmax, where N is the total number of tasks of all jobs.

Reviews

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