Search results for "Makespan"

Hits ?▲	Authors	Title	Venue	Year	Link
14	Cong Chen, Yinfeng Xu, Yuqing Zhu 0002, Chengyu Sun	Online MapReduce scheduling problem of minimizing the makespan.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
14	Manzhan Gu, Xiwen Lu, Jinwei Gu	An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
14	Miao Yu 0003, Viswanath Nagarajan, Siqian Shen	Minimum Makespan Vehicle Routing Problem with Compatibility Constraints.	CPAIOR	2017	DBLP DOI BibTeX RDF
14	Jan Dvorák, Martin Heller, Zdenek Hanzálek	Makespan minimization of Time-Triggered traffic on a TTEthernet network.	WFCS	2017	DBLP DOI BibTeX RDF
14	Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Mario C. Vélez-Gallego	A variable block insertion heuristic for permutation flowshops with makespan criterion.	CEC	2017	DBLP DOI BibTeX RDF
14	Leticia Hernando, Fabio Daolio, Nadarajen Veerapen, Gabriela Ochoa	Local Optima Networks of the Permutation Flowshop Scheduling Problem: Makespan vs. total flow time.	CEC	2017	DBLP DOI BibTeX RDF
14	Syamantak Das, Andreas Wiese	On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine.	ESA	2017	DBLP DOI BibTeX RDF
14	Mohammad Mohammadi 0002, Soheyl Khalilpourazari	Minimizing makespan in a single machine scheduling problem with deteriorating jobs and learning effects.	ICSCA	2017	DBLP DOI BibTeX RDF
14	Jose M. Framiñan, Paz Perez-Gonzalez, Victor Fernandez-Viagas Escudero	The value of real-time data in stochastic flowshop scheduling: A simulation study for makespan.	WSC	2017	DBLP DOI BibTeX RDF
14	Shervin Hajiamini, Behrooz A. Shirazi, Chris Cain, Hongbo Dong 0001	An energy-constrained makespan optimization framework in fine-to coarse-grain partitioned multicore systems.	IGSC	2017	DBLP DOI BibTeX RDF
14	Arent W. de Jong, Jose Ildefonso U. Rubrico, Masaru Adachi, Takayuki Nakamura, Jun Ota 0001	Big data in automation: Towards generalized makespan estimation in shop scheduling problems.	CASE	2017	DBLP DOI BibTeX RDF
14	Xiaoyue Fu, Felix T. S. Chan, Ben Niu 0002, Sai Ho Chung, Ying Bi	Minimization of Makespan Through Jointly Scheduling Strategy in Production System with Mould Maintenance Consideration.	ICIC (1)	2017	DBLP DOI BibTeX RDF
14	Michal Feldman, Amos Fiat, Alan Roytman	Makespan Minimization via Posted Prices.	EC	2017	DBLP DOI BibTeX RDF
14	Hanna Zini, Souad El Bernoussi	Minimizing makespan in hybrid flow shop scheduling with multiprocessor task problems using a discrete harmony search.	CIVEMSA	2017	DBLP DOI BibTeX RDF
14	Soniya Lalwani, Harish Sharma, Abhay Verma, Kusum Deep	Minimization of Makespan for Parallel Machines Using PSO to Enhance Caching of MSA-Based Multi-query Processes.	SocProS (2)	2017	DBLP DOI BibTeX RDF
14	Yi Zhang 0025, Jin Sun 0001, Zebin Wu 0001	An Heuristic for Bag-of-Tasks Scheduling Problems with Resource Demands and Budget Constraints to Minimize Makespan on Hybrid Clouds.	CBD	2017	DBLP DOI BibTeX RDF
14	Asaf Levin	Approximation Schemes for Makespan Minimization.	Encyclopedia of Algorithms	2016	DBLP DOI BibTeX RDF
14	Chuanli Zhao, Hengyong Tang	Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan.	Asia Pac. J. Oper. Res.	2016	DBLP DOI BibTeX RDF
14	Elina Pacini, Cristian Mateos, Carlos García Garino, Claudio Careglio, Anibal Mirasso	A bio-inspired scheduler for minimizing makespan and flowtime of computational mechanics applications on federated clouds.	J. Intell. Fuzzy Syst.	2016	DBLP DOI BibTeX RDF
14	Nouri Nouha, Talel Ladhari	An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem.	Polibits	2016	DBLP DOI BibTeX RDF
14	Sheng Zhang 0001, Jie Wu 0001, Sanglu Lu	Distributed Workload Dissemination for Makespan Minimization in Disruption Tolerant Networks.	IEEE Trans. Mob. Comput.	2016	DBLP DOI BibTeX RDF
14	Guillaume Aupy, Anne Benoit	Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems.	Parallel Process. Lett.	2016	DBLP DOI BibTeX RDF
14	Abbasali Jafari, Hassan Khademi-Zare, Mohammad Mehdi Lotfi, Reza Tavakkoli-Moghaddam	A note on "minimizing makespan in three machine flow shop with deteriorating jobs".	Comput. Oper. Res.	2016	DBLP DOI BibTeX RDF
14	Danyu Bai, Zhi-Hai Zhang, Qiang Zhang	Flexible open shop scheduling problem to minimize makespan.	Comput. Oper. Res.	2016	DBLP DOI BibTeX RDF
14	Young-Jin An, Yeong-Dae Kim, Seong-Woo Choi	Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times.	Comput. Oper. Res.	2016	DBLP DOI BibTeX RDF
14	Mario C. Vélez-Gallego, Jairo Maya, Jairo R. Montoya-Torres	A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan.	Comput. Oper. Res.	2016	DBLP DOI BibTeX RDF
14	Alexander J. Benavides, Marcus Ritt	Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops.	Comput. Oper. Res.	2016	DBLP DOI BibTeX RDF
14	Wenhong Tian, GuoZhong Li, Wutong Yang, Rajkumar Buyya	HScheduler: an optimal approach to minimize the makespan of multiple MapReduce jobs.	J. Supercomput.	2016	DBLP DOI BibTeX RDF
14	S. Afshin Mansouri, Emel Aktas	Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem.	J. Oper. Res. Soc.	2016	DBLP DOI BibTeX RDF
14	Liqi Zhang, Lingfa Lu, Jinjiang Yuan	Two-machine open-shop scheduling with rejection to minimize the makespan.	OR Spectr.	2016	DBLP DOI BibTeX RDF
14	Clifford Beaton, Claver Diallo, Eldon A. Gunn	Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints.	INFOR Inf. Syst. Oper. Res.	2016	DBLP DOI BibTeX RDF
14	Song-Song Li, Yu-Zhong Zhang	On-Line Scheduling on Parallel Machines to Minimize the Makespan.	J. Syst. Sci. Complex.	2016	DBLP DOI BibTeX RDF
14	Kyle M. Tarplee, Ryan D. Friese, Anthony A. Maciejewski, Howard Jay Siegel, Edwin K. P. Chong	Energy and Makespan Tradeoffs in Heterogeneous Computing Systems using Efficient Linear Programming Techniques.	IEEE Trans. Parallel Distributed Syst.	2016	DBLP DOI BibTeX RDF
14	Klaus Jansen, Kim-Manuel Klein, José Verschae	Closing the Gap for Makespan Scheduling via Sparsification Techniques.	CoRR	2016	DBLP BibTeX RDF
14	Pavel Surynek	Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability.	CoRR	2016	DBLP BibTeX RDF
14	Wenhong Tian, Guangchun Luo, Ling Tian, Aiguo Chen	On Dynamic Job Ordering and Slot Configurations for Minimizing the Makespan Of Multiple MapReduce Jobs.	CoRR	2016	DBLP BibTeX RDF
14	Zhao-Hong Jia, Chao Wang, Joseph Y.-T. Leung	An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families.	Appl. Soft Comput.	2016	DBLP DOI BibTeX RDF
14	S. Afshin Mansouri, Emel Aktas, Umut Besikci	Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption.	Eur. J. Oper. Res.	2016	DBLP DOI BibTeX RDF
14	Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo	Scheduling a single machine with parallel batching to minimize makespan and total rejection cost.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
14	M. K. Marichelvam, Ömür Tosun	Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion.	Int. J. Swarm Intell. Res.	2016	DBLP DOI BibTeX RDF
14	Nurul Suhaimi, Christine Nguyen, Purushothaman Damodaran	Lagrangian approach to minimize makespan of non-identical parallel batch processing machines.	Comput. Ind. Eng.	2016	DBLP DOI BibTeX RDF
14	Huan Jin, Barrett W. Thomas, Mike Hewitt	Integer programming techniques for makespan minimizing workforce assignment models that recognize human learning.	Comput. Ind. Eng.	2016	DBLP DOI BibTeX RDF
14	Nilsen Kundakci, Osman Kulak	Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem.	Comput. Ind. Eng.	2016	DBLP DOI BibTeX RDF
14	Dipak Laha, Jatinder N. D. Gupta	A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops.	Comput. Ind. Eng.	2016	DBLP DOI BibTeX RDF
14	Shih-Wei Lin, Kuo-Ching Ying	Minimizing makespan for solving the distributed no-wait flowshop scheduling problem.	Comput. Ind. Eng.	2016	DBLP DOI BibTeX RDF
14	Ivar Massabò, Giuseppe Paletta, Alex J. Ruiz-Torres	A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem.	J. Sched.	2016	DBLP DOI BibTeX RDF
14	Peruvemba Sundaram Ravi, Levent Tunçel, Michael Huang	Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime.	J. Sched.	2016	DBLP DOI BibTeX RDF
14	Kejun Zhao, Xiwen Lu, Manzhan Gu	A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines.	J. Sched.	2016	DBLP DOI BibTeX RDF
14	Miguel A. Salido, Joan Escamilla, Federico Barber, Adriana Giret, Dunbing Tang, Min Dai	Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems.	Artif. Intell. Eng. Des. Anal. Manuf.	2016	DBLP DOI BibTeX RDF
14	Kejun Zhao, Xiwen Lu	Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan.	J. Comb. Optim.	2016	DBLP DOI BibTeX RDF
14	Qijia Liu, Jinjiang Yuan	Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness.	J. Comb. Optim.	2016	DBLP DOI BibTeX RDF
14	Klaas Dählmann, Jürgen Sauer 0001	A Multi-Objective Approach for both Makespan- and Energy-Efficient Scheduling in Injection Molding.	KI	2016	DBLP DOI BibTeX RDF
14	Hafewa Bargaoui, Olfa Belkahla Driss, Khaled Ghédira	Minimizing makespan in multi-factory flow shop problem using a chemical reaction metaheuristic.	CEC	2016	DBLP DOI BibTeX RDF
14	Klaus Jansen, Kim-Manuel Klein, José Verschae	Closing the Gap for Makespan Scheduling via Sparsification Techniques.	ICALP	2016	DBLP DOI BibTeX RDF
14	Carlos C. M. Tuma, Orides Morandin, Vinicius F. Carida	Comparison of performance the neighborhood operators and the ratio of search local-global in minimizing makespan using an GA-VNS collaboration to solve reactive production scheduling.	IECON	2016	DBLP DOI BibTeX RDF
14	Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin	A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan.	FAW	2016	DBLP DOI BibTeX RDF
14	Tao Ren 0002, Bingqian Liu, Peng Zhao, Huawei Yuan, Haiyan Li, Danyu Bai	Two-Stage Flow-Open Shop Scheduling Problem to Minimize Makespan.	ICIC (1)	2016	DBLP DOI BibTeX RDF
14	Jin-Xi Zhao, Bin Qian 0001, Rong Hu, Chang-Sheng Zhang 0002, Zi-Hui Li	An Improved Quantum-Inspired Evolution Algorithm for No-Wait Flow Shop Scheduling Problem to Minimize Makespan.	ICIC (1)	2016	DBLP DOI BibTeX RDF
14	Khaoula Ben Abdellafou, Ouajdi Korbaa	Makespan minimization for two parallel machines with unavailability constraints.	SMC	2016	DBLP DOI BibTeX RDF
14	Henri Casanova, Julien Herrmann, Yves Robert	Computing the Expected Makespan of Task Graphs in the Presence of Silent Errors.	ICPP Workshops	2016	DBLP DOI BibTeX RDF
14	Siew Hoon Leong, Dieter Kranzlmüller	Urgent Computing - A General Makespan Robustness Model for Ensembles of Forecasts.	ICCS	2016	DBLP DOI BibTeX RDF
14	Klaus Jansen, Kati Land, Marten Maack	Estimating The Makespan of The Two-Valued Restricted Assignment Problem.	SWAT	2016	DBLP DOI BibTeX RDF
14	Xin Li 0017, Cui Tang	Makespan Minimization for Batch Tasks in Data Centers.	SpaCCS Workshops	2016	DBLP DOI BibTeX RDF
14	Elaine Levey, Thomas Rothvoss	A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies.	STOC	2016	DBLP DOI BibTeX RDF
14	Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski	An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives.	SOCS	2016	DBLP DOI BibTeX RDF
14	Sanjoy K. Baruah, Arvind Easwaran, Zhishan Guo	Mixed-Criticality Scheduling to Minimize Makespan.	FSTTCS	2016	DBLP DOI BibTeX RDF
14	Edyta Kucharska, Katarzyna Grobler-Debska, Krzysztof Raczka	ALMM-Based Methods for Optimization Makespan Flow-Shop Problem with Defects.	ISAT (1)	2016	DBLP DOI BibTeX RDF
14	Wenyou Jia, Zhibin Jiang, You Li	Scheduling to minimize the makespan in large-piece one-of-a-kind production with machine availability constraints.	Expert Syst. Appl.	2015	DBLP DOI BibTeX RDF
14	Wenhua Li, Jie Gao, Jinjiang Yuan	Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan.	Asia Pac. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Na Yin, Liying Kang	Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration.	Asia Pac. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Jun Pei, Wenjuan Fan, Panos M. Pardalos, Xinbao Liu, Boris Goldengorin, Shanlin Yang	Preemptive scheduling in a two-stage supply chain to minimize the makespan.	Optim. Methods Softw.	2015	DBLP DOI BibTeX RDF
14	Wenjie Wang 0005, Wooi Boon Goh	An iterative approach for makespan-minimized multi-agent path planning in discrete space.	Auton. Agents Multi Agent Syst.	2015	DBLP DOI BibTeX RDF
14	Hao-Chin Chang, Yeh-Peng Chen, Tung-Kuan Liu, Jyh-Horng Chou	Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic Algorithm.	IEEE Access	2015	DBLP DOI BibTeX RDF
14	Victor Fernandez-Viagas, Jose M. Framiñan	Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness.	Comput. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Jian-Jun Wang 0001, Bing-Hang Zhang	Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects.	Comput. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Anna Rotondo, Paul Young, John Geraghty	Sequencing optimisation for makespan improvement at wet-etch tools.	Comput. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Inge Li Gørtz, Viswanath Nagarajan, R. Ravi 0001	Minimum Makespan Multi-Vehicle Dial-a-Ride.	ACM Trans. Algorithms	2015	DBLP DOI BibTeX RDF
14	Mingbao Cheng, Pandu R. Tadikamalla, Jennifer Shang, Bixi Zhang	Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time.	J. Oper. Res. Soc.	2015	DBLP DOI BibTeX RDF
14	Daniel Guimaraes do Lago, Edmundo Roberto Mauro Madeira, Deep Medhi	On Makespan, Migrations, and QoS Workloads' Execution Times in High Speed Data Centers.	IEICE Trans. Commun.	2015	DBLP DOI BibTeX RDF
14	Rong Su 0001	A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages.	IEEE Trans. Autom. Control.	2015	DBLP DOI BibTeX RDF
14	Mauro Franceschelli, Alessandro Giua, Carla Seatzu	Fast discrete consensus based on gossip for makespan minimization in networked systems.	Autom.	2015	DBLP DOI BibTeX RDF
14	Zhichao Geng, Jinjiang Yuan	Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness.	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
14	Lingfa Lu, Liqi Zhang, Long Wan	Integrated production and delivery scheduling on a serial batch machine to minimize the makespan.	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
14	Mark A. Oxley, Sudeep Pasricha, Anthony A. Maciejewski, Howard Jay Siegel, Jonathan Apodaca, Bobby Dalton Young, Luis Diego Briceno, Jay Smith, Shirish Bahirat, Bhavesh Khemka, Adrian Ramirez, Yong Zou 0001	Makespan and Energy Robust Stochastic Static Resource Allocation of a Bag-of-Tasks to a Heterogeneous Computing System.	IEEE Trans. Parallel Distributed Syst.	2015	DBLP DOI BibTeX RDF
14	Kyle M. Tarplee, Ryan D. Friese, Anthony A. Maciejewski, Howard Jay Siegel	Scalable linear programming based resource allocation for makespan minimization in heterogeneous computing systems.	J. Parallel Distributed Comput.	2015	DBLP DOI BibTeX RDF
14	Rodney Oliveira Marinho Diana, Moacir Felizardo de França Filho, Sérgio Ricardo de Souza, João Francisco de Almeida Vitor	An immune-inspired algorithm for an unrelated parallel machines' scheduling problem with sequence and machine dependent setup-times for makespan minimisation.	Neurocomputing	2015	DBLP DOI BibTeX RDF
14	Zhe Cui, Xingsheng Gu	An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems.	Neurocomputing	2015	DBLP DOI BibTeX RDF
14	Shafii Muhammad Abdulhamid, Muhammad Shafie Abdul Latif, Ismaila Idris	Tasks Scheduling Technique Using League Championship Algorithm for Makespan Minimization in IaaS Cloud.	CoRR	2015	DBLP BibTeX RDF
14	Frank Neumann 0001, Carsten Witt	On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling.	CoRR	2015	DBLP BibTeX RDF
14	Willy Quach, Julien Langou	A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling.	CoRR	2015	DBLP BibTeX RDF
14	Abey Kuruvilla, Giuseppe Paletta	Minimizing Makespan on Identical Parallel Machines.	Int. J. Oper. Res. Inf. Syst.	2015	DBLP DOI BibTeX RDF
14	Sana Abdollahpour, Javad Rezaeian	Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system.	Appl. Soft Comput.	2015	DBLP DOI BibTeX RDF
14	Muhammad Al-Salamah	Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes.	Appl. Soft Comput.	2015	DBLP DOI BibTeX RDF
14	Wenjie Wang 0005, Wooi-Boon Goh	A stochastic algorithm for makespan minimized multi-agent path planning in discrete space.	Appl. Soft Comput.	2015	DBLP DOI BibTeX RDF
14	Eva Vallada, Rubén Ruiz, Jose M. Framiñan	New hard benchmark for flowshop scheduling problems minimising makespan.	Eur. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Christos Koulamas, George J. Kyparisis	The three-machine proportionate open shop and mixed shop minimum makespan problems.	Eur. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Yumei Huo, Hairong Zhao	Total completion time minimization on multiple machines subject to machine availability and makespan constraints.	Eur. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Wiebke von Hoyningen-Huene, Gudrun P. Kiesmüller	Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures.	Eur. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Jun Pei, Panos M. Pardalos, Xinbao Liu, Wenjuan Fan, Shanlin Yang	Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan.	Eur. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Zhao-Hong Jia, Joseph Y.-T. Leung	A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes.	Eur. J. Oper. Res.	2015	DBLP DOI BibTeX RDF