Non-approximability of just-in-time scheduling

Non-approximability of just-in-time scheduling

0.00 Avg rating—0 Votes
Article ID: iaor200971287
Country: United Kingdom
Volume: 12
Issue: 5
Start Page Number: 555
End Page Number: 562
Publication Date: Oct 2009
Journal: Journal of Scheduling
Authors: ,
Abstract:

We consider the following single machine just-in-time scheduling problem with earliness and tardiness costs: Given n jobs with processing times, due dates and job weights, the task is to schedule these jobs without preemption on a single machine such that the total weighted discrepancy from the given due dates is minimum.

Reviews

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