Search results for "Makespan"

Hits ?▲	Authors	Title	Venue	Year	Link
14	Bin Han, Wenjun Chris Zhang, Xiwen Lu, Yingzi Lin	On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost.	Eur. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
14	Mateusz Gorczyca, Adam Janiak, Wladyslaw A. Janiak, Marcin Dymanski	Makespan optimization in a single-machine scheduling problem with dynamic job ready times - Complexity and algorithms.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
14	Qiang Gao, Ganggang Li, Xiwen Lu	Online and semi-online scheduling to minimize makespan on single machine with an availability constraint.	Discret. Math. Algorithms Appl.	2015	DBLP DOI BibTeX RDF
14	Cheng He, Hao Lin, Yixun Lin	Bounded serial-batching scheduling for minimizing maximum lateness and makespan.	Discret. Optim.	2015	DBLP DOI BibTeX RDF
14	Juan José Palacios 0001, Inés González Rodríguez, Camino R. Vela, Jorge Puente 0001	Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop.	Fuzzy Sets Syst.	2015	DBLP DOI BibTeX RDF
14	Ricardo Lent	Grid Scheduling with Makespan and Energy-Based Goals.	J. Grid Comput.	2015	DBLP DOI BibTeX RDF
14	Ching-Jong Liao, Cheng-Hsiung Lee, Hong-Chieh Lee	An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan.	Comput. Ind. Eng.	2015	DBLP DOI BibTeX RDF
14	Jin Young Choi 0003	Minimizing total weighted completion time under makespan constraint for two-agent scheduling with job-dependent aging effects.	Comput. Ind. Eng.	2015	DBLP DOI BibTeX RDF
14	Stefan Creemers	Minimizing the expected makespan of a project with stochastic activity durations under resource constraints.	J. Sched.	2015	DBLP DOI BibTeX RDF
14	P. Sethu Ramalingam, K. Chandrasekar, M. Victor Raj	GA approach to optimise material flow and makespan in an AGV-based flexible jobshop manufacturing system.	Int. J. Comput. Aided Eng. Technol.	2015	DBLP DOI BibTeX RDF
14	Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li 0001	On (1, ∊)-Restricted Assignment Makespan Minimization.	SODA	2015	DBLP DOI BibTeX RDF
14	Yuqing Yang, Xinqiao Lu, Hai Jin 0001, Xiaofei Liao	A Stochastic Task Scheduling Algorithm Based on Importance-ratio of Makespan to Energy for Heterogeneous Parallel Systems.	HPCC/CSS/ICESS	2015	DBLP DOI BibTeX RDF
14	Hyun-Jung Kim, Jun-Ho Lee	Makespan computation of lot switching period in single-armed cluster tools.	WSC	2015	DBLP DOI BibTeX RDF
14	Patrick MacAlpine, Eric Price 0001, Peter Stone	SCRAM: Scalable Collision-avoiding Role Assignment with Minimal-Makespan for Formational Positioning.	AAAI	2015	DBLP DOI BibTeX RDF
14	Mohammad Shojafar, Maryam Kardgar, Ali Asghar Rahmani Hosseinabadi, Shahab Shamshirband, Ajith Abraham	TETS: A Genetic-Based Scheduler in Cloud Computing to Decrease Energy and Makespan.	HIS	2015	DBLP DOI BibTeX RDF
14	Hiroyuki Goto, Hajime Yokoyama	Minimization of the Makespan a Project in the Critical Chain Project Management Framework Using a Max-Plus Linear Representation.	IEEM	2015	DBLP DOI BibTeX RDF
14	Michele Lombardi 0001, Alessio Bonfietti, Michela Milano	Deterministic Estimation of the Expected Makespan of a POS Under Duration Uncertainty.	CP	2015	DBLP DOI BibTeX RDF
14	Jérôme Dohrau	Online Makespan Scheduling with Sublinear Advice.	SOFSEM	2015	DBLP DOI BibTeX RDF
14	Frank Neumann 0001, Carsten Witt	On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling.	IJCAI	2015	DBLP BibTeX RDF
14	Saeeda Usman, Kashif Bilal, Nasir Ghani, Samee U. Khan, Laurence T. Yang	Thermal-aware, power efficient, and makespan realized Pareto front for cloud scheduler.	LCN Workshops	2015	DBLP DOI BibTeX RDF
14	Carlos C. M. Tuma	Uma estrutura de vizinhança baseada em árvore de cobertura aplicada em uma colaboração de algoritmo genético e VNS para a minimização de makespan em problemas de programação reativa da produção.		2015	RDF
14	Cheng He, Hao Lin, Jinjiang Yuan, Yundong Mu	Batching Machine Scheduling with bicriteria: Maximum Cost and makespan.	Asia Pac. J. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Rafal Rózycki, Jan Weglarz	Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan.	Ann. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Navid Hashemian, Claver Diallo, Béla Vizvári	Makespan minimization for parallel machines scheduling with multiple availability constraints.	Ann. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Wendi Tian, Erik Demeulemeester	Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment.	Ann. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Jörg Rambau, Cornelius Schwarz	Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing.	Optim. Methods Softw.	2014	DBLP DOI BibTeX RDF
14	Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li	Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan.	Inf. Process. Lett.	2014	DBLP DOI BibTeX RDF
14	Wei-Chang Yeh, Peng-Jen Lai, Wen-Chiung Lee, Mei-Chi Chuang	Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects.	Inf. Sci.	2014	DBLP DOI BibTeX RDF
14	Zhao-Hong Jia, Joseph Y.-T. Leung	An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes.	Comput. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Ghasem Moslehi, Danial Khorasanian	A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion.	Comput. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Peihai Liu, Xiwen Lu	A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan.	Comput. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Radoslaw Rudek	Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning.	J. Oper. Res. Soc.	2014	DBLP DOI BibTeX RDF
14	Krishnamoorthy Natarajan, Ramasamy Asokan, Sangeetha Subramanian	Quantitative Evaluation of Job and Resources for Better Selection to Improve makespan in Grid Scheduling.	J. Comput. Sci.	2014	DBLP DOI BibTeX RDF
14	Shiv Prakash, Deo Prakash Vidyarthi	A Hybrid GABFO Scheduling for Optimal Makespan in Computational Grid.	Int. J. Appl. Evol. Comput.	2014	DBLP DOI BibTeX RDF
14	L. L. Liu, C. T. Ng 0001, T. C. E. Cheng	Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan.	Optim. Lett.	2014	DBLP DOI BibTeX RDF
14	Evgeny R. Gafarov, Alexandre Dolgui	Two-dedicated-machine scheduling problem with precedence relations to minimize makespan.	Optim. Lett.	2014	DBLP DOI BibTeX RDF
14	Hongyang Sun 0001, Yuxiong He, Wen-Jing Hsu, Rui Fan 0004	Energy-efficient multiprocessor scheduling for flow time and makespan.	Theor. Comput. Sci.	2014	DBLP DOI BibTeX RDF
14	Alix Munier Kordon, Djamal Rebaine	The coupled unit-time operations problem on identical parallel machines with respect to the makespan.	Oper. Res. Lett.	2014	DBLP DOI BibTeX RDF
14	Jean-Paul Arnaout, Rami Musa, Ghaith Rabadi	A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines - part II: enhancements and experimentations.	J. Intell. Manuf.	2014	DBLP DOI BibTeX RDF
14	Thomas Carle, Dumitru Potop-Butucaru	Predicate-aware, makespan-preserving software pipelining of scheduling tables.	ACM Trans. Archit. Code Optim.	2014	DBLP DOI BibTeX RDF
14	Ömür Tosun	Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion.	Int. J. Math. Model. Numer. Optimisation	2014	DBLP DOI BibTeX RDF
14	Dor Arad, Yael Mordechai, Hadas Shachnai	Tighter Bounds for Makespan Minimization on Unrelated Machines.	CoRR	2014	DBLP BibTeX RDF
14	Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li 0001	On $(1, ε)$-Restricted Assignment Makespan Minimization.	CoRR	2014	DBLP BibTeX RDF
14	M. Rathna Devi, A. Anju	Multiprocessor Scheduling of Dependent Tasks to Minimize Makespan and Reliability Cost Using NSGA-II.	CoRR	2014	DBLP BibTeX RDF
14	Nikolai Krivulin	A tropical optimization problem with application to project scheduling with minimum makespan.	CoRR	2014	DBLP BibTeX RDF
14	Jianyou Xu, Yunqiang Yin, T. C. E. Cheng, Chin-Chia Wu, Shusheng Gu	A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan.	Appl. Soft Comput.	2014	DBLP DOI BibTeX RDF
14	Chung-Cheng Jason Lu, Shih-Wei Lin, Kuo-Ching Ying	Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times.	Appl. Soft Comput.	2014	DBLP DOI BibTeX RDF
14	M. K. Marichelvam, Thirumoorthy Prabaharan, Xin-She Yang 0001	Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan.	Appl. Soft Comput.	2014	DBLP DOI BibTeX RDF
14	Onur Ozturk, Mehmet A. Begen, Gregory S. Zaric	A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services.	Eur. J. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	S. S. Panwalkar, Christos Koulamas	The two-machine no-wait general and proportionate open shop makespan problem.	Eur. J. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Ali Allahverdi, Harun Aydilek	Total completion time with makespan constraint in no-wait flowshops with setup times.	Eur. J. Oper. Res.	2014	DBLP DOI BibTeX RDF
14	Ning Ding, Yan Lan, Xin Chen 0032, György Dósa, He Guo 0001, Xin Han	Online Minimum makespan Scheduling with a Buffer.	Int. J. Found. Comput. Sci.	2014	DBLP DOI BibTeX RDF
14	Michael Masin, Tal Raviv	Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem.	J. Sched.	2014	DBLP DOI BibTeX RDF
14	Zhixin Liu 0004, Young K. Ro	Rescheduling for machine disruption to minimize makespan and maximum lateness.	J. Sched.	2014	DBLP DOI BibTeX RDF
14	Xianyu Yu, Yulin Zhang, George Steiner	Single-machine scheduling with periodic maintenance to minimize makespan revisited.	J. Sched.	2014	DBLP DOI BibTeX RDF
14	Wenhong Tian, Yu Chen, Xinyang Wang	A Note on "Orchestrating an Ensemble of MapReduce Jobs for Minimizing Their Makespan".	IEEE Trans. Dependable Secur. Comput.	2014	DBLP DOI BibTeX RDF
14	Matthias Englert, Deniz Özmen, Matthias Westermann	The Power of Reordering for Online Minimum Makespan Scheduling.	SIAM J. Comput.	2014	DBLP DOI BibTeX RDF
14	Xiaoyong Yuan, Ying Li 0012, Yanqi Wang, Kewei Sun	Scheduling Cloud Platform Managed Live-Migration Operations to Minimize the Makespan.	NPC	2014	DBLP DOI BibTeX RDF
14	Artjom Grudnitsky, Lars Bauer, Jörg Henkel	MORP: makespan optimization for processors with an embedded reconfigurable fabric.	FPGA	2014	DBLP DOI BibTeX RDF
14	Jianya Ding, Shiji Song, Rui Zhang 0039, Cheng Wu	Minimizing makespan for a no-wait flowshop using tabu mechanism improved iterated greedy algorithm.	IEEE Congress on Evolutionary Computation	2014	DBLP DOI BibTeX RDF
14	Amal Soufi, Anis Mjirda, Mourad Abed	Heuristic approch for solving the makespan problem in a hospital sterilization service.	ICALT	2014	DBLP DOI BibTeX RDF
14	Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ling Wang 0001	An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion.	CIPLS	2014	DBLP DOI BibTeX RDF
14	Shao-Feng Chen, Bin Qian 0001, Rong Hu, Zuo-Cheng Li	An Enhanced Estimation of Distribution Algorithm for No-Wait Job Shop Scheduling Problem with Makespan Criterion.	ICIC (2)	2014	DBLP DOI BibTeX RDF
14	Yuqing Zhu 0002, Yiwei Jiang, Weili Wu 0001, Ling Ding, Ankur Teredesai, Deying Li 0001, Wonjun Lee 0001	Minimizing makespan and total completion time in MapReduce-like systems.	INFOCOM	2014	DBLP DOI BibTeX RDF
14	Andre Serra e Santos, Ana Maria Madureira, Maria Leonilde R. Varela	An ordered approach to Minimum Completion Time in unrelated parallel-machines for the makespan optimization.	NaBIC	2014	DBLP DOI BibTeX RDF
14	Adel Kacem, Abdelaziz Dammak	A genetic algorithm to minimize the makespan on two dedicated processors.	CoDIT	2014	DBLP DOI BibTeX RDF
14	Susanne Albers, Matthias Hellwig	Online Makespan Minimization with Parallel Schedules.	SWAT	2014	DBLP DOI BibTeX RDF
14	Adam Kurpisz	Approximation Schemes for Robust Makespan Scheduling Problems.	OR	2014	DBLP DOI BibTeX RDF
14	Simon Parkinson, Peter Gregory, Andrew Peter Longstaff, Andrew Crampton	Automated Planning for Multi-Objective Machine Tool Calibration: Optimising Makespan and Measurement Uncertainty.	ICAPS	2014	DBLP BibTeX RDF
14	Yumei Huo	Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints.	AAIM	2014	DBLP DOI BibTeX RDF
14	Patrick MacAlpine, Eric Price 0001, Peter Stone	SCRAM: scalable collision-avoiding role assignment with minimal-makespan for formational positioning.	AAMAS	2014	DBLP BibTeX RDF
14	Ji-Bo Wang, Ming-Zheng Wang	Makespan Minimization on Three-Machine Flow shop with deteriorating jobs.	Asia Pac. J. Oper. Res.	2013	DBLP DOI BibTeX RDF
14	Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo	Makespan minimization in online scheduling with machine eligibility.	Ann. Oper. Res.	2013	DBLP DOI BibTeX RDF
14	Hongyang Sun 0001, Rui Fan	Improved semi-online makespan scheduling with a reordering buffer.	Inf. Process. Lett.	2013	DBLP DOI BibTeX RDF
14	Stavros G. Kolliopoulos, Yannis Moysoglou	The 2-valued case of makespan minimization with assignment constraints.	Inf. Process. Lett.	2013	DBLP DOI BibTeX RDF
14	Cheng He, Hao Lin, Yixun Lin, Ji Tian	Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan.	Central Eur. J. Oper. Res.	2013	DBLP DOI BibTeX RDF
14	Ji-Bo Wang, Ming-Zheng Wang	Minimizing makespan in three-machine flow shops with deteriorating jobs.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
14	Min Ji 0001, Jen-Ya Wang, Wen-Chiung Lee	Minimizing resource consumption on uniform parallel machines with a bound on makespan.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
14	Agnieszka Rudek, Radoslaw Rudek	Makespan minimization flowshop with position dependent job processing times - computational complexity and solution algorithms.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
14	Shih-Wei Lin, Kuo-Ching Ying	Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
14	Alex J. Ruiz-Torres, Giuseppe Paletta, Eduardo Pérez-Roman	Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
14	Marin Bougeret, Pierre-François Dutot, Denis Trystram	Moderately exponential approximation for makespan minimization on related machines.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
14	Ruyan Fu, T. C. E. Cheng, C. T. Ng 0001, Jinjiang Yuan	An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.	Oper. Res. Lett.	2013	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 Flow-Time.	CoRR	2013	DBLP BibTeX RDF
14	Susanne Albers, Matthias Hellwig	Online Makespan Minimization with Parallel Schedules	CoRR	2013	DBLP BibTeX RDF
14	Nicole Megow, Andreas Wiese	Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model	CoRR	2013	DBLP BibTeX RDF
14	T. C. Wong 0001, Shing-Chung Ngan	A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize makespan for assembly job shop.	Appl. Soft Comput.	2013	DBLP DOI BibTeX RDF
14	Manuel López-Ibáñez 0001, Christian Blum 0001, Jeffrey W. Ohlmann, Barrett W. Thomas	The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization.	Appl. Soft Comput.	2013	DBLP DOI BibTeX RDF
14	Christophe Rapine, Nadia Brauner	A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times.	Discret. Optim.	2013	DBLP DOI BibTeX RDF
14	Donald Davendra, Ivan Zelinka, Magdalena Bialic-Davendra, Roman Senkerik, Roman Jasek	Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan.	Math. Comput. Model.	2013	DBLP DOI BibTeX RDF
14	Qiulan Zhao, Jinjiang Yuan	Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption.	J. Sched.	2013	DBLP DOI BibTeX RDF
14	Lukasz Jez, Jarett Schwartz, Jirí Sgall, József Békési	Lower bounds for online makespan minimization on a small number of related machines.	J. Sched.	2013	DBLP DOI BibTeX RDF
14	Abhishek Verma, Ludmila Cherkasova, Roy H. Campbell	Orchestrating an Ensemble of MapReduce Jobs for Minimizing Their Makespan.	IEEE Trans. Dependable Secur. Comput.	2013	DBLP DOI BibTeX RDF
14	Byung-Cheon Choi, Kangbok Lee	Two-stage proportionate flexible flow shop to minimize the makespan.	J. Comb. Optim.	2013	DBLP DOI BibTeX RDF
14	Pan Lai, Rui Fan	Makespan-Optimal Cache Partitioning.	MASCOTS	2013	DBLP DOI BibTeX RDF
14	Sheng Zhang 0001, Jie Wu 0001, Sanglu Lu	Minimum makespan workload dissemination in DTNs: making full utilization of computational surplus around.	MobiHoc	2013	DBLP DOI BibTeX RDF
14	Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder	Minimum Makespan Scheduling with Low Rank Processing Times.	SODA	2013	DBLP DOI BibTeX RDF
14	Kyle M. Tarplee, Ryan D. Friese, Anthony A. Maciejewski, Howard Jay Siegel	Efficient and Scalable Computation of the Energy and Makespan Pareto Front for Heterogeneous Computing Systems.	FedCSIS	2013	DBLP BibTeX RDF
14	Kyle M. Tarplee, Ryan D. Friese, Anthony A. Maciejewski, Howard Jay Siegel	Efficient and Scalable Pareto Front Generation for Energy and Makespan in Heterogeneous Computing Systems.	WCO@FedCSIS	2013	DBLP DOI BibTeX RDF
14	Yi Yao, Jiayin Wang, Bo Sheng, Ningfang Mi	Using a Tunable Knob for Reducing Makespan of MapReduce Jobs in a Hadoop Cluster.	IEEE CLOUD	2013	DBLP DOI BibTeX RDF