Search results for "Makespan"

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.	J. Sched.	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.	EC	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.	HiPC	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.	FOCS	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.	ISAAC	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.	IPDPS Next Generation Software Program - NSFNGS - PI Workshop	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.	ESA	2001	DBLP DOI BibTeX RDF
54	Joseph Y.-T. Leung, Hairong Zhao	Scheduling problems in master-slave model.	Ann. Oper. Res.	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.	SPAA	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.	CSCWD	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.	Algorithmica	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.	NPC	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.	ICFIE	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.	IEEE Trans. Computers	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.	SPAA	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.	Euro-Par	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.	SPAA	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.	J. Sched.	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.	Euro-Par	2008	DBLP DOI BibTeX RDF
42	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
41	David P. Bunde	Power-aware scheduling for makespan and flow.	J. Sched.	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.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Non-availability constraint, Scheduling, Approximation, Makespan
41	Bin Fu, Yumei Huo, Hairong Zhao	Makespan Minimization with Machine Availability Constraints.	COCOA	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.	Sci. China Ser. F Inf. Sci.	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.	J. Comb. Optim.	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.	J. Sched.	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.	Ann. Oper. Res.	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.	Algorithmica	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.	Ann. Oper. Res.	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.	J. Sched.	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.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
37	Evgeny V. Shchepin, Nodari Vakhania	On the geometry, preemptions and complexity of multiprocessor and shop scheduling.	Ann. Oper. Res.	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.	COCOON	2008	DBLP DOI BibTeX RDF
37	James Aspnes, Yang Richard Yang, Yitong Yin	Path-independent load balancing with unreliable machines.	SODA	2007	DBLP BibTeX RDF
37	Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz	Coordination Mechanisms for Selfish Scheduling.	WINE	2005	DBLP DOI BibTeX RDF
37	Noriyuki Fujimoto, Kenichi Hagihara	A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks.	SAINT Workshops	2004	DBLP DOI BibTeX RDF
37	Emmanuel Hebrard	Extending Super-solutions.	CP	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.	ISPDC	2003	DBLP DOI BibTeX RDF
37	Noriyuki Fujimoto, Kenichi Hagihara	Near-Optimal Dynamic Task Scheduling of Independent Coarse-Grained Tasks onto a Computational Grid.	ICPP	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.	ICCCI	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.	ICFIE	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.	J. Sched.	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.	ACM Southeast Regional Conference (1)	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.	SCCC	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.	PARLE	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.	ICDCS Workshops	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.	RTCSA	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.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	scheduling, parallel computing, resource allocation
33	Rolf H. Möhring	Scheduling under Uncertainty: Bounding the Makespan Distribution.	Computational Discrete Mathematics	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.	J. Supercomput.	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.	Algorithmica	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.	J. Supercomput.	2012	DBLP DOI BibTeX RDF
28	Christoph Dürr, Kim Thang Nguyen	Non-clairvoyant Scheduling Games.	SAGT	2009	DBLP DOI BibTeX RDF
28	Hagit Attiya, Alessia Milani	Transactional Scheduling for Read-Dominated Workloads.	OPODIS	2009	DBLP DOI BibTeX RDF
28	Nadathur Satish, Kaushik Ravindran, Kurt Keutzer	Scheduling task dependence graphs with variable task execution times onto heterogeneous multiprocessors.	EMSOFT	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.	ICPP	2008	DBLP DOI BibTeX RDF
28	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert	Contention Resolution with Heterogeneous Job Sizes.	ESA	2006	DBLP DOI BibTeX RDF
28	Zhiao Shi, Emmanuel Jeannot, Jack J. Dongarra	Robust task scheduling in non-deterministic heterogeneous computing systems.	CLUSTER	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.	IPDPS	2005	DBLP DOI BibTeX RDF
28	Jianning Lin, Huizhong Wu	A Task Duplication Based Scheduling Algorithm on GA in Grid Computing Systems.	ICNC (3)	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.	ASAP	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.	CLUSTER	2005	DBLP DOI BibTeX RDF
28	Gagan Aggarwal, Rajeev Motwani 0001, An Zhu	The load rebalancing problem.	SPAA	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.	ICTCS	2001	DBLP DOI BibTeX RDF
28	T. C. Edwin Cheng, Qing Ding	Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times.	Acta Informatica	2000	DBLP DOI BibTeX RDF
27	Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall	Preemptive Online Scheduling: Optimal Algorithms for All Speeds.	Algorithmica	2009	DBLP DOI BibTeX RDF	Scheduling, Online algorithms, Makespan
27	Brighten Godfrey, Richard M. Karp	On the Price of Heterogeneity in Parallel Systems.	Theory Comput. Syst.	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.	Soft Comput.	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.	ADHOC-NOW	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.	COCOA	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.	COCOA	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.	J. Sched.	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.	J. Sched.	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?	WINE	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.	ESA	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.	GECCO	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.	Ann. Oper. Res.	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.	Ann. Oper. Res.	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.	J. Sched.	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.	J. Sched.	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.	J. Sched.	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.	J. Comb. Optim.	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.	PDP	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.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	tail, scheduling algorithm, makespan, release time
27	Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang	Approximation Algorithms in Batch Processing.	J. Comb. Optim.	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.	ICPP Workshops	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.	Algorithmica	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.	STACS	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.	IFIP TCS	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.	ICPADS	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.	J. Intell. Robotic Syst.	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.	J. Sched.	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.	J. Sched.	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.	AICI	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.	ESA	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.	EvoCOP	2009	DBLP DOI BibTeX RDF
24	Louis-Claude Canon, Emmanuel Jeannot	Scheduling strategies for the bicriteria optimization of the robustness and makespan.	IPDPS	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.	IEEE Congress on Evolutionary Computation	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.	IPDPS	2007	DBLP DOI BibTeX RDF
24	Janina A. Brenner, Guido Schäfer	Cost Sharing Methods for Makespan and Completion Time Scheduling.	STACS	2007	DBLP DOI BibTeX RDF	cost sharing mechanisms, game theory, combinatorial optimization, mechanism design, scheduling problems