Search results for "Makespan"

Hits ?▲	Authors	Title	Venue	Year	Link
14	Eduardo Camargo de Siqueira, Marcone J. F. Souza, Sérgio Ricardo de Souza, Moacir Felizardo de França Filho, Carolina Gil Marcelino	An algorithm based on Evolution Strategies for makespan minimization in hybrid flexible flowshop scheduling problems.	IEEE Congress on Evolutionary Computation	2013	DBLP DOI BibTeX RDF
14	Yin Li, Chuang Lin 0002, Fengyuan Ren	Analysis and Improvement of Makespan and Utilization for MapReduce.	HPCC/EUC	2013	DBLP DOI BibTeX RDF
14	Keramat Hasani, Svetalana Kravchenko, Frank Werner 0001	Makespan Minimization for a Two-Machine Scheduling Problem with a Single Server.	MIM	2013	DBLP DOI BibTeX RDF
14	Sajeh Zairi, Zeineb Madhbi, Belhassen Zouari	Generic Colored Petri Nets Model for the Makespan Optimization in Fexible Manufacturing Systems.	MIM	2013	DBLP DOI BibTeX RDF
14	Rodney O. M. Diana, Moacir F. de França Filho, Sérgio Ricardo de Souza, Maria Amélia Lopes Silva	A Clonal Selection Algorithm for Makespan Minimization on Unrelated Parallel Machines with Sequence Dependent Setup Times.	BRACIS	2013	DBLP DOI BibTeX RDF
14	Loris Marchal, Oliver Sinnen, Frédéric Vivien	Scheduling Tree-Shaped Task Graphs to Minimize Memory and Makespan.	IPDPS	2013	DBLP DOI BibTeX RDF
14	Jian Xie, Yongquan Zhou, Zhonghua Tang	Differential Lévy-Flights Bat Algorithm for Minimization Makespan in Permutation Flow Shops.	ICIC (2)	2013	DBLP DOI BibTeX RDF
14	Orides Morandin, Carlos C. M. Tuma, Vinicius F. Carida, Emerson Carlos Pedrino, Roberto H. Tsunaki	PSO in 2D-space to solve reactive scheduling problems in FMS to reduce the makespan.	ISIE	2013	DBLP DOI BibTeX RDF
14	Juan José Durillo, Vlad Nae, Radu Prodan	Multi-objective Workflow Scheduling: An Analysis of the Energy Efficiency and Makespan Tradeoff.	CCGRID	2013	DBLP DOI BibTeX RDF
14	Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih	Lower bounds for the makespan minimization in job shops.	ICNSC	2013	DBLP DOI BibTeX RDF
14	Kostiantyn Berezovskyi, Konstantinos Bletsas, Stefan M. Petters	Faster makespan estimation for GPU threads on a single streaming multiprocessor.	ETFA	2013	DBLP DOI BibTeX RDF
14	Carlos C. M. Tuma, Orides Morandin, Vinicius F. Carida	Minimizing the makespan for the problem of reactive production scheduling in a FMS with AGVs using a new structure of chromosome in a hybrid GA with TS.	ETFA	2013	DBLP DOI BibTeX RDF
14	Susanne Albers	Recent Results for Online Makespan Minimization.	COCOON	2013	DBLP DOI BibTeX RDF
14	Deepak Gupta 0004, Kewal Krishan Nailwal, Sameer Sharma	A Heuristic for Permutation Flowshop Scheduling to Minimize Makespan.	SocProS (2)	2013	DBLP DOI BibTeX RDF
14	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
14	Pedro Gómez-Gasquet, Carlos Andrés, Francisco-Cruz Lario Esteban	An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan.	Expert Syst. Appl.	2012	DBLP DOI BibTeX RDF
14	Michael Andresen, Tanka Nath Dhamala	New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan.	Ann. Oper. Res.	2012	DBLP DOI BibTeX RDF
14	Wei Ding	The makespan problem of scheduling multi groups of jobs on multi processors at different speeds.	Algorithmic Oper. Res.	2012	DBLP BibTeX RDF
14	Cheng Wang, Shiji Song, Jatinder N. D. Gupta, Cheng Wu	A three-phase algorithm for flowshop scheduling with blocking to minimize makespan.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
14	Ming-Zheng Wang, Ji-Bo Wang	Single-machine makespan minimization scheduling with nonlinear shortening processing times.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
14	Mi-Yi Kim, Young Hoon Lee	MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
14	Rui Xu 0004, Huaping Chen 0001, Xueping Li	Makespan minimization on single batch-processing machine via ant colony optimization.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
14	Guanlong Deng, Xingsheng Gu	A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
14	Peder Lindberg, James Leingang, Daniel Lysaker, Samee Ullah Khan, Juan Li 0004	Comparison and analysis of eight scheduling heuristics for the optimization of energy consumption and makespan in large-scale distributed systems.	J. Supercomput.	2012	DBLP DOI BibTeX RDF
14	Shuguang Li	Makespan Minimization on Parallel Batch Processing Machines with Release Times and Job Sizes.	J. Softw.	2012	DBLP DOI BibTeX RDF
14	Harun Aydilek, Ali Allahverdi	Heuristics for no-wait flowshops with makespan subject to mean completion time.	Appl. Math. Comput.	2012	DBLP DOI BibTeX RDF
14	De-ming Lei	Minimizing makespan for scheduling stochastic job shop with random breakdown.	Appl. Math. Comput.	2012	DBLP DOI BibTeX RDF
14	Hiroshi Yamamoto, Masato Tsuru, Katsuyuki Yamazaki, Yuji Oie	Parallel Transferable Uniform Multi-Round Algorithm for Minimizing Makespan.	IEICE Trans. Commun.	2012	DBLP DOI BibTeX RDF
14	Ji-Bo Wang, Ping Ji 0001, T. C. E. Cheng, Dan Wang	Minimizing makespan in a two-machine flow shop with effects of deterioration and learning.	Optim. Lett.	2012	DBLP DOI BibTeX RDF
14	Frederic Pereyrol, Pascale Farthouat, Jean-Paul Bourrières	Fast assessment of production makespan using aggregate technical data.	Comput. Ind.	2012	DBLP DOI BibTeX RDF
14	Bayi Cheng, Shanlin Yang, Ying Ma	Minimising makespan for two batch-processing machines with non-identical job sizes in job shop.	Int. J. Syst. Sci.	2012	DBLP DOI BibTeX RDF
14	Saeed Parsa, Reza Entezari-Maleki	A queuing network model for minimizing the total makespan of computational grids.	Comput. Electr. Eng.	2012	DBLP DOI BibTeX RDF
14	Kuo-Ching Ying, Zne-Jung Lee, Shih-Wei Lin	Makespan minimization for scheduling unrelated parallel machines with setup times.	J. Intell. Manuf.	2012	DBLP DOI BibTeX RDF
14	Krzysztof Fleszar 0002, Christoforos Charalambous, Khalil S. Hindi	A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times.	J. Intell. Manuf.	2012	DBLP DOI BibTeX RDF
14	Amos Fiat, Ariel Levavi	Tight Lower Bounds on Envy-Free Makespan Approximation	CoRR	2012	DBLP BibTeX RDF
14	Stavros G. Kolliopoulos, Yannis Moysoglou	The 2-valued case of makespan minimization with assignment constraints	CoRR	2012	DBLP BibTeX RDF
14	Guillaume Aupy, Anne Benoit	Approximation algorithms for energy, reliability and makespan optimization problems	CoRR	2012	DBLP BibTeX RDF
14	Loris Marchal, Oliver Sinnen, Frédéric Vivien	Scheduling tree-shaped task graphs to minimize memory and makespan	CoRR	2012	DBLP BibTeX RDF
14	Javad Behnamian, S. M. T. Fatemi Ghomi, Fariborz Jolai, Omid Amirtaheri	Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm.	Appl. Soft Comput.	2012	DBLP DOI BibTeX RDF
14	Lucio Bianco, Massimiliano Caramia	An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations.	Eur. J. Oper. Res.	2012	DBLP DOI BibTeX RDF
14	Fardin Ahmadizar	A new ant colony algorithm for makespan minimization in permutation flow shops.	Comput. Ind. Eng.	2012	DBLP DOI BibTeX RDF
14	Wen-Chiung Lee, Mei-Chi Chuang, Wei-Chang Yeh	Uniform parallel-machine scheduling to minimize makespan with position-based learning curves.	Comput. Ind. Eng.	2012	DBLP DOI BibTeX RDF
14	Peihai Liu, Xiwen Lu, Yang Fang	A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines.	J. Sched.	2012	DBLP DOI BibTeX RDF
14	Liron Yedidsion	Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine.	J. Sched.	2012	DBLP DOI BibTeX RDF
14	Jie Zhu 0002, Xiaoping Li 0001	An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan.	IEEE Trans Autom. Sci. Eng.	2012	DBLP DOI BibTeX RDF
14	Ming Liu 0008, 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
14	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	Envy-Free Makespan Approximation.	SIAM J. Comput.	2012	DBLP DOI BibTeX RDF
14	Nacira Chikhi, Moncef Abbas	Minimizing the Makespan in a Robotic Cell Scheduling Problem.	CTW	2012	DBLP BibTeX RDF
14	Andrew M. Sutton, Frank Neumann 0001	A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling.	PPSN (1)	2012	DBLP DOI BibTeX RDF
14	Abhishek Verma, Ludmila Cherkasova, Roy H. Campbell	Two Sides of a Coin: Optimizing the Schedule of MapReduce Jobs to Minimize Their Makespan and Improve Cluster Performance.	MASCOTS	2012	DBLP DOI BibTeX RDF
14	Kostiantyn Berezovskyi, Konstantinos Bletsas, Björn Andersson	Makespan Computation for GPU Threads Running on a Single Streaming Multiprocessor.	ECRTS	2012	DBLP DOI BibTeX RDF
14	V. Santhosh Kumar Tangudu, Manoj Mishra	Estimating makespan using double trust thresholds for workflow applications.	CUBE	2012	DBLP DOI BibTeX RDF
14	Mohammad Hadi Mobini, Reza Entezari-Maleki, Ali Movaghar 0001	Biogeography-based optimization of makespan and reliability in grid computing systems.	ICUMT	2012	DBLP DOI BibTeX RDF
14	Guillaume Aupy, Anne Benoit, Yves Robert	Energy-aware scheduling under reliability and makespan constraints.	HiPC	2012	DBLP DOI BibTeX RDF
14	Sheng Yu 0003, Jude-Thaddeus Ojiaku, Prudence W. H. Wong, Yinfeng Xu	Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines.	TAMC	2012	DBLP DOI BibTeX RDF
14	Susanne Albers, Matthias Hellwig	On the Value of Job Migration in Online Makespan Minimization.	ESA	2012	DBLP DOI BibTeX RDF
14	Rong Su 0001	A greedy algorithm for computing finite-makespan controllable sublanguages.	CDC	2012	DBLP DOI BibTeX RDF
14	Amos Fiat, Ariel Levavi	Tight Lower Bounds on Envy-Free Makespan Approximation.	WINE	2012	DBLP DOI BibTeX RDF
14	Anna Rotondo, John Geraghty, Paul Young	Using simulation and hybrid sequencing optimization for makespan reduction at a wet tool.	WSC	2012	DBLP DOI BibTeX RDF
14	Tao Xu, Xia Zhu, Xiaoping Li 0001	Efficient iterated greedy algorithm to minimize makespan for the no-wait flowshop with sequence dependent setup times.	CSCWD	2012	DBLP DOI BibTeX RDF
14	Peiying Hou, Dandan Wang 0004, Xiaoping Li 0001	An improved harmony search algorithm for blocking job shop to minimize makespan.	CSCWD	2012	DBLP DOI BibTeX RDF
14	Fabricio Niebles Atencio, Elyn L. Solano-Charris, Jairo R. Montoya-Torres	Ant colony optimization algorithm to minimize makespan and number of tardy jobs in flexible flowshop systems.	CLEI	2012	DBLP DOI BibTeX RDF
14	Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis	Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems.	WAOA	2012	DBLP DOI BibTeX RDF
14	Dipak Laha	A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling.	SEMCCO	2012	DBLP DOI BibTeX RDF
14	Yan Lan, Xin Chen 0032, Ning Ding, György Dósa, Xin Han	Online Minimum Makespan Scheduling with a Buffer.	FAW-AAIM	2012	DBLP DOI BibTeX RDF
14	Zhiqiang Zhang, Jing Zhang 0009	An Improved Ant Colony Optimization Algorithm for Permutation Flowshop Scheduling to Minimize Makespan.	PDCAT	2012	DBLP DOI BibTeX RDF
14	Kai Tian, Yunlian Jiang, Xipeng Shen, Weizhen Mao	Optimal Co-Scheduling to Minimize Makespan on Chip Multiprocessors.	JSSPP	2012	DBLP DOI BibTeX RDF
14	Hui-Miao Cheng, Kuo-Ching Ying	Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times.	Expert Syst. Appl.	2011	DBLP DOI BibTeX RDF
14	Guosheng Ding, Shijie Sun	Single Machine Family Scheduling with Two Competing Agents to minimize makespan.	Asia Pac. J. Oper. Res.	2011	DBLP DOI BibTeX RDF
14	Grzegorz Waligóra	Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan.	Comput. Optim. Appl.	2011	DBLP DOI BibTeX RDF
14	Mehmet Duran Toksari	A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs.	Comput. Oper. Res.	2011	DBLP DOI BibTeX RDF
14	Xianpeng Wang 0002, Lixin Tang	Scheduling a single machine with multiple job processing ability to minimize makespan.	J. Oper. Res. Soc.	2011	DBLP DOI BibTeX RDF
14	Danyu Bai, Lixin Tang	Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan.	Int. J. Syst. Sci.	2011	DBLP DOI BibTeX RDF
14	Rasoul Shafaei, Meysam Rabiee, M. Mirzaeyan	An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop.	Int. J. Comput. Integr. Manuf.	2011	DBLP DOI BibTeX RDF
14	Yumei Huo, Hairong Zhao	Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
14	Ming Liu 0008, Feifeng Zheng, Chengbin Chu, Yinfeng Xu	Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
14	Johnny C. Ho, Francisco J. López, Alex J. Ruiz-Torres, Tzu-Liang (Bill) Tseng	Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines.	J. Intell. Manuf.	2011	DBLP DOI BibTeX RDF
14	Purushothaman Damodaran, Mario C. Vélez-Gallego, Jairo Maya	A GRASP approach for makespan minimization on parallel batch processing machines.	J. Intell. Manuf.	2011	DBLP DOI BibTeX RDF
14	Inge Li Gørtz, Viswanath Nagarajan, R. Ravi 0001	Minimum Makespan Multi-vehicle Dial-a-Ride	CoRR	2011	DBLP BibTeX RDF
14	Susanne Albers, Matthias Hellwig	On the Value of Job Migration in Online Makespan Minimization	CoRR	2011	DBLP BibTeX RDF
14	Guillaume Aupy, Anne Benoit, Yves Robert	Energy-aware scheduling under reliability and makespan constraints	CoRR	2011	DBLP BibTeX RDF
14	Lisa Fleischer, Zhenghui Wang	Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines	CoRR	2011	DBLP BibTeX RDF
14	M. Hekmatfar, S. M. T. Fatemi Ghomi, Behrooz Karimi	Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan.	Appl. Soft Comput.	2011	DBLP DOI BibTeX RDF
14	Kai Li 0019, Ye Shi, Shanlin Yang, Bayi Cheng	Parallel machine scheduling problem to minimize the makespan with resource dependent processing times.	Appl. Soft Comput.	2011	DBLP DOI BibTeX RDF
14	Shisheng Li, C. T. Ng 0001, T. C. Edwin Cheng, Jinjiang Yuan	Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.	Eur. J. Oper. Res.	2011	DBLP DOI BibTeX RDF
14	Xiaofeng Wang 0002, Chee Shin Yeo, Rajkumar Buyya, Jinshu Su	Optimizing the makespan and reliability for workflow applications with reputation and a look-ahead genetic algorithm.	Future Gener. Comput. Syst.	2011	DBLP DOI BibTeX RDF
14	Xiao-Yuan Wang, Ming-Zheng Wang, Ji-Bo Wang	Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times.	Comput. Ind. Eng.	2011	DBLP DOI BibTeX RDF
14	Jinjiang Yuan, Ruyan Fu, C. T. Ng 0001, T. C. Edwin Cheng	A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.	J. Sched.	2011	DBLP DOI BibTeX RDF
14	Donatas Elvikis, Horst W. Hamacher, Vincent T'kindt	Scheduling two agents on uniform parallel machines with makespan and cost functions.	J. Sched.	2011	DBLP DOI BibTeX RDF
14	Panneerselvam Senthilkumar, Sockalingam Narayanan	Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines.	Intell. Inf. Manag.	2011	DBLP DOI BibTeX RDF
14	Panneerselvam Senthilkumar, Sockalingam Narayanan	GA Based Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines.	Intell. Inf. Manag.	2011	DBLP DOI BibTeX RDF
14	Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo	Minimizing makespan in an ordered flow shop with machine-dependent processing times.	J. Comb. Optim.	2011	DBLP DOI BibTeX RDF
14	Orhan Engin, Cengiz Günaydin	An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan.	Int. J. Comput. Intell. Syst.	2011	DBLP DOI BibTeX RDF
14	Lisa Fleischer, Zhenghui Wang	Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines.	SAGT	2011	DBLP DOI BibTeX RDF
14	Pavol Semanco, Vladimír Modrák	Hybrid GA-Based Improvement Heuristic with Makespan Criterion for Flow-Shop Scheduling Problems.	CENTERIS (2)	2011	DBLP DOI BibTeX RDF
14	Christopher J. Reynolds, Stephen C. Winter, Gábor Terstyánszky, Tamás Kiss, Pamela Greenwell, Sandor Acs, Péter Kacsuk	Scientific Workflow Makespan Reduction through Cloud Augmented Desktop Grids.	CloudCom	2011	DBLP DOI BibTeX RDF
14	Kaizhou Gao, Shengxian Xie, Hua Jiang, Junqing Li 0001	Discrete Harmony Search Algorithm for the No Wait Flow Shop Scheduling Problem with Makespan Criterion.	ICIC (1)	2011	DBLP DOI BibTeX RDF
14	Zheng Li 0006, Li Wang 0011, Shangping Ren, Gang Quan	Temperature, Power, and Makespan Aware Dependent Task Scheduling for Data Centers.	GreenCom	2011	DBLP DOI BibTeX RDF
14	Jonathan Apodaca, Bobby Dalton Young, Luis Diego Briceno, Jay Smith, Sudeep Pasricha, Anthony A. Maciejewski, Howard Jay Siegel, Shirish Bahirat, Bhavesh Khemka, Adrian Ramirez, Yong Zou 0001	Stochastically robust static resource allocation for energy minimization with a makespan constraint in a heterogeneous computing environment.	AICCSA	2011	DBLP DOI BibTeX RDF
14	Jie Zhu 0002, Xiaoping Li 0001	An efficient metaheuristic for the blocking job shop problem with the makespan minimization.	ICMLC	2011	DBLP DOI BibTeX RDF