Job scheduling methods for reducing waiting time variance

Authors:
Nong Ye;Xueping Li;Toni Farley;Xiaoyun Xu
Affiliations:
Information and Systems Assurance Laboratory, Arizona State University, P.O. Box 875906, Tempe, AZ 85287-5906, USA;Information and Systems Assurance Laboratory, Arizona State University, P.O. Box 875906, Tempe, AZ 85287-5906, USA;Information and Systems Assurance Laboratory, Arizona State University, P.O. Box 875906, Tempe, AZ 85287-5906, USA;Information and Systems Assurance Laboratory, Arizona State University, P.O. Box 875906, Tempe, AZ 85287-5906, USA
Venue:
Computers and Operations Research
Year:
2007

Citing 23
Cited 4

Deterministic and random single machine sequencing with variance minimization

Operations Research
On the minimization of completion time variance with a bicriteria extension

Operations Research
New results on the completion time variance minimization

Proceedings of the workshop on Discrete algorithms
Web server workload characterization: the search for invariants

Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
Algorithms for minclique scheduling problems

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Pseudopolynomial algorithms for CTV minimization in single machine scheduling

Computers and Operations Research
A comparison of list schedules for parallel processing systems

Communications of the ACM
On-line scheduling of a single machine to minimize total weighted completion time

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Applying conflict management strategies in BDI agents for resource management in computational grids

ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Tabu search for a class of single-machine scheduling problems

Computers and Operations Research
QoS-Centric Stateful Resource Management in Information Systems

Information Systems Frontiers
A taxonomy of scheduling in general-purpose distributed computing systems

IEEE Transactions on Software Engineering
A branch and bound algorithm to minimize completion time variance on a single processor

Computers and Operations Research
A Unified Resource Scheduling Framework for Heterogeneous Computing Environments

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Scheduling with Advanced Reservations

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Imprecise Calendars: an Approach to Scheduling Computational Grids

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Web server QoS models: applying scheduling rules from production planning

Computers and Operations Research
QoS Requirements of Network Applications on the Internet

Information-Knowledge-Systems Management
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Completion time variance minimization on a single machine is difficult

Operations Research Letters
Proof of a conjecture of Schrage about the completion time variance problem

Operations Research Letters
A class of on-line scheduling algorithms to minimize total completion time

Operations Research Letters

Job scheduling to minimize the weighted waiting time variance of jobs

Computers and Industrial Engineering
Minimizing job completion time variance for service stability on identical parallel machines

Computers and Industrial Engineering
A new global optimization strategy for coordinated multi-robot exploration: Development and comparative evaluation

Robotics and Autonomous Systems
Minimizing weighted waiting time variance on a single processor

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into general blocks in two stages, with another two or more stages being required ...