SCHEDULING JOBS ON PARALLEL PROCESSORS WITH DYNAMIC PROGRAMMING
- 1 October 1973
- journal article
- Published by Wiley in Decision Sciences
- Vol. 4 (4), 447-457
- https://doi.org/10.1111/j.1540-5915.1973.tb00572.x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Sequencing ProblemManagement Science, 1969
- The sequencing of “related” jobsNaval Research Logistics Quarterly, 1968
- Scheduling Independent Tasks on Parallel ProcessorsManagement Science, 1966
- On Scheduling Problems with Deferral CostsManagement Science, 1964
- Bounds for the Optimal Scheduling of n Jobs on m ProcessorsManagement Science, 1964
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954