Search results for "jobs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
137	Randolph D. Nelson, Donald F. Towsley, Asser N. Tantawi	Performance Analysis of Parallel Processing Systems.	SIGMETRICS	1987	DBLP DOI BibTeX RDF
71	Takayuki Osogami, Adam Wierman, Mor Harchol-Balter, Alan Scheller-Wolf	A recursive analysis technique for multi-dimensionally infinite Markov chains.	SIGMETRICS Perform. Evaluation Rev.	2004	DBLP DOI BibTeX RDF
68	Marjan van den Akker 0001, Han Hoogeveen	Minimizing the number of late jobs in a stochastic setting using a chance constraint.	J. Sched.	2008	DBLP DOI BibTeX RDF	Number of late jobs, Stochastic processing times, Minimum success probability, Chance constraint, Scheduling, Dynamic programming, NP-hardness, Sequencing, Single machine
68	Adam K. L. Wong, Andrzej M. Goscinski	The Impact of Under-Estimated Length of Jobs on EASY-Backfill Scheduling.	PDP	2008	DBLP DOI BibTeX RDF	Under-Estimation, EASY-Backfill Scheduling, Parallel Jobs, Computer Clusters
66	Ioannis Caragiannis	Efficient coordination mechanisms for unrelated machine scheduling.	SODA	2009	DBLP DOI BibTeX RDF
61	Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Graham R. Nudd	Dynamic Scheduling of Parallel Real-Time Jobs by Modelling Spare Capabilities in Heterogeneous Clusters.	CLUSTER	2003	DBLP DOI BibTeX RDF
60	Victoria Ungureanu, Benjamin Melamed, Phillip G. Bradford, Michael N. Katehakis	Class-Dependent Assignment in cluster-based servers.	SAC	2004	DBLP DOI BibTeX RDF	assignment policy, cluster-based server, simulation, power-law distribution
58	Leszek Borzemski	Load balancing in parallel and distributed processing of tree-based multiple-task jobs.	PDP	1995	DBLP DOI BibTeX RDF	batch processing (computers), tree-based multiple-task jobs, tree based multiple task jobs, incoming workload, problem-specific static algorithms, prescheduling load balancing algorithms, dynamic load balancing algorithms, parallel processing, parallel processing, resource allocation, distributed processing, trees (mathematics), task allocation, batch processing
58	Wei-Kuan Shih, Jane W.-S. Liu, C. L. Liu 0001	Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	modified rate-monotonic algorithm, periodic jobs, deferred deadlines, semi-static priority-driven algorithm, time instant, old requests, current request, independent jobs, request deadline, deterministic scheduling theory, scheduling, real-time systems, real-time systems, computational complexity, embedded systems, operating system, scheduling algorithms, job scheduling, operating systems (computers), multiprogramming, feasibly scheduled
57	Berit Johannes	Scheduling parallel jobs to minimize the makespan.	J. Sched.	2006	DBLP DOI BibTeX RDF	parallel jobs, approximation algorithms, online algorithms, multiprocessor scheduling, list scheduling, release dates
56	Marek Chrobak, Mathilde Hurand, Jirí Sgall	Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines.	RTSS	2007	DBLP DOI BibTeX RDF
56	Jian-Jia Chen, Jun Wu 0010, Chi-Sheng Shih 0001	Approximation algorithms for scheduling real-time jobs with multiple feasible intervals.	Real Time Syst.	2006	DBLP DOI BibTeX RDF
56	Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Hong Jiang, Donna N. Dillenberger, Graham R. Nudd	Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters.	IEEE Trans. Parallel Distributed Syst.	2006	DBLP DOI BibTeX RDF	Scheduling, distributed systems, real-time systems, parallel systems, numerical algorithms
56	Jan Hungershöfer	On the Combined Scheduling of Malleable and Rigid Jobs.	SBAC-PAD	2004	DBLP DOI BibTeX RDF
55	Xiaodong Zhang 0001, Yanxia Qu, Li Xiao 0001	Improving Distributed Workload Performance by Sharing both CPU and Memory Resources.	ICDCS	2000	DBLP DOI BibTeX RDF
50	Hojung Cha, Rhan Ha, Jane W.-S. Liu	Experimental Analysis of Timing Validation Methods for Distributed Real-Time Systems.	J. Supercomput.	2003	DBLP DOI BibTeX RDF	nonmigratable jobs, performance evaluation, validation, schedulability analysis, distributed real-time system
50	Li Xiao 0001, Songqing Chen, Xiaodong Zhang 0001	Adaptive Memory Allocations in Clusters to Handle Unexpectedly Large Data-Intensive Jobs.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF
50	Anna Bodi, C. Lees	Information technology and transaction processing jobs: a cognitive approach.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF
49	Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante	Analysis of Task Assignment with Cycle Stealing under Central Queue.	ICDCS	2003	DBLP DOI BibTeX RDF
49	Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein	Techniques for Scheduling with Rejection.	ESA	1998	DBLP DOI BibTeX RDF
49	Joseph Y.-T. Leung, Burkhard Monien	On the Complexity of Deadlock Recovery.	STACS	1985	DBLP DOI BibTeX RDF
46	Ningfang Mi, Alma Riska, Qi Zhang 0012, Evgenia Smirni, Erik Riedel	Efficient management of idleness in storage systems.	ACM Trans. Storage	2009	DBLP DOI BibTeX RDF	background jobs, continuous data histogram, foreground jobs, low priority work, performance guarrante, Resource management, storage systems, idleness, idle periods
46	Sudheer Dharanikota, Kurt Maly	QUANTA: Quality of Service Architecture for Native TCP/IP over ATM Networks.	HPDC	1996	DBLP DOI BibTeX RDF	QUANTA, native TCP/IP, end system protocol suite, application level QoS, base line performance, no-load condition, user submitted data block sizes, host load condition experiments, CPU intensive jobs, communication intensive jobs, network load condition experiments, missing components, network QoS translator protocol tuning components, local feedback component, class based scheduling, performance evaluation, asynchronous transfer mode, computer networks, transport protocols, ATM networks, quality control, QoS guarantees, round trip time, quality of service architecture, QoS architecture
46	Anurag Kumar 0001, Rajeev Shorey	Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	stochastic fork-join jobs, probabilistic allocation of tasks, associated random variables, diffusion limits, simulations, scheduling, scheduling, performance evaluation, performance analysis, parallel processing, lower bounds, delays, queueing theory, digital simulation, upper bounds, stochastic processes, multicomputer system, parallel processing system, queueing delays, exact analysis
45	Jennifer Ann Rode, Andrea Marshall, Anne Weibert, Konstantin Aal, Thomas von Rekowski, Houda el Mimouni, Akshay Sharma, Jordan Jobs, Alexis Schleeter, Jennifer Booker	From computational thinking to computational making.	UbiComp/ISWC Adjunct	2015	DBLP DOI BibTeX RDF
45	Magnus Jobs	Wireless Interface Technologies for Sensor Networks.		2015	RDF
45	Jouni Rantakokko, Joakim Rydell, Peter Strömbäck, Peter Händel, Jonas Callmer, David Törnqvist, Fredrik Gustafsson, Magnus Jobs, Mathias Grudén	Accurate and reliable soldier and first responder indoor positioning: multisensor systems and cooperative localization.	IEEE Wirel. Commun.	2011	DBLP DOI BibTeX RDF
45	Hongyang Sun 0001, Yangjie Cao, Wen-Jing Hsu	Competitive Two-Level Adaptive Scheduling Using Resource Augmentation.	JSSPP	2009	DBLP DOI BibTeX RDF	Malleable jobs, Non-clairvoyant algorithm, Resource augmentation analysis, Two-level adaptive scheduling, Simulations, Online scheduling, Mean response time
45	Thomas R. Shaw, Suzanne D. Pawlowski, James B. Davis	Building theory about IT professionals: is a taxonomy or typology the answer?	CPR	2005	DBLP DOI BibTeX RDF	IT jobs, ideal types, job classification, taxonomy, IT professionals, typology
45	M. G. Sriram, Mukesh Singhal	Measures of the Potential for Load Sharing in Distributed Computing Systems.	IEEE Trans. Software Eng.	1995	DBLP DOI BibTeX RDF	sharable jobs, job sharing coefficient, distributed systems, Load Sharing
45	Weiwei Wu 0001, Minming Li, Enhong Chen	Min-Energy Scheduling for Aligned Jobs in Accelerate Model.	ISAAC	2009	DBLP DOI BibTeX RDF
45	Jianfeng Ren, Yuzhong Zhang, Xianzhao Zhang, Guo Sun	Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine.	COCOA	2009	DBLP DOI BibTeX RDF	Unbounded batch machine, Approximation algorithms, Dynamic programming
45	Nayden Markatchev, Cameron Kiddle, Rob Simmonds	A Framework for Executing Long Running Jobs in Grid Environments.	HPCS	2008	DBLP DOI BibTeX RDF	Execution Framework, Grid Computing, Adaptive Scheduling
45	Dimitrios Filippopoulos, Helen D. Karatza	A two-class parallel queue with pure space sharing among rigid jobs and general service times.	VALUETOOLS	2006	DBLP DOI BibTeX RDF	supplementary variable, stability, parallel system, monotonicity, discriminant, partial derivative, real roots
45	H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove	Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs.	J. Sched.	2005	DBLP DOI BibTeX RDF	set-up time, scheduling, branch and bound, families, batches, single machine
45	Ekow J. Otoo, Doron Rotem, Arie Shoshani	Impact of Admission and Cache Replacement Policies on Response Times of Jobs on Data Grids.	Clust. Comput.	2005	DBLP DOI BibTeX RDF	caching, data grid, job scheduling, storage resource manager
45	Jian-Jia Chen, Jun Wu 0010, Chi-Sheng Shih 0001, Tei-Wei Kuo	Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs.	RTCSA	2005	DBLP DOI BibTeX RDF
45	Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift	Windows scheduling of arbitrary length jobs on parallel machines.	SPAA	2005	DBLP DOI BibTeX RDF	window scheduling, approximation algorithms, parallel machines, periodic scheduling, experimental algorithms
45	Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Xinuo Chen, Graham R. Nudd	Dynamic Scheduling of Parallel Jobs with QoS Demands in Multiclusters and Grids.	GRID	2004	DBLP DOI BibTeX RDF
45	A. Baranovski, Gabriele Garzoglio, Igor Terekhov, Alain Roy, Todd Tannenbaum	Management of grid jobs and data within SAMGrid.	CLUSTER	2004	DBLP DOI BibTeX RDF
45	Ekow J. Otoo, Doron Rotem, Arie Shoshani	mpact of Admission and Cache Replacement Policies on Response Times of Jobs on Data Grids.	CLADE	2003	DBLP DOI BibTeX RDF
45	Hai Jin 0001, Ligang He, Zongfen Han	Optimal Dispatching and Scheduling for Both Periodic and Aperiodic Jobs in Cluster.	ICPP Workshops	2002	DBLP DOI BibTeX RDF
45	Ligang He, Hai Jin 0001, Ying Chen, Zongfen Han	Optimal Scheduling of Aperiodic Jobs on Cluster.	Euro-Par	2001	DBLP DOI BibTeX RDF
44	Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs	Speed scaling of processes with arbitrary speedup curves on a multiprocessor.	SPAA	2009	DBLP DOI BibTeX RDF	scheduling, speed scaling
44	Tim Roughgarden	Stackelberg scheduling strategies.	STOC	2001	DBLP DOI BibTeX RDF
44	Jae-Ha Lee, Kyung-Yong Chwa	Online Scheduling of Parallel Communications with Individual Deadlines.	ISAAC	1999	DBLP DOI BibTeX RDF
40	Fehmi Tanrisever, Erhan Kutanoglu	Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Job formation, Multi-order jobs, Scheduling, Dynamic programming, Batching
40	Tomasz Szepieniec, Marian Bubak	Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids.	ICCS (1)	2008	DBLP DOI BibTeX RDF	eligible jobs maximization, DAG, list scheduling, Internet-based computing, application scheduling
40	Qi Zhang 0012, Ningfang Mi, Evgenia Smirni, Alma Riska, Erik Riedel	Evaluating the Performability of Systems with Background Jobs.	DSN	2006	DBLP DOI BibTeX RDF	Foreground/background jobs, QBD, storage systems, Markov Modulated Poisson Process, idle periods
40	Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu 0023, Jianjin Jiang	BSM: A scheduling algorithm for dynamic jobs based on economics theory.	GCC	2006	DBLP DOI BibTeX RDF	Black and Scholes Option Pricing Model, Market Simulation, Dynamic Jobs, Scheduling Algorithm
40	Shao Chin Sung, Milan Vlach	Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines.	J. Sched.	2005	DBLP DOI BibTeX RDF	just-in-time jobs, unrelated parallel machines, NP-hardness, polynomial time algorithm
40	Stanislaw Gawiejnowicz, Wieslaw Kurc, Lidia Pankowska	Parallel Machine Scheduling of Deteriorating Jobs by Modified Steepest Descent Search.	PPAM	2005	DBLP DOI BibTeX RDF	deteriorating jobs, total machine load, steepest descent search, heuristic algorithms, parallel machine scheduling, total completion time
40	Stéphane Dauzère-Pérès, Marc Sevaux	An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling.	J. Sched.	2004	DBLP DOI BibTeX RDF	one-machine scheduling, late jobs, branch and bound
39	Florian Diedrich, Klaus Jansen	Improved approximation algorithms for scheduling with fixed jobs.	SODA	2009	DBLP DOI BibTeX RDF
39	Feng Zhang 0015, Sarah Tasneem, Lester Lipsky, Steve Thompson	Analysis of round-robin variants: favoring newly arrived jobs.	SpringSim	2009	DBLP DOI BibTeX RDF	foreground-background (FB), last-come-first-served with preemptive resume (LCFSPR), processor sharing (PS), round-robin (RR), shortest remaining processing time (SRPT)
39	Tanvire Elahi, Cameron Kiddle, Rob Simmonds	Models for Grid Applications and Jobs.	HPCS	2008	DBLP DOI BibTeX RDF	Grid Computing, Automation, Application Modelling
39	Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde	A Tool for Prioritizing DAGMan Jobs and its Evaluation.	J. Grid Comput.	2007	DBLP DOI BibTeX RDF	dags, applications of theory, scheduling, Grid, systems, Condor, unpredictability
39	Alexandru Iosup, Mathieu Jan, Omer Ozan Sonmez, Dick H. J. Epema	The Characteristics and Performance of Groups of Jobs in Grids.	Euro-Par	2007	DBLP DOI BibTeX RDF
39	Yvonne Bleischwitz, Burkhard Monien	Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines.	CIAC	2006	DBLP DOI BibTeX RDF
39	Bu-Sung Lee, Ming Tang, Junwei Zhang, Yew-Soon Ong, Cindy Zheng, Peter W. Arzberger, David Abramson 0001	Analysis of Jobs in a Multi-Organizational Grid Test-bed.	CCGRID	2006	DBLP DOI BibTeX RDF
39	Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde	A Tool for Prioritizing DAGMan Jobs and Its Evaluation.	HPDC	2006	DBLP DOI BibTeX RDF	DAGMan job scheduling, job dependency, scheduling tool, scientific data analysis application, Condor high-throughput computing system, Internet-based computation
39	Tao Wang, Daxin Liu 0001	Scheduling AND/OR Precedence Constraints Jobs to Minimize the Makespan by Mapping from CPM to AND/OR Network.	RTCSA	2005	DBLP DOI BibTeX RDF
39	Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor	Machine Minimization for Scheduling Jobs with Interval Constraints.	FOCS	2004	DBLP DOI BibTeX RDF
39	Sébastien Ponce, Roger D. Hersch	Parallelization and Scheduling of Data Intensive Particle Physics Analysis Jobs on Clusters of PCs.	IPDPS	2004	DBLP DOI BibTeX RDF
39	Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Xinuo Chen, Graham R. Nudd	Hybrid Performance-Oriented Scheduling of Moldable Jobs with QoS Demands in Multiclusters and Grids.	GCC	2004	DBLP DOI BibTeX RDF
39	William A. Ward Jr., Carrie L. Mahood, John E. West	Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy.	JSSPP	2002	DBLP DOI BibTeX RDF
39	Rob van Stee, Johannes A. La Poutré	Partial servicing of on-line jobs.	APPROX	2000	DBLP DOI BibTeX RDF
38	Ming Liu 0008, Yinfeng Xu, Chengbin Chu, Lu Wang	Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine.	COCOA	2009	DBLP DOI BibTeX RDF	Makespan, Online scheduling, Batch processing
38	Samir Khuller, Julián Mestre	An Optimal Incremental Algorithm for Minimizing Lateness with Rejection.	ESA	2008	DBLP DOI BibTeX RDF
38	Dan Tsafrir, Yoav Etsion, Dror G. Feitelson	Backfilling Using System-Generated Predictions Rather than User Runtime Estimates.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	runtime estimates, system-generated predictions, history-based predictions, dynamic prediction correction, EASY, EASY++, SJBF, performance metrics, Parallel job scheduling, backfilling
38	H. James Nelson, Altaf Ahmad, Nancy L. Martin, Charles R. Litecky	A comparative study of IT/IS job skills and job definitions.	CPR	2007	DBLP DOI BibTeX RDF	IT/IS job definitions, latent semantic analysis
38	Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson	Provably Efficient Online Non-clairvoyant Adaptive Scheduling.	IPDPS	2007	DBLP DOI BibTeX RDF
38	Chad R. Meiners, Eric Torng	Mixed Criteria Packet Scheduling.	AAIM	2007	DBLP DOI BibTeX RDF
38	Lars-Olof Burchard, Barry Linnert, Jörg Schneider 0001	A distributed load-based failure recovery mechanism for advance reservation environments.	CCGRID	2005	DBLP DOI BibTeX RDF
38	Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Marie-Claude Portmann	Maximization Problems in Single Machine Scheduling.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	semi-active schedules, maximization problem, scheduling, precedence constraints, release times
38	Ligang He, Stephen A. Jarvis, David A. Bacigalupo, Daniel P. Spooner, Graham R. Nudd	Performance-Aware Load Balancing for Multiclusters.	ISPA	2004	DBLP DOI BibTeX RDF
38	Idris A. Rai, Guillaume Urvoy-Keller, Ernst W. Biersack	Analysis of LAS scheduling for job size distributions with high variance.	SIGMETRICS	2003	DBLP DOI BibTeX RDF	high variability property, least attained service, web objects response time, size-based scheduling
38	Songqing Chen, Li Xiao 0001, Xiaodong Zhang 0001	Adaptive and Virtual Reconfigurations for Effective Dynamic Job Scheduling in Cluster Systems.	ICDCS	2002	DBLP DOI BibTeX RDF
38	Gísli Hjálmtýsson, Ward Whitt	Periodic load balancing.	Queueing Syst. Theory Appl.	1998	DBLP DOI BibTeX RDF	periodic load balancing, heavy traffic diffusion approximations, reflected Brownian motion, load balancing, resource sharing, transient behavior
35	Baruch Awerbuch, Michael E. Saks	A Dining Philosophers Algorithm with Polynomial Response Time	FOCS	1990	DBLP DOI BibTeX RDF	dynamic job creation, job arrival density, conflicting jobs, asynchronous model, concurrent jobs, maximum execution time, dining philosophers algorithm, polynomial response time, distributed online algorithm, message transmission time, resource allocation, upper bound, job scheduling, resource constraints, resource requirements, arbitrary networks, distribution queue
35	Ashok K. Agrawala, Edward G. Coffman Jr., M. R. Garey, Satish K. Tripathi	A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.	IEEE Trans. Computers	1984	DBLP DOI BibTeX RDF	uniform processor systems, Consider a set of processors P1, ..., Pm differing only in speed and a set of jobs with exponentially distributed execution times, The rate parameter for the ith processor is given by ?i, 1 =i = m, where we assume the processors are ordered so that ?1 = ?2 = ... = ?m. The problem is to sequence the jobs nonpreemptively so as to minimize expected total flow time (sum of finishing times). We defin, Mean flow time minimization, stochastic optimization, stochastic scheduling, routing problems
35		Jobs, Jobs, Jobs ...	Wirtschaftsinformatik Manag.	2012	DBLP DOI BibTeX RDF
35	Hongyang Sun 0001, Yangjie Cao, Wen-Jing Hsu	Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors.	Conf. Computing Frontiers	2009	DBLP DOI BibTeX RDF	batched parallel jobs, non-clairvoyant, power budget, simulations, scheduling, multiprocessors, energy consumption, flow time, speed scaling
35	Zhongjun Tian, C. T. Ng 0001, T. C. Edwin Cheng	An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness.	J. Sched.	2006	DBLP DOI BibTeX RDF	Equal-length jobs, Total tardiness, Preemptive scheduling, Single machine, Release date
35	Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai	Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs.	Algorithmica	2003	DBLP DOI BibTeX RDF	Sum Coloring, Scheduling dependent jobs, Approximation algorithms, Multicoloring
35	Alexander Tuzikov, Mikhail Makhaniok, Reinhard Männer	Bicriterion scheduling of identical processing time jobs by uniform processors.	IPPS	1995	DBLP DOI BibTeX RDF	bicriterion scheduling, identical processing time jobs, uniform processors, multicriterion job scheduling, parallel algorithms, computational complexity, polynomial time algorithms, processor scheduling, operations research
34	Leila Takayama, Wendy Ju, Clifford Nass	Beyond dirty, dangerous and dull: what everyday people think robots should do.	HRI	2008	DBLP DOI BibTeX RDF	human-robot interaction, survey, occupations, jobs
34	Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.	Algorithmica	2009	DBLP DOI BibTeX RDF	Geometric partitioning, Approximation algorithms, Batch scheduling
34	Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai	Improved bounds for scheduling conflicting jobs with minsum criteria.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	sum multicoloring, scheduling, Approximation algorithms, linear programming, coloring, LP rounding
34	Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng	Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.	WAOA	2008	DBLP DOI BibTeX RDF
34	Bo Li 0025, Jun Chen, Man Yang, Erfei Wang	Impact of Extending the Runtime of Underestimated Jobs in Backfilling Schedulers.	CSSE (3)	2008	DBLP DOI BibTeX RDF
34	Bo Li 0025, Dongfeng Zhao	Online Algorithms for Single Machine Schedulers to Support Advance Reservations from Grid Jobs.	HPCC	2007	DBLP DOI BibTeX RDF
34	Orlando Moreira, Frederico Valente, Marco Bekooij	Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor.	EMSOFT	2007	DBLP DOI BibTeX RDF	scheduling, real-time, dataflow, multi-processor
34	Chang-Woo Yang, Adam Wierman, Sanjay Shakkottai, Mor Harchol-Balter	Tail asymptotics for policies favoring short jobs in a many-flows regime.	SIGMETRICS/Performance	2006	DBLP DOI BibTeX RDF	many-sources, rate function, scheduling, large-deviations, SMART, SRPT, LAS
34	Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
34	L. G. Alex Sung, Johnny W. Wong	Autonomic Resource Management for a Cluster that Executes Batch Jobs.	CLUSTER	2006	DBLP DOI BibTeX RDF
34	Jinjiang Yuan, Weiping Shang, Qi Feng	A note on the scheduling with two families of jobs.	J. Sched.	2005	DBLP DOI BibTeX RDF
34	Gladys Utrera, Julita Corbalán, Jesús Labarta	Another approach to backfilled jobs: applying virtual malleability to expired windows.	ICS	2005	DBLP DOI BibTeX RDF
34	Daniel Kouril, Jim Basney	A credential renewal service for long-running jobs.	GRID	2005	DBLP DOI BibTeX RDF
34	Deshi Ye, Guochuan Zhang	On-Line Scheduling of Parallel Jobs.	SIROCCO	2004	DBLP DOI BibTeX RDF