Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
Year of publication: |
1994
|
---|---|
Authors: | Hariri, A. M. A. ; Potts, C. N. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 40.1994, 12, p. 1712-1719
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | single machine scheduling | due date | deadline | dynamic programming | state-space relaxation | branch and bound |
-
Benmansour, Rachid, (2014)
-
Shirvani, Nargess, (2014)
-
Shirvani, Nargess, (2014)
- More ...
-
Single machine scheduling to minimize total weighted late work
Hariri, A. M., (1992)
-
Algorithms for two-machine flow-shop sequencing with precedente constraints
Hariri, A. M. A., (1984)
-
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
Hariri, A. M. A., (1989)
- More ...