|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 725 occurrences of 302 keywords
|
|
|
Results
Found 1520 publication records. Showing 1520 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
78 | Feng Jin, Jatinder N. D. Gupta, Shiji Song, Cheng Wu |
Makespan distribution of permutation flowshop schedules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 11(6), pp. 421-432, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Permutation flowshop scheduling problem (PFSP), Makespan distribution, Job-dominated and machine-dominated PFSPs |
69 | Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky |
Envy-free makespan approximation: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pp. 159-166, 2010, ACM, 978-1-60558-822-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
envy free, job scheduling, makespan |
64 | Sanjeev Baskiyar, Kiran Kumar Palli |
Low Power Scheduling of DAGs to Minimize Finish Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2006, 13th International Conference, Bangalore, India, December 18-21, 2006, Proceedings, pp. 353-362, 2006, Springer, 3-540-68039-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Scheduling, Power, Heterogeneous, DAG, Makespan, Voltage Scaling |
60 | Matthias Englert, Deniz Özmen, Matthias Westermann |
The Power of Reordering for Online Minimum Makespan Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 603-612, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
60 | Liying Kang, T. C. Edwin Cheng, C. T. Ng 0001, Min Zhao |
Scheduling to Minimize Makespan with Time-Dependent Processing Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 925-933, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
fully polynomial approximation scheme, makespan, parallel machines scheduling |
55 | Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson |
Adversarial Analyses of Window Backoff Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS Next Generation Software Program - NSFNGS - PI Workshop ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Eric Angel, Evripidis Bampis, Alexander V. Kononov |
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 194-205, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
54 | Joseph Y.-T. Leung, Hairong Zhao |
Scheduling problems in master-slave model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 215-231, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Master slave model, Approximation algorithms, NP-hard, Makespan, Total completion time |
51 | Jack J. Dongarra, Emmanuel Jeannot, Erik Saule, Zhiao Shi |
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 280-288, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
pareto-curve, scheduling, reliability, DAG |
51 | Xiaoping Li 0001, Qian Wang 0011, Cheng Wu |
An Efficient Method for No-Wait Flow Shop Scheduling to Minimize Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 10th International Conference on CSCW in Design, CSCWD 2006, May 3-5, 2006, Southeast University, Nanjing, China, pp. 1296-1301, 2006, IEEE, 1-4244-0165-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Konstantinos Kalpakis, Yaacov Yesha |
Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(2), pp. 159-179, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Tree dags, Mesh array, Scheduling, Parallel computation, Parallel architectures, Communication delay, Multiprocessing, Tree decomposition, Linear array |
50 | Xin Jiang, Chuang Lin 0002, Hao Yin, Yada Hu |
A Scheduling Model for Maximizing Availability with Makespan Constraint Based on Residual Lifetime in Heterogeneous Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NPC ![In: Network and Parallel Computing, IFIP International Conference, NPC 2007, Dalian, China, September 18-21, 2007, Proceedings, pp. 31-40, 2007, Springer, 978-3-540-74783-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Residual lifetime, Cluster, Availability, Makespan, Scheduling strategy |
50 | Yumei Li 0001, Yundong Gu, Kaibiao Sun, Hongxing Li |
A Note on the Optimal Makespan of a Parallel Machine Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFIE ![In: Fuzzy Information and Engineering, Proceedings of the Second International Conference of Fuzzy Information and Engineering, ICFIE 2007, May 13-16, 2007, Guangzhou, China, pp. 481-493, 2007, Springer, 978-3-540-71440-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
result schedule, optimal makespan, algorithm, parallel machine, Scheduling problem |
50 | Joseph Y.-T. Leung, Hairong Zhao |
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(8), pp. 985-999, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Sequence and scheduling, approximation algorithms, linear programming, makespan |
46 | Michael A. Bender, Cynthia A. Phillips |
Scheduling DAGs on asynchronous processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 35-45, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
asynchronous parallel computing, firing-squad scheduling, precedence-constrained scheduling, online scheduling |
46 | Eric Angel, Evripidis Bampis, Fanny Pascual |
The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings, pp. 157-166, 2006, Springer, 3-540-37783-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
46 | Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson |
Adversarial contention resolution for simple channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 325-332, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
exponential backoff, polynomial backoff, worst-case backoff performance, on-line, batch |
45 | Xiaoqiang Cai, Xianyi Wu, Xian Zhou 0002 |
Stochastic scheduling on parallel machines to minimize discounted holding costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(4), pp. 375-388, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Discounted holding cost, Discounted rewords, Flowtime, Dynamic policy, Static list policy, SEPT rule, LEPT rule, Parallel machines, Makespan, Stochastic scheduling |
42 | Emmanuel Jeannot, Erik Saule, Denis Trystram |
Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2008 - Parallel Processing, 14th International Euro-Par Conference, Las Palmas de Gran Canaria, Spain, August 26-29, 2008, Proceedings, pp. 877-886, 2008, Springer, 978-3-540-85450-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Berit Johannes |
Scheduling parallel jobs to minimize the makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 9(5), pp. 433-452, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
parallel jobs, approximation algorithms, online algorithms, multiprocessor scheduling, list scheduling, release dates |
41 | David P. Bunde |
Power-aware scheduling for makespan and flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(5), pp. 489-500, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Total flow, Dynamic voltage scaling, Makespan, Power-aware scheduling, Speed scaling |
41 | Imed Kacem |
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(2), pp. 117-133, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Non-availability constraint, Scheduling, Approximation, Makespan |
41 | Bin Fu, Yumei Huo, Hairong Zhao |
Makespan Minimization with Machine Availability Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 430-437, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
machine availability constraints, makespan, PTAS, inapproximation |
41 | Xiaoping Li 0001, Cheng Wu |
Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 51(7), pp. 896-909, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
no-wait flow shops, heuristic, Tabu search, makespan |
41 | Yuzhong Zhang, Zhigang Cao 0002 |
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(2), pp. 119-126, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Non-identical job sizes, Asymptotic PTAS, Scheduling, Makespan, Batching |
41 | Jinjiang Yuan, Zhaohui Liu 0001, C. T. Ng 0001, T. C. Edwin Cheng |
Single machine batch scheduling problem with family setup times and release dates to minimize makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 9(6), pp. 499-513, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Scheduling, Makespan, Family, Batching, Release dates |
41 | Débora P. Ronconi |
A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 138(1), pp. 53-65, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
lower bound, branch-and-bound, blocking, makespan, flowshop |
41 | Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger |
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 309-334, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Uniform machines, Preemption costs, Minimum makespan, Scheduling, Approximation algorithms, Parallel processing |
41 | Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich |
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 129(1-4), pp. 171-185, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithm, makespan, polynomial time approximation scheme, flow shop |
41 | Wenci Yu, Han Hoogeveen, Jan Karel Lenstra |
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 7(5), pp. 333-348, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
intermediate delays, strong NP-hardness, computational complexity, makespan, flow shop scheduling |
37 | Nagavijayalakshmi Vydyanathan, Sriram Krishnamoorthy, Gerald M. Sabin, Ümit V. Çatalyürek, Tahsin M. Kurç, P. Sadayappan, Joel H. Saltz |
An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 20(8), pp. 1158-1172, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Evgeny V. Shchepin, Nodari Vakhania |
On the geometry, preemptions and complexity of multiprocessor and shop scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 183-213, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Shop scheduling, Algorithm, Time complexity, Multiprocessor scheduling, Preemption |
37 | Tianping Shuai, Donglei Du |
A Lower Bound for the On-Line Preemptive Machine Scheduling with lp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 661-669, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | James Aspnes, Yang Richard Yang, Yitong Yin |
Path-independent load balancing with unreliable machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 814-823, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
37 | Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz |
Coordination Mechanisms for Selfish Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings, pp. 55-69, 2005, Springer, 3-540-30900-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Noriyuki Fujimoto, Kenichi Hagihara |
A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAINT Workshops ![In: 2004 Symposium on Applications and the Internet Workshops (SAINT 2004 Workshops), 26-30 January 2004, Tokyo, Japan, pp. 674-680, 2004, IEEE Computer Society, 0-7695-2050-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Emmanuel Hebrard |
Extending Super-solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, CP 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings, pp. 798, 2004, Springer, 3-540-23241-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Noriyuki Fujimoto, Kenichi Hagihara |
Near-Optimal Dynamic Task Scheduling of Precedence Constrained Coarse-Grained Tasks onto a Computational Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC ![In: 2nd International Symposium on Parallel and Distributed Computing (ISPDC 2003), 13-14 October 2003, Ljubljana, Slovenia, pp. 80-87, 2003, IEEE Computer Society, 0-7695-2069-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Noriyuki Fujimoto, Kenichi Hagihara |
Near-Optimal Dynamic Task Scheduling of Independent Coarse-Grained Tasks onto a Computational Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 32nd International Conference on Parallel Processing (ICPP 2003), 6-9 October 2003, Kaohsiung, Taiwan, pp. 391-398, 2003, IEEE Computer Society, 0-7695-2017-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Tsai-Duan Lin, Chiun-Chieh Hsu, Da-Ren Chen, Sheng-Yung Chiu |
A New Ant Colony Optimization Algorithm with an Escape Mechanism for Scheduling Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCI ![In: Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems, First International Conference, ICCCI 2009, Wroclaw, Poland, October 5-7, 2009. Proceedings, pp. 152-162, 2009, Springer, 978-3-642-04440-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
escape mechanism, scheduling, optimization, makespan, Ant colony, combinatorial |
36 | Wenzhong Guo, Guolong Chen, Huang Min, Shuili Chen |
A Discrete Particle Swarm Optimization Algorithm for the Multiobjective Permutation Flowshop Sequencing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFIE ![In: Fuzzy Information and Engineering, Proceedings of the Second International Conference of Fuzzy Information and Engineering, ICFIE 2007, May 13-16, 2007, Guangzhou, China, pp. 323-331, 2007, Springer, 978-3-540-71440-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multiobjective Permutation Flow Shop Sequencing, Discrete Particle Swarm, Total Tardiness, Total Flowtime, Makespan |
36 | George Steiner, Zhihui Xue |
Scheduling in Reentrant Robotic Cells: Algorithms and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(1), pp. 25-48, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
reentrant robotic cell, complexity, polynomial-time algorithm, makespan, cycle time |
36 | Prashanth C. SaiRanga, Sanjeev Baskiyar |
A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference (1) ![In: Proceedings of the 43nd Annual Southeast Regional Conference, 2005, Kennesaw, Georgia, USA, March 18-20, 2005, Volume 1, pp. 63-68, 2005, ACM, 1-59593-059-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
scheduling, heterogeneous computing, makespan, independent tasks |
36 | Susana C. Esquivel, Claudia Gatica, Raúl Héctor Gallard |
Evolutionary Approaches with Multirecombination for the Parallel Machine Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCCC ![In: 20st International Conference of the Chilean Computer Science Society (SCCC 2000), 16-18 November 2000, Santiago, Chile, pp. 1-6, 2000, IEEE Computer Society, 0-7695-0810-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
multirecombination, parallel machine scheduling problem, multiple task assignment, makespan minimization, job precedence constraints, scheduling, evolutionary algorithms, resource allocation, evolutionary computation, experiments, parallel machines, minimisation, resource availability, parallel task scheduling, job allocation |
36 | Christophe Coroyer, Zhen Liu |
Effectiveness of Heuristics and Simulated Annealing for the Scheduling of Concurrent Tasks - An Empirical Comparison. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE ![In: PARLE '93, Parallel Architectures and Languages Europe, 5th International PARLE Conference, Munich, Germany, June 14-17, 1993, Proceedings, pp. 452-463, 1993, Springer, 3-540-56891-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Scheduling, parallel processing, heuristics, simulated annealing, makespan, precedence constraints, empirical comparison |
33 | Zhili Cheng, Zhihui Du, Yinong Chen, Xiaoying Wang 0002 |
Virtual Workspace Based Job Execution Methods and Dynamic Makespan Optimized Scheduling Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 28th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2008 Workshops), 17-20 June 2008, Beijing, China, pp. 599-604, 2008, IEEE Computer Society, 978-0-7695-3173-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Tao Wang, Daxin Liu 0001 |
Scheduling AND/OR Precedence Constraints Jobs to Minimize the Makespan by Mapping from CPM to AND/OR Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2005), 17-19 August 2005, Hong Kong, China, pp. 169-172, 2005, IEEE Computer Society, 0-7695-2346-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Jacek Blazewicz, Maciej Machowiak, Jan Weglarz, Mikhail Y. Kovalyov, Denis Trystram |
Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 129(1-4), pp. 65-80, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
scheduling, parallel computing, resource allocation |
33 | Rolf H. Möhring |
Scheduling under Uncertainty: Bounding the Makespan Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Discrete Mathematics ![In: Computational Discrete Mathematics, Advanced Lectures, pp. 79-97, 2001, Springer, 3-540-42775-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Ashish M. Mehta, Jay Smith, Howard Jay Siegel, Anthony A. Maciejewski, Arun Jayaseelan, Bin Ye |
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 42(1), pp. 33-58, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Resource allocation, Robustness, Resource management, Makespan, Dynamic mapping |
32 | Chung Keung Poon, Pixing Zhang |
Minimizing Makespan in Batch Machine Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 39(2), pp. 155-174, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Dynamic job arrival, Scheduling, Makespan, Batch machine |
29 | Luis Diego Briceno, Howard Jay Siegel, Anthony A. Maciejewski, Mohana Oltikar |
Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 62(1), pp. 461-485, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
28 | Christoph Dürr, Kim Thang Nguyen |
Non-clairvoyant Scheduling Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings, pp. 135-146, 2009, Springer, 978-3-642-04644-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Hagit Attiya, Alessia Milani |
Transactional Scheduling for Read-Dominated Workloads. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings, pp. 3-17, 2009, Springer, 978-3-642-10876-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Nadathur Satish, Kaushik Ravindran, Kurt Keutzer |
Scheduling task dependence graphs with variable task execution times onto heterogeneous multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMSOFT ![In: Proceedings of the 8th ACM & IEEE International conference on Embedded software, EMSOFT 2008, Atlanta, GA, USA, October 19-24, 2008, pp. 149-158, 2008, ACM, 978-1-60558-468-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
statistical scheduling, scheduling, simulated annealing, variability, list-scheduling |
28 | Yves Caniou, Eddy Caron, Ghislain Charrier, Andréea Chis, Frédéric Desprez, Eric Maisonnave |
Ocean-Atmosphere Modelization over the Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 2008 International Conference on Parallel Processing, ICPP 2008, September 8-12, 2008, Portland, Oregon, USA, pp. 206-213, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert |
Contention Resolution with Heterogeneous Job Sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 112-123, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Zhiao Shi, Emmanuel Jeannot, Jack J. Dongarra |
Robust task scheduling in non-deterministic heterogeneous computing systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLUSTER ![In: Proceedings of the 2006 IEEE International Conference on Cluster Computing, September 25-28, 2006, Barcelona, Spain, 2006, IEEE Computer Society, 1-4244-0328-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Prasanna Sugavanam, Howard Jay Siegel, Anthony A. Maciejewski, Syed Amjad Ali, Mohammad Al-Otaibi, Mahir Aydin, Kumara Guru, Aaron Horiuchi, Yogish G. Krishnamurthy, Panho Lee, Ashish M. Mehta, Mohana Oltikar, Ron Pichel, Alan J. Pippin, Michael Raskey, Vladimir Shestak, Junxing Zhang |
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), CD-ROM / Abstracts Proceedings, 4-8 April 2005, Denver, CO, USA, 2005, IEEE Computer Society, 0-7695-2312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Jianning Lin, Huizhong Wu |
A Task Duplication Based Scheduling Algorithm on GA in Grid Computing Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC (3) ![In: Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part III, pp. 225-234, 2005, Springer, 3-540-28320-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Vida Kianzad, Shuvra S. Bhattacharyya, Gang Qu 0001 |
CASPER: An Integrated Energy-Driven Approach for Task Graph Scheduling on Distributed Embedded Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 16th IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP 2005), 23-25 July 2005, Samos, Greece, pp. 191-197, 2005, IEEE Computer Society, 0-7695-2407-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Prasanna Sugavanam, Howard Jay Siegel, Anthony A. Maciejewski, Junxing Zhang, Vladimir Shestak, Michael Raskey, Alan J. Pippin, Ron Pichel, Mohana Oltikar, Ashish M. Mehta, Panho Lee, Yogish G. Krishnamurthy, Aaron Horiuchi, Kumara Guru, Mahir Aydin, Mohammad Al-Otaibi, Shoukat Ali |
Robust Processor Allocation for Independent Tasks When Dollar Cost for Processors is a Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLUSTER ![In: 2005 IEEE International Conference on Cluster Computing (CLUSTER 2005), September 26 - 30, 2005, Boston, Massachusetts, USA, pp. 1-10, 2005, IEEE Computer Society, 0-7803-9485-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Gagan Aggarwal, Rajeev Motwani 0001, An Zhu |
The load rebalancing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 258-265, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithms, load balancing |
28 | Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer |
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings, pp. 90-106, 2001, Springer, 3-540-42672-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | T. C. Edwin Cheng, Qing Ding |
Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 36(9/10), pp. 673-692, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall |
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(4), pp. 504-522, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, Online algorithms, Makespan |
27 | Brighten Godfrey, Richard M. Karp |
On the Price of Heterogeneity in Parallel Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(2), pp. 280-301, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Precedence constrained scheduling, Scheduling, Heterogeneity, Parallel systems, Makespan |
27 | M. D. Mahdi Mobini, Masoud Rabbani, M. S. Amalnik, Jafar Razmi, A. R. Rahimi-Vahed |
Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 13(6), pp. 597-610, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Resource constrained, Scatter search algorithm, Makespan, Project scheduling, Path relinking |
27 | Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano |
Minimum Delay Data Gathering in Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHOC-NOW ![In: Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, ADHOC-NOW 2009, Murcia, Spain, September 22-25, 2009, Proceedings, pp. 69-82, 2009, Springer, 978-3-642-04382-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Sensor Networks, grid, makespan, gathering |
27 | Jihuan Ding, Guochuan Zhang |
A Note on Online Scheduling for Jobs with Arbitrary Release Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 354-362, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Identical parallel machines, Makespan, Competitive ratio, On-line scheduling |
27 | Ming Liu 0008, Yinfeng Xu, Chengbin Chu, Lu Wang |
Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 346-353, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Makespan, Online scheduling, Batch processing |
27 | Lotfi Hidri, Anis Gharbi, Mohamed Haouari |
Energetic reasoning revisited: application to parallel machine scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 11(4), pp. 239-252, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Due dates, Feasibility and adjustment procedures, Energetic reasoning, Scheduling, Branch-and-bound, Makespan, Release dates |
27 | Christopher J. Osborn, Eric Torng |
List's worst-average-case or WAC ratio. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 11(3), pp. 213-215, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Competitive analysis, Makespan, Average-case analysis, List scheduling, Online scheduling |
27 | Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger |
How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games? ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 82-93, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Network congestion game, makespan objective, extreme equilibria, complexity, unsplittable flow |
27 | Julien Robert, Nicolas Schabanel |
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 741-753, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Non-clairvoyant algorithm, Equi-partition, Makespan and Overall Set Completion Time minimization, Fairness, Online scheduling, Batch scheduling |
27 | Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang |
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 126-133, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
discrete differential evolution, permutation flowshop, scheduling, particle swarm optimization, makespan |
27 | Bertrand M. T. Lin, T. C. Edwin Cheng |
Two-Machine Flowshop Batching and Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 133(1-4), pp. 149-161, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
strong NP-hardness, heuristics, lower bound, makespan, batch processing, production scheduling, flowshop |
27 | Chung Keung Poon, Wenci Yu |
A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 133(1-4), pp. 175-181, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
unbounded capacity, scheduling, makespan, on-line, batch |
27 | Pawel Jan Kalczynski, Jerzy Kamburowski |
Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(6), pp. 529-536, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
stochastic flow shop, two machines, expected makespan, Monge matrix, traveling salesman problem, sequencing, blocking |
27 | Eugeniusz Nowicki, Czeslaw Smutnicki |
An Advanced Tabu Search Algorithm for the Job Shop Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(2), pp. 145-159, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
tabu search, makespan, job shop scheduling, path relinking |
27 | Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis |
Scheduling trees with large communication delays on two identical processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(2), pp. 179-190, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
two processors, scheduling, trees, makespan, communication delays |
27 | Chung Keung Poon, Wenci Yu |
On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(2), pp. 167-186, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
scheduling, makespan, on-line, release time, batch machine |
27 | Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert |
Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 13th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP 2005), 6-11 February 2005, Lugano, Switzerland, pp. 179-186, 2005, IEEE Computer Society, 0-7695-2280-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
memory limitation, Scheduling, makespan, divisible load, steady-state, memory constraints, bounded buffers |
27 | Nodari Vakhania |
Single-Machine Scheduling with Release Times and Tails. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 129(1-4), pp. 253-271, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
tail, scheduling algorithm, makespan, release time |
27 | Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang |
Approximation Algorithms in Batch Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(3), pp. 247-257, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
scheduling, makespan, on-line, batch, release time |
27 | Sanjeev Baskiyar, Prashanth C. SaiRanga |
Scheduling Directed A-cyclic Task Graphs on Heterogeneous Network of Workstations to Minimize Schedule Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 32nd International Conference on Parallel Processing Workshops (ICPP 2003 Workshops), 6-9 October 2003, Kaohsiung, Taiwan, pp. 97-103, 2003, IEEE Computer Society, 0-7695-2018-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
scheduling, DAG, heterogeneous computing, makespan, task graph |
27 | Hadas Shachnai, Tami Tamir |
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(4), pp. 651-678, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Machine allotments, Parallelizable jobs, Multiprocessor scheduling, Makespan |
27 | Renaud Lepère, Christophe Rapine |
An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 154-165, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Scheduling, approximation algorithm, makespan, performance guarantee, duplication, communication times |
27 | Evgeny V. Shchepin, Nodari Vakhania |
Task Distributions on Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 112-125, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
independent jobs, unrelated processors, approximation algorithm, distribution, makespan |
27 | Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas |
Mapping nested loops onto distributed memory multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 11-13 December 1997, Seoul, Korea, Proceedings, pp. 35-, 1997, IEEE Computer Society, 0-8186-8227-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Chain grouping, low complexity method, index space partitioning, intercommunication requirements, distributed mesh connected architectures, minimum time displacement, discrete groups, optimal makespan, uniform chain, dependence vector, optimal hyperplane scheduling, intragroup computations, partitioned groups, processor utilisation, optimal hyperplane time schedule, distributed memory systems, communication delays, nested loops, distributed memory multiprocessors, loop iterations, space mapping, hyperplane method |
27 | Spyros G. Tzafestas, Alekos Triantafyllakis, George Rizos |
Scheduling dependent tasks on identical machines using a novel heuristic criterion: A robotic computation example. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 12(3), pp. 229-237, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
dependent tasks, makespan criterion, list scheduling algorithms, heuristic algorithms, Scheduling problems, dispatching rules |
24 | Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch |
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(4), pp. 361-374, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Global optimization, Scheduling theory, Location theory |
24 | Ruyan Fu, Ji Tian, Jinjiang Yuan |
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(1), pp. 91-97, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Job families, Competitive ratio, On-line scheduling, Batch machine |
24 | Chyuan Perng, Yi-Chiuan Lai, Zih-Ping Ho, Chin-Lun Ouyang |
A Space Allocation Algorithm for Minimal Makespan in Space Scheduling Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICI ![In: Artificial Intelligence and Computational Intelligence, International Conference, AICI 2009, Shanghai, China, November 7-8, 2009. Proceedings, pp. 526-534, 2009, Springer, 978-3-642-05252-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Space Allocation Algorithm, Resource Constrained Scheduling Problem, Longest Contact Edge Algorithm, Space Scheduling Problem, Dispatching Rules |
24 | Inge Li Gørtz, Viswanath Nagarajan, R. Ravi 0001 |
Minimum Makespan Multi-vehicle Dial-a-Ride. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 540-552, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Manuel López-Ibáñez 0001, Christian Blum 0001, Dhananjay R. Thiruvady, Andreas T. Ernst, Bernd Meyer 0001 |
Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 9th European Conference, EvoCOP 2009, Tübingen, Germany, April 15-17, 2009. Proceedings, pp. 97-108, 2009, Springer, 978-3-642-01008-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Louis-Claude Canon, Emmanuel Jeannot |
Scheduling strategies for the bicriteria optimization of the robustness and makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, pp. 1-8, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | S. Chandrasekaran, S. G. Ponnambalam, R. K. Suresh, N. Vijayakumar |
Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 4012-4018, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Luis Diego Briceno, Mohana Oltikar, Howard Jay Siegel, Anthony A. Maciejewski |
Study of an Iterative Technique to Minimize Completion Times of Non-Makespan Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, 26-30 March 2007, Long Beach, California, USA, pp. 1-14, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Janina A. Brenner, Guido Schäfer |
Cost Sharing Methods for Makespan and Completion Time Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 670-681, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cost sharing mechanisms, game theory, combinatorial optimization, mechanism design, scheduling problems |
Displaying result #1 - #100 of 1520 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|