An Approach to the Scheduling of Jobs on Machines
- 1 July 1961
- journal article
- research article
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 23 (2) , 484-492
- https://doi.org/10.1111/j.2517-6161.1961.tb00432.x
Abstract
SUMMARY: Two methods based on sorting procedures are suggested for scheduling jobs on machines. One is shown in series of simulated trials to yield substantially better results than an existing method with the same amount of computing, and the other to give about the same results with less computing.Keywords
This publication has 12 references indexed in Scilit:
- The Schedule-Sequencing ProblemOperations Research, 1959
- Amphisbaenic SortingJournal of the ACM, 1959
- An integer linear‐programming model for machine schedulingNaval Research Logistics Quarterly, 1959
- Radix Exchange—An Internal Sorting Method for Digital ComputersJournal of the ACM, 1959
- The Influence of Storage Access Time on Merging Processes in a ComputerThe Computer Journal, 1959
- The Principles of SortingThe Computer Journal, 1958
- Sorting on Electronic Computer SystemsJournal of the ACM, 1956
- Sorting by Address CalculationJournal of the ACM, 1956
- Some Combinatorial Problems Arising in the Theory of Multi-Stage ProcessesJournal of the Society for Industrial and Applied Mathematics, 1954
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954