Scheduling Independent Tasks on Parallel Processors
Explore this paper's citation graph
Summary
An optimal scheduling rule is presented for the single processor scheduling of tasks with continuously discounted linear waiting costs and a dynamic programming algorithm has been developed for a wide class of parallel-processor problems.
- Type
- article
- Published
- 1966-01-01
- Cited by
- 245
- References
- 7
- OpenAlex
- https://openalex.org/W2084814858
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:62226507
Keywords
Computer science, Scheduling (production processes), Dynamic priority scheduling, Parallel computing, Discounting
References
- A dynamic programming approach to sequencing problems
- On Scheduling Problems with Deferral Costs
- Scheduling with Deadlines and Loss Functions
- Scheduling Tasks with Deadlines and Non-Linear Loss Functions
- Bounds for the Optimal Scheduling of n Jobs on m Processors
- On Scheduling Tasks with Associated Linear Loss Functions
- Scheduling with Deadlines and Loss Functions on k Parallel Machines
Cited by
- A Review of Machine Scheduling: Complexity, Algorithms and Approximability
- Optimal capacity and operation of deteriorating chemical production service facilities
- Chains and Trees: ‘Strong’–‘Weak’ Order in Job Scheduling
- ANALYSIS OF IMPLEMENTATION ERRORS IN DIGITAL COMPUTING SYSTEMS
- On the Scheduling of Jobs on a Number of Identical Machines.
- Optimisation d'un réseau de production et de distribution
- Sequencing and scheduling: algorithms and complexity
- Batch scheduling with deadlines on parallel machines
- MATHEMATICAL MODELS OF INFORMATION SYSTEMS
- A feasibility study of a computer-assisted plywood production scheduling system
- Branch and Bound Method to Solve Multi Objectives Function
- Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page
- Ordonnancement de tâches pour concilier la minimisation de la consommation d'énergie avec la qualité de service : optimisation et théorie des jeux. (Job scheduling in order to aggregate energy consumption and quality of service : optimization and game theory)
- For the airplane refueling problem local precedence implies global precedence
- Heuristics for minimizing mean tardiness form parallel machines
- Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices
- Procedures for sequencing tasks with one resource type
- Effective optimization methods for single-machine scheduling (Survey)
- Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models
- Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
Related papers
- The improved EDF scheduling algorithm for embedded real-time system in the uncertain environment
- Study of Scheduling Algorithm in Real Time System on Uninprocessors
- Implementation of Dynamic-Priority Scheduling Algorithm and EDF Algorithm in WebitOS
- Developing a New Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems
- Performance Enhancement of Real Time System using Dynamic Scheduling Algorithms
- One-level and two-level scheduling for real-time systems