Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Lehtonen, Tapani
1988.
Scheduling jobs with exponential processing times on parallel machines.
Journal of Applied Probability,
Vol. 25,
Issue. 04,
p.
752.
Righter, Rhonda
1988.
Job scheduling to minimize expected weighted flowtime on uniform processors.
Systems & Control Letters,
Vol. 10,
Issue. 4,
p.
211.
Coffman, E.G.
Hofri, M.
and
Weiss, G.
1989.
Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines.
Probability in the Engineering and Informational Sciences,
Vol. 3,
Issue. 1,
p.
89.
Xu, Susan H.
Mirchandani, Pitu B.
Kumar, Srikanta P. R.
and
Weber, Richard R.
1990.
Stochastic dispatching of multi-priority jobs to heterogeneous processors.
Journal of Applied Probability,
Vol. 27,
Issue. 04,
p.
852.
Luh, P.
and
Viniotis, I.
1990.
Optimality of threshold policies for heterogeneous server systems.
p.
870.
Righter, Rhonda
and
Xu, Susan H.
1991.
Scheduling jobs on non-identical IFR processors to minimize general cost functions.
Advances in Applied Probability,
Vol. 23,
Issue. 4,
p.
909.
Xu, Susan H.
1991.
Minimizing expected makespans of multi-priority classes of jobs on uniform processors.
Operations Research Letters,
Vol. 10,
Issue. 5,
p.
273.
Righter, Rhonda
and
XU, Susan
1991.
Scheduling jobs on heterogeneous processors.
Annals of Operations Research,
Vol. 29,
Issue. 1,
p.
587.
Xu, Susan H.
1991.
Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines.
Probability in the Engineering and Informational Sciences,
Vol. 5,
Issue. 3,
p.
333.
Xu, Susan H.
1992.
On a job resequencing issue in parallel processor stochastic scheduling.
Advances in Applied Probability,
Vol. 24,
Issue. 04,
p.
915.
Lawler, Eugene L.
Lenstra, Jan Karel
Rinnooy Kan, Alexander H.G.
and
Shmoys, David B.
1993.
Logistics of Production and Inventory.
Vol. 4,
Issue. ,
p.
445.
Weber, R.
1993.
On a conjecture about assigning jobs to processors of differing speeds.
IEEE Transactions on Automatic Control,
Vol. 38,
Issue. 1,
p.
166.
Pandelis, Dimitrios G.
and
Teneketzis, Demosthenis
1994.
Optimal Multiserver Stochastic Scheduling of two Interconnected Priority Queues.
Advances in Applied Probability,
Vol. 26,
Issue. 1,
p.
258.
Borst, Sem
Bruno, John
Coffman, E. G.
and
Phillips, Steven
1997.
Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines.
Probability in the Engineering and Informational Sciences,
Vol. 11,
Issue. 1,
p.
95.
Niño-Mora, José
2001.
Encyclopedia of Optimization.
p.
2541.
Albers, Susanne
and
Schröder, Bianca
2001.
Algorithm Engineering.
Vol. 1982,
Issue. ,
p.
11.
Albers, Susanne
and
Schröder, Bianca
2002.
An experimental study of online scheduling algorithms.
ACM Journal of Experimental Algorithmics,
Vol. 7,
Issue. ,
p.
3.
Linli He
and
Ioerger, T.R.
2005.
Incentive compatible mechanism design for synthetic task allocation in virtual organizations.
p.
205.
Argon, Nilay Tanik
Ziya, Serhan
and
Righter, Rhonda
2008.
SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS.
Probability in the Engineering and Informational Sciences,
Vol. 22,
Issue. 3,
p.
301.
Niño-Mora, José
2008.
Encyclopedia of Optimization.
p.
3818.