Scheduling shops to minimize the weighted number of late jobs

Scheduling shops to minimize the weighted number of late jobs

0.00 Avg rating—0 Votes
Article ID: iaor199796
Country: Netherlands
Volume: 16
Issue: 5
Start Page Number: 277
End Page Number: 283
Publication Date: Dec 1994
Journal: Operations Research Letters
Authors: , ,
Keywords: job shop
Abstract:

The problem of scheduling jobs with a common due date d so that the weighted number of late jobs is minimized is considered for two machine open, flow, and job shops, NP-hardness proofs as well as optimization algorithms that run in time polynomial in d and the number of jobs are given for all three shop models.

Reviews

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