Chapter 2: Previous scheduling research

[1]  S. Clearwater.  Market-based control: a paradigm for distributed resource allocation , 1996 .

[2]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[3]  Athanasios G. Mamalis,et al.  Determination of due dates in job shop scheduling by simulated annealing , 1996 .

[4]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[5]  Lars Lundberg,et al.  Performance Bounds on Multiprocessor Scheduling Strategies for Chain Structured Programs , 1994, J. Parallel Distributed Comput..

[6]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[7]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[8]  Kemal Efe,et al.  Heuristic Models of Task Assignment Scheduling in Distributed Systems , 1982, Computer.

[9]  CONSTANTINE D. POLYCHRONOPOULOS,et al.  Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers , 1987, IEEE Transactions on Computers.

[10]  Lars Lundberg,et al.  Performance bounds on multiprocessor scheduling strategies for statically allocated programs , 1993, BIT.

[11]  Donald K. Friesen,et al.  Tighter Bounds for the Multifit Processor Scheduling Algorithm , 1984, SIAM J. Comput..

[12]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[13]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[14]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[15]  Hans-Paul Schwefel,et al.  Numerical Optimization of Computer Models , 1982 .

[16]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[17]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[18]  Sivarama P. Dandamudi,et al.  A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems , 1995, IEEE Trans. Parallel Distributed Syst..

[19]  Lars Lundberg,et al.  Multiprocessor scheduling of age constraint processes , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).

[20]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[21]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[22]  Nirwan Ansari,et al.  Efficient multiprocessor scheduling based on genetic algorithms , 1990, [Proceedings] IECON '90: 16th Annual Conference of IEEE Industrial Electronics Society.

[23]  Michael Allen Langston,et al.  Processor scheduling with improved heuristic algorithms , 1981 .

[24]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[25]  Kum Khiong Yang,et al.  A comparison of stochastic scheduling rules for maximizing project net present value , 1995 .

[26]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[27]  Alan Burns,et al.  Choosing Task Periods to Minimise System Utilisation in Time Triggered Systems , 1996, Inf. Process. Lett..

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[29]  Fayez F. Boctor,et al.  Resource-constrained project scheduling by simulated annealing , 1996 .

[30]  Lars Lundberg,et al.  Utilization Based Schedulability Bounds for Age Constraint Process Sets in Real-Time Systems , 2002, Real-Time Systems.

[31]  Edith Schonberg,et al.  Factoring: a method for scheduling parallel loops , 1992 .

[32]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

[33]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[34]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[35]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[36]  Michael P. Wellman,et al.  Some economics of market-based distributed scheduling , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[37]  Alan Burns,et al.  An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.

[38]  Lars Lundberg.  Fixed Priority Scheduling of Age Constraint Processes , 1998, Euro-Par.

[39]  Shahid H. Bokhari,et al.  Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1988, IEEE Trans. Computers.