A note on sequencing jobs with deadlines problem

A note on sequencing jobs with deadlines problem

0.00 Avg rating0 Votes
Article ID: iaor1996491
Country: Netherlands
Volume: 59
Issue: 2
Start Page Number: 333
End Page Number: 336
Publication Date: Jun 1992
Journal: European Journal of Operational Research
Authors: ,
Abstract:

Two simple heuristic algorithms for sequencing jobs with deadlines problem are proposed. Computational results are reported. The algorithms are compared with the greedy algorithm presented by H.I. Stern and Z. Avivi in 1990.

Reviews

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