Selection of Scheduling Criteria in Computer Systems
Explore this paper's citation graph
Summary
Linear decision procedures are presented so as to determine whether calculation of an optimal schedule is really worthwhile for a two-facility sequencing situation internal to computer systems.
- Type
- article
- Published
- 1976-09-01
- Cited by
- 0
- References
- 14
- OpenAlex
- https://openalex.org/W2315058050
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:61634937
Keywords
Computer science, Sequence (biology), Schedule, Selection (genetic algorithm), Scheduling (production processes)
References
- Operating Systems Theory
- Theory of scheduling
- On some sequencing problems
- Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth
- Time Bounds for Selection
- A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem
- Optimal two- and three-stage production schedules with setup times included
- A sorting problem and its complexity
- Processing Times for Segmented Jobs with I/O Compute Overlap
- A Tournament Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process †
- Sequencing Aspects of Multiprogramming
- ON THE BOUND OF MAKESPANS AND ITS APPLICATION IN M MACHINE SCHEDULING PROBLEM
- A Tournament Problem
- The art of computer programming
Cited by
No citing papers recorded for this paper.
Related papers
- Experimental Tests of a Selection Index
- Effects of disruptive selection
- THE INFLUENCE OF ENVIRONMENTAL VARIATION ON GROUP AND INDIVIDUAL SELECTION IN A CRESS
- Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs
- Improved scheduling strategy for batching tools in semiconductor wafer fabrication