Get started
Keyword

critical path

Description: In project management, the critical path is the longest sequence of dependent activities determining the shortest possible time to complete a project.
Wikidata ID: wiki/Q84446700
OpenAlex ID: keywords/critical-path
Performance-effective and low-complexity task scheduling for heterogeneous computing
2002 · H. Topcuoglu, S. Hariri, et al. · IEEE Transactions on Parallel and Distributed Systems · 3,486
Why change programs don't produce change.
1991 · M Beer, R A Eisenstat, et al. · PubMed · 1,061
Cilk
1995 · Robert D. Blumofe, Christopher F. Joerg, et al. · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 1,021
PDF
A Fast Taboo Search Algorithm for the Job Shop Problem
1996 · Eugeniusz Nowicki, Czeslaw Smutnicki · Management Science · 978
Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors
1996 · Yu-Kwong Kwok, I. Ahmad · IEEE Transactions on Parallel and Distributed Systems · 812
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
1984 · Kasahara, Narita · IEEE Transactions on Computers · 458
Model-based Drug Development
2007 · R L Lalonde, K G Kowalski, et al. · Clinical Pharmacology & Therapeutics · 452
Scheduling parallel program tasks onto arbitrary target machines
1990 · Hesham El-Rewini, T.G. Lewis · Journal of Parallel and Distributed Computing · 419
The Critical Path to Corporate Renewal
1990 · Michael Beer, Russell A. Eisenstat, et al. · Medical Entomology and Zoology · 401
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
2009 · Malte Helmert, Carmel Domshlak · Proceedings of the International Conference on Automated Planning and Scheduling · 400
PDF
A reinforcement learning approach to job-shop scheduling
1995 · Wei Zhang, Thomas G. Dietterich · 384
Thread scheduling for multiprogrammed multiprocessors
1998 · Nimar S. Arora, Robert D. Blumofe, et al. · ACM Symposium on Parallel Algorithms and Architectures (SPAA) · 358
DRUM: A Dynamic Range Unbiased Multiplier for approximate applications
2015 · Soheil Hashemi, R. Iris Bahar, et al. · 348
Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
1989 · S. Thomas McCormick, Michael L. Pinedo, et al. · Operations Research · 311
Design and optimization of dual-threshold circuits for low-voltage low-power applications
1999 · L. Wei, Z. Chen, et al. · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 305
Cilk
1995 · Robert D. Blumofe, Christopher F. Joerg, et al. · ACM SIGPLAN Notices · 297
A time-dependent methodology for fault tree evaluation
1970 · W.E. Vesely · Nuclear Engineering and Design · 285
Automated low-power technique exploiting multiple supply voltages applied to a media processor
1998 · K. Usami, M. Igarashi, et al. · IEEE Journal of Solid-State Circuits · 277
Letter to the Editor—Monte Carlo Methods and the PERT Problem
1963 · Richard M. Van Slyke · Operations Research · 268
Analysis and architecture design of variable block-size motion estimation for H.264/AVC
2006 · Ching-Yeh Chen, Shao-Yi Chien, et al. · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · 245
An Introduction to Critical Paths
2005 · Richard J. Coffey, Janet S. Richards, et al. · Quality Management in Health Care · 245
Project Management: Achieving Competitive Advantage
2003 · Jeffrey K. Pinto · 242
Thread Scheduling for Multiprogrammed Multiprocessors
2001 · N. S. Arora, R. D. Blumofe, et al. · Theory of Computing Systems · 231
Symmetric crossbar arbiters for VLSI communication switches
1993 · Y. Tamir, H.-C. Chi · IEEE Transactions on Parallel and Distributed Systems · 230
Improving target assessment in biomedical research: the GOT-IT recommendations
2020 · Christoph H. Emmerich, Lorena Martinez Gamboa, et al. · Nature Reviews Drug Discovery · 228
PDF
Works count: 7,259
Citation count: 50,490
Year
Topic
Type