Search results for "Makespan"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	Envy-free makespan approximation: extended abstract.	ACM Conference on Electronic Commerce	2010	DBLP DOI BibTeX RDF	envy free, job scheduling, makespan
3	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
3	David P. Bunde	Power-aware scheduling for makespan and flow.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Total flow, Dynamic voltage scaling, Makespan, Power-aware scheduling, Speed scaling
3	Bin Fu, Yumei Huo, Hairong Zhao	Makespan Minimization with Machine Availability Constraints.	COCOA	2009	DBLP DOI BibTeX RDF	machine availability constraints, makespan, PTAS, inapproximation
3	Yuzhong Zhang, Zhigang Cao	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
3	Xiaoping Li, Cheng Wu	Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments.	Science in China Series F: Information Sciences	2008	DBLP DOI BibTeX RDF	no-wait flow shops, heuristic, Tabu search, makespan
3	Feng Jin, Jatinder N. D. Gupta, Shiji Song, Cheng Wu	Makespan distribution of permutation flowshop schedules.	J. Scheduling	2008	DBLP DOI BibTeX RDF	Permutation flowshop scheduling problem (PFSP), Makespan distribution, Job-dominated and machine-dominated PFSPs
3	Xin Jiang, Chuang Lin, 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
3	Yumei Li, 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
3	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
3	J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng	Single machine batch scheduling problem with family setup times and release dates to minimize makespan.	J. Scheduling	2006	DBLP DOI BibTeX RDF	Scheduling, Makespan, Family, Batching, Release dates
3	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
3	Débora P. Ronconi	A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking.	Annals OR	2005	DBLP DOI BibTeX RDF	lower bound, branch-and-bound, blocking, makespan, flowshop
3	Liying Kang, T. C. Edwin Cheng, C. T. Ng, 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
3	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. Scheduling	2004	DBLP DOI BibTeX RDF	intermediate delays, strong NP-hardness, computational complexity, makespan, flow shop scheduling
3	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.	Annals OR	2004	DBLP DOI BibTeX RDF	scheduling, approximation algorithm, makespan, polynomial time approximation scheme, flow shop
2	Ruyan Fu, Ji Tian, Jinjiang Yuan	On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Job families, Competitive ratio, On-line scheduling, Batch machine
2	Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch	Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Global optimization, Scheduling theory, Location theory
2	Inge Li Gørtz, Viswanath Nagarajan, R. Ravi	Minimum Makespan Multi-vehicle Dial-a-Ride.	ESA	2009	DBLP DOI BibTeX RDF
2	Manuel López-Ibáñez, Christian Blum, Dhananjay R. Thiruvady, Andreas T. Ernst, Bernd Meyer	Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows.	EvoCOP	2009	DBLP DOI BibTeX RDF
2	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
2	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
2	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
2	Ming Liu, 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
2	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
2	Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall	Preemptive Online Scheduling: Optimal Algorithms for All Speeds.	Algorithmica	2009	DBLP DOI BibTeX RDF	Scheduling, Online algorithms, Makespan
2	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
2	Xiaoqiang Cai, Xianyi Wu, Xian Zhou	Stochastic scheduling on parallel machines to minimize discounted holding costs.	J. Scheduling	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
2	M. D. Mahdi Mobini, Masoud Rabbani, M. S. Amalnik, J. 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
2	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
2	Zhili Cheng, Zhihui Du, Yinong Chen, Xiaoying Wang	Virtual Workspace Based Job Execution Methods and Dynamic Makespan Optimized Scheduling Algorithms.	ICDCS Workshops	2008	DBLP DOI BibTeX RDF
2	Louis-Claude Canon, Emmanuel Jeannot	Scheduling strategies for the bicriteria optimization of the robustness and makespan.	IPDPS	2008	DBLP DOI BibTeX RDF
2	Matthias Englert, Deniz Özmen, Matthias Westermann	The Power of Reordering for Online Minimum Makespan Scheduling.	FOCS	2008	DBLP DOI BibTeX RDF
2	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
2	Joseph Y.-T. Leung, Hairong Zhao	Scheduling problems in master-slave model.	Annals OR	2008	DBLP DOI BibTeX RDF	Master slave model, Approximation algorithms, NP-hard, Makespan, Total completion time
2	Lotfi Hidri, Anis Gharbi, Mohamed Haouari	Energetic reasoning revisited: application to parallel machine scheduling.	J. Scheduling	2008	DBLP DOI BibTeX RDF	Due dates, Feasibility and adjustment procedures, Energetic reasoning, Scheduling, Branch-and-bound, Makespan, Release dates
2	Christopher J. Osborn, Eric Torng	List's worst-average-case or WAC ratio.	J. Scheduling	2008	DBLP DOI BibTeX RDF	Competitive analysis, Makespan, Average-case analysis, List scheduling, Online scheduling
2	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.	The Journal of Supercomputing	2007	DBLP DOI BibTeX RDF	Resource allocation, Robustness, Resource management, Makespan, Dynamic mapping
2	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
2	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
2	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
2	Jack 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
2	Yuzhong Zhang, Zhigang Cao	An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan.	COCOA	2007	DBLP DOI BibTeX RDF
2	Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger	Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines.	WAOA	2007	DBLP DOI BibTeX RDF
2	Quan-Qe 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
2	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
2	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
2	Berit Johannes	Scheduling parallel jobs to minimize the makespan.	J. Scheduling	2006	DBLP DOI BibTeX RDF	parallel jobs, approximation algorithms, online algorithms, multiprocessor scheduling, list scheduling, release dates
2	Ali Husseinzadeh Kashan, Behrooz Karimi, Fariborz Jolai	Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach.	EvoCOP	2006	DBLP DOI BibTeX RDF
2	Xiaoping Li, Qian Wang, Cheng Wu	An Efficient Method for No-Wait Flow Shop Scheduling to Minimize Makespan.	CSCWD	2006	DBLP DOI BibTeX RDF
2	Ashish M. Mehta, Jay Smith, Howard Jay Siegel, Anthony A. Maciejewski, Arun Jayaseelan, Bin Ye	Dynamic Resource Management Heuristics for Minimizing Makespan while Maintaining an Acceptable Level of Robustness in an Uncertain Environment.	ICPADS	2006	DBLP DOI BibTeX RDF
2	Derya Eren Akyol, Gunhan Mirac Bayhan	Minimizing Makespan on Identical Parallel Machines Using Neural Networks.	ICONIP	2006	DBLP DOI BibTeX RDF
2	David P. Bunde	Power-aware scheduling for makespan and flow.	SPAA	2006	DBLP DOI BibTeX RDF	low power, dynamic voltage scaling, power-aware scheduling, speed scaling
2	M. Maiza, Hamid Hentous, Abdenour Labed	An Efficient Heuristic for Scheduling a Flowshop to Minimize the Makespan Criterion.	ISCC	2006	DBLP DOI BibTeX RDF	extended flow, Scheduling, Branch and bound, marking, flow-shop
2	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
2	K. Rameshkumar, R. K. Suresh, K. M. Mohanasundaram	Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan.	ICNC	2005	DBLP DOI BibTeX RDF
2	Tao Wang, Daxin Liu	Scheduling AND/OR Precedence Constraints Jobs to Minimize the Makespan by Mapping from CPM to AND/OR Network.	RTCSA	2005	DBLP DOI BibTeX RDF
2	Michael G. Madden, Roberta Wyrick, Dale E. O'Neill	A strategy for autogeneration of space shuttle ground processing simulation models for project makespan estimation.	Winter Simulation Conference	2005	DBLP DOI BibTeX RDF
2	Prashanth C. SaiRanga, Sanjeev Baskiyar	A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems.	ACM Southeast Regional Conference	2005	DBLP DOI BibTeX RDF	scheduling, heterogeneous computing, makespan, independent tasks
2	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
2	Bertrand M. T. Lin, T. C. Edwin Cheng	Two-Machine Flowshop Batching and Scheduling.	Annals OR	2005	DBLP DOI BibTeX RDF	strong NP-hardness, heuristics, lower bound, makespan, batch processing, production scheduling, flowshop
2	Chung Keung Poon, Wenci Yu	A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity.	Annals OR	2005	DBLP DOI BibTeX RDF	unbounded capacity, scheduling, makespan, on-line, batch
2	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
2	Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis	Scheduling trees with large communication delays on two identical processors.	J. Scheduling	2005	DBLP DOI BibTeX RDF	two processors, scheduling, trees, makespan, communication delays
2	Pawel Jan Kalczynski, Jerzy Kamburowski	Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem.	J. Scheduling	2005	DBLP DOI BibTeX RDF	stochastic flow shop, two machines, expected makespan, Monge matrix, traveling salesman problem, sequencing, blocking
2	Eugeniusz Nowicki, Czeslaw Smutnicki	An Advanced Tabu Search Algorithm for the Job Shop Problem.	J. Scheduling	2005	DBLP DOI BibTeX RDF	tabu search, makespan, job shop scheduling, path relinking
2	George Steiner, Zhihui Xue	Scheduling in Reentrant Robotic Cells: Algorithms and Complexity.	J. Scheduling	2005	DBLP DOI BibTeX RDF	reentrant robotic cell, complexity, polynomial-time algorithm, makespan, cycle time
2	Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà	A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	production/scheduling, approximations/heuristic: multi-exchange neighborhood, networks/graphs, flow algorithms: disjoint cycle computation
2	Chung Keung Poon, Pixing Zhang	Minimizing Makespan in Batch Machine Scheduling.	Algorithmica	2004	DBLP DOI BibTeX RDF	Dynamic job arrival, Scheduling, Makespan, Batch machine
2	Jacek Blazewicz, Maciej Machowiak, Jan Weglarz, Mikhail Y. Kovalyov, Denis Trystram	Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan.	Annals OR	2004	DBLP DOI BibTeX RDF	scheduling, parallel computing, resource allocation
2	Nodari Vakhania	Single-Machine Scheduling with Release Times and Tails.	Annals OR	2004	DBLP DOI BibTeX RDF	tail, scheduling algorithm, makespan, release time
2	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
2	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
2	Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger	Minimizing Makespan and Preemption Costs on a System of Uniform Machines.	ESA	2002	DBLP DOI BibTeX RDF
2	Clint Hepner, Clifford Stein	Minimizing Makespan for the Lazy Bureaucrat Problem.	SWAT	2002	DBLP DOI BibTeX RDF
2	Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber	Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.	APPROX	2002	DBLP DOI BibTeX RDF
2	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
2	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
2	Rolf H. Möhring	Scheduling under Uncertainty: Bounding the Makespan Distribution.	Computational Discrete Mathematics	2001	DBLP DOI BibTeX RDF
2	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
2	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
2	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
2	Chandra Chekuri, Michael A. Bender	An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.	IPCO	1998	DBLP DOI BibTeX RDF
2	Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas	Mapping nested loops onto distributed memory multiprocessors. (PDF / PS)	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
2	Yiqun Ge, David Y. Y. Yun	Simultaneous Compression of Makespan and Number of Processors Using CRP. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	2D Compression, Constrained Resource Planning, Dependency, Resource Management, Granularity, Multiprocessor Scheduling, Completion Time, Inherent Parallelism, Parallel Programming Tool
2	Spyros G. Tzafestas, Alekos Triantafyllakis, George Rizos	Scheduling dependent tasks on identical machines using a novel heuristic criterion: A robotic computation example.	Journal of Intelligent and Robotic Systems	1995	DBLP DOI BibTeX RDF	dependent tasks, makespan criterion, list scheduling algorithms, heuristic algorithms, Scheduling problems, dispatching rules
2	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
1	Ming Liu, Feifeng Zheng, Chengbin Chu, Jiantong Zhang	An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration.	J. Comb. Optim.	2012	DBLP DOI BibTeX RDF
1	J. Behnamian, S. M. T. Fatemi Ghomi, Fariborz Jolai, O. Amirtaheri	Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm.	Appl. Soft Comput.	2012	DBLP DOI BibTeX RDF
1	Purushothaman Damodaran, Mario C. Vélez-Gallego	A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times.	Expert Syst. Appl.	2012	DBLP DOI BibTeX RDF
1	Pedro Gómez-Gasquet, Carlos Andrés, Francisco-Cruz Lario	An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan.	Expert Syst. Appl.	2012	DBLP DOI BibTeX RDF
1	Hiroshi Yamamoto, Masato Tsuru, Katsuyuki Yamazaki, Yuji Oie	Parallel Transferable Uniform Multi-Round Algorithm for Minimizing Makespan.	IEICE Transactions	2012	DBLP BibTeX RDF
1	Lucio Bianco, Massimiliano Caramia	An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations.	European Journal of Operational Research	2012	DBLP DOI BibTeX RDF
1	Peder Lindberg, James Leingang, Daniel Lysaker, Samee Ullah Khan, Juan Li	Comparison and analysis of eight scheduling heuristics for the optimization of energy consumption and makespan in large-scale distributed systems.	The Journal of Supercomputing	2012	DBLP DOI BibTeX RDF
1	Peihai Liu, Xiwen Lu, Yang Fang	A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines.	J. Scheduling	2012	DBLP DOI BibTeX RDF
1	Mi-Yi Kim, Young Hoon Lee	MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Rui Xu, Huaping Chen, Xueping Li	Makespan minimization on single batch-processing machine via ant colony optimization.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Guanlong Deng, Xingsheng Gu	A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Cheng Wang, Shiji Song, Jatinder N. D. Gupta, Cheng Wu	A three-phase algorithm for flowshop scheduling with blocking to minimize makespan.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Ming-Zheng Wang, Ji-Bo Wang	Single-machine makespan minimization scheduling with nonlinear shortening processing times.	Computers & OR	2012	DBLP DOI BibTeX RDF