Title of article
Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
Author/Authors
Koulamas، نويسنده , , C.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
6
From page
57
To page
62
Abstract
The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.
Keywords
Single machine , Scheduling , Time windows
Journal title
Mathematical and Computer Modelling
Serial Year
1997
Journal title
Mathematical and Computer Modelling
Record number
1590713
Link To Document