An experimental comparison of solution algorithms for the single‐machine tardiness problem
- 1 March 1974
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 21 (1) , 187-199
- https://doi.org/10.1002/nav.3800210114
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound SolutionManagement Science, 1972
- An Improved Method for Scheduling Independent TasksA I I E Transactions, 1971
- A hybrid algorithm for the one machine sequencing problem to minimize total tardinessNaval Research Logistics Quarterly, 1971
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969
- The Quadratic Assignment ProblemManagement Science, 1963
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962