A branch and bound to minimize the number of late jobs on a single machine with release time constraints
Year of publication: |
2003
|
---|---|
Authors: | Baptiste, Philippe ; Peridy, Laurent ; Pinson, Eric |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 144.2003, 1, p. 1-11
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Baptiste, Philippe, (2003)
-
A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor
Babu, Pascal, (2004)
-
Using short-term memory to minimize the weighted number of late jobs on a single machine
Peridy, Laurent, (2003)
- More ...