×

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. (English) Zbl 0229.90029


MSC:

90C10 Integer programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] and , Applied Dynamic Programming (Princeton University Press, Princeton, New Jersey, 1962). · Zbl 0106.34901 · doi:10.1515/9781400874651
[2] , and , Theory of Scheduling (Addison-Wesley, Reading, Massachusetts 1967).
[3] Eastman, Management Science 11 pp 754– (1965)
[4] Elmaghraby, J. Ind. Eng. 19 pp 105– (1968)
[5] Emmons, Operations Research 17 pp 701– (1969)
[6] Held, SIAM J. 10 pp 196– (1962)
[7] The Design and Analysis of Experiments (John Wiley and Sons, Inc., New York, 1952).
[8] Lawler, Management Science 11 pp 280– (1964)
[9] Schild, Management Science 7 pp 280– (1961)
[10] Schild, Management Science 9 pp 73– (1962)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.