Search results for "Makespan"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Shu-Xia Zhang, Zhigang Cao, Yu-Zhong Zhang	Scheduling with Discretely Compressible Release dates to minimize makespan.	Asia Pac. J. Oper. Res.	2010	DBLP DOI BibTeX RDF
14	Lin Lin, Yixun Lin, Xianwei Zhou, Ruyan Fu	Parallel Machine Scheduling with a Simultaneity Constraint and Unit-Length Jobs to minimize the makespan.	Asia Pac. J. Oper. Res.	2010	DBLP DOI BibTeX RDF
14	Ruyan Fu, T. C. Edwin Cheng, C. T. Ng 0001, Jinjiang Yuan	Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
14	Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo	A note on makespan minimization in proportionate flow shops.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
14	Hao Shao, Huaping Chen 0001	Minimising makespan for single burn-in oven scheduling problems using ACO+DP approach.	Int. J. Manuf. Res.	2010	DBLP DOI BibTeX RDF
14	Giampiero Chiaselotti, Maria Italia Gualtieri, Paolamaria Pietramala	Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem.	J. Math. Model. Algorithms	2010	DBLP DOI BibTeX RDF
14	Fardin Ahmadizar, Mehdi Ghazanfari, Seyyed M. T. Fatemi Ghomi	Group shops scheduling with makespan criterion subject to random release dates and processing times.	Comput. Oper. Res.	2010	DBLP DOI BibTeX RDF
14	N. Rafiee Parsa, Behrooz Karimi, Ali Husseinzadeh Kashan	A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes.	Comput. Oper. Res.	2010	DBLP DOI BibTeX RDF
14	Salleh Ahmad Bareduan, Sulaiman Hasan	Makespan Algorithms and Heuristic for Internet-Based Collaborative Manufacturing Process Using Bottleneck Approach.	J. Softw. Eng. Appl.	2010	DBLP DOI BibTeX RDF
14	D. Bai, Lixin Tang	New heuristics for flow shop problem to minimize makespan.	J. Oper. Res. Soc.	2010	DBLP DOI BibTeX RDF
14	Gopalakrishnan Easwaran, Larry E. Parten, Rafael Moras, Paul X. Uhlig	Makespan minimization in machine dominated flowshop.	Appl. Math. Comput.	2010	DBLP DOI BibTeX RDF
14	Chou-Jung Hsu, Chinyao Low, Chwen-Tzeng Su	A single-machine scheduling problem with maintenance activities to minimize makespan.	Appl. Math. Comput.	2010	DBLP DOI BibTeX RDF
14	Huaping Chen 0001, Bing Du, George Q. Huang	Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals.	Int. J. Comput. Integr. Manuf.	2010	DBLP DOI BibTeX RDF
14	Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo	Makespan minimization in online scheduling with machine eligibility.	4OR	2010	DBLP DOI BibTeX RDF
14	Shenpeng Lu, Haodi Feng, Xiuqian Li	Minimizing the makespan on a single parallel batching machine.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
14	Jean-Paul Arnaout, Ghaith Rabadi, Rami Musa	A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times.	J. Intell. Manuf.	2010	DBLP DOI BibTeX RDF
14	Yuval Cohen, Ofer Zwikael	A New Technique for Estimating the Distribution of a Stochastic Project Makespan.	Int. J. Inf. Technol. Proj. Manag.	2010	DBLP DOI BibTeX RDF
14	Hongyang Sun 0001, Yuxiong He, Wen-Jing Hsu	Energy-Efficient Multiprocessor Scheduling for Flow Time and Makespan	CoRR	2010	DBLP BibTeX RDF
14	Alix Munier Kordon, Djamal Rebaine	The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan.	Eur. J. Oper. Res.	2010	DBLP DOI BibTeX RDF
14	Min Ji 0001, T. C. Edwin Cheng	Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan.	Eur. J. Oper. Res.	2010	DBLP DOI BibTeX RDF
14	B. Naderi 0001, Reza Tavakkoli-Moghaddam, M. Khalili	Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan.	Knowl. Based Syst.	2010	DBLP DOI BibTeX RDF
14	Mohammad Reza Bonyadi, Hossein Rahmani, Mohsen Ebrahimi Moghaddam	A genetic based disk scheduling method to decrease makespan and missed tasks.	Inf. Syst.	2010	DBLP DOI BibTeX RDF
14	Yazid Mati	Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability.	Comput. Ind. Eng.	2010	DBLP DOI BibTeX RDF
14	Chin-Chia Wu, Chin-Liang Liu	Minimizing the makespan on a single machine with learning and unequal release times.	Comput. Ind. Eng.	2010	DBLP DOI BibTeX RDF
14	Min Ji 0001, T. C. Edwin Cheng	Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan.	Comput. Ind. Eng.	2010	DBLP DOI BibTeX RDF
14	Feng Chu 0001, Chengbin Chu, Caroline Desprez	Series production in a basic re-entrant shop to minimize makespan or total flow time.	Comput. Ind. Eng.	2010	DBLP DOI BibTeX RDF
14	Dariusz Dereniowski, Wieslaw Kubiak	Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines.	J. Sched.	2010	DBLP DOI BibTeX RDF
14	Panneerselvam Sivasankaran, Thambu Sornakumar, Ramasamy Panneerselvam	Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines.	Intell. Inf. Manag.	2010	DBLP DOI BibTeX RDF
14	Panneerselvam Sivasankaran, Thambu Sornakumar, Ramasamy Panneerselvam	Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines.	Intell. Inf. Manag.	2010	DBLP DOI BibTeX RDF
14	Shisheng Li, Jinjiang Yuan	Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan.	J. Comb. Optim.	2010	DBLP DOI BibTeX RDF
14	Fardin Ahmadizar, Farnaz Barzinpour	A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem.	Int. J. Comput. Intell. Syst.	2010	DBLP DOI BibTeX RDF
14	Nahed El Desouky, Bayoumi Hassan, Afaf Abd El-hafiz	A New Technique to Improve the Makespan in Computational Grids.	GCA	2010	DBLP BibTeX RDF
14	Imed Kacem	New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval.	CTW	2010	DBLP BibTeX RDF
14	Mohand-Said Mezmaz, Young Choon Lee, Nouredine Melab, El-Ghazali Talbi, Albert Y. Zomaya	A bi-objective hybrid genetic algorithm to minimize energy consumption and makespan for precedence-constrained applications using dynamic voltage scaling.	IEEE Congress on Evolutionary Computation	2010	DBLP DOI BibTeX RDF
14	Nathan P. Johnson, James H. Graham	Predicting Makespan with Latin Square Replication on Computational Grids.	CATA	2010	DBLP BibTeX RDF
14	Haibo Tang, Chunming Ye	A plant growth simulation algorithm for permutation flow shop scheduling to minimize makespan.	ICNC	2010	DBLP DOI BibTeX RDF
14	Tadeusz Witkowski, Pawel Antczak, Arkadiusz Antczak	Evaluation influence of routing flexibility to makespan in FJSP with SA and GRASP algorithm.	ICNC	2010	DBLP DOI BibTeX RDF
14	Reza Entezari-Maleki, Ali Movaghar 0001	A Genetic-Based Scheduling Algorithm to Minimize the Makespan of the Grid Applications.	FGIT-GDC/CA	2010	DBLP DOI BibTeX RDF
14	Henri Casanova, Frédéric Desprez, Frédéric Suter	Minimizing Stretch and Makespan of Multiple Parallel Task Graphs via Malleable Allocations.	ICPP	2010	DBLP DOI BibTeX RDF
14	Mohand-Said Mezmaz, Yacine Kessaci, Young Choon Lee, Nouredine Melab, El-Ghazali Talbi, Albert Y. Zomaya, Daniel Tuyttens	A parallel island-based hybrid genetic algorithm for precedence-constrained applications to minimize energy consumption and makespan.	GRID	2010	DBLP DOI BibTeX RDF
14	Javad Navaei, Ashkan Mozdgir, Hooman Hidaji	Two-stage Assembly Flowshop Scheduling Problem With Bi-objective of Number of Tardy and Makespan Minimization.	IC-AI	2010	DBLP BibTeX RDF
14	Ming Liu 0008, Chengbin Chu, Yinfeng Xu, Lu Wang	Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint.	AAIM	2010	DBLP DOI BibTeX RDF
14	Guosheng Ding, Shijie Sun	Single-Machine Scheduling Problems with Two Agents Competing for Makespan.	LSMS/ICSEE (1)	2010	DBLP DOI BibTeX RDF
14	Pei-Chann Chang, Jih-Chang Hsieh, Shih-Hsin Chen, Jun-Lin Lin, Wei-Hsiu Huang	Artificial chromosomes embedded in genetic algorithm for a chip resistor scheduling problem in minimizing the makespan.	Expert Syst. Appl.	2009	DBLP DOI BibTeX RDF
14	Li-Ya Tseng, Yeh-Hao Chin, Shu-Ching Wang	A minimized makespan scheduler with multiple factors for Grid computing systems.	Expert Syst. Appl.	2009	DBLP DOI BibTeX RDF
14	Sang-Seon Byun, Chuck Yoo	Locating repair servers in hierarchical reliable multicast networks to reduce the makespan.	Int. J. Commun. Syst.	2009	DBLP DOI BibTeX RDF
14	Gerhard J. Woeginger	A comment on parallel-machine scheduling under a grade of service provision to minimize makespan.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
14	Cheng He, Yixun Lin, Jinjiang Yuan	A DP algorithm for minimizing makespan and total completion time on a series-batching machine.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
14	Ji Tian, T. C. Edwin Cheng, C. T. Ng 0001, Jinjiang Yuan	Online scheduling on unbounded parallel-batch machines to minimize the makespan.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
14	Fawaz S. Al-Anzi, Ali Allahverdi	Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	G. I. Zobolas, Christos D. Tarantilis, George Ioannou	Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Olga Guschinskaya, Alexandre Dolgui, Nikolai Guschinsky, Genrikh Levin	Minimizing makespan for multi-spindle head machines with a mobile table.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Dehua Xu, Zhenmin Cheng, Yunqiang Yin, Hongxing Li	Makespan minimization for two parallel machines scheduling with a periodic availability constraint.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Feng Chen 0020, Kailei Song	Minimizing makespan in two-stage hybrid cross docking scheduling problem.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Rubén Ruiz, Ali Allahverdi	Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Chun-Lung Chen, Chuen-Lung Chen	A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Peng-Jen Lai, Hsien-Chung Wu	Using Ant Colony Optimization to minimize the Fuzzy makespan and Total Weighted Fuzzy Completion Time in Flow Shop Scheduling Problems.	Int. J. Uncertain. Fuzziness Knowl. Based Syst.	2009	DBLP DOI BibTeX RDF
14	Qun Niu, Taijin Zhou, Shiwei Ma	A Quantum-Inspired Immune Algorithm for Hybrid Flow Shop with Makespan Criterion.	J. Univers. Comput. Sci.	2009	DBLP DOI BibTeX RDF
14	R. Rajkumar, P. Shahabudeen	Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs.	Int. J. Comput. Integr. Manuf.	2009	DBLP DOI BibTeX RDF
14	Ali Husseinzadeh Kashan, Behrooz Karimi, S. M. T. Fatemi Ghomi	A note on minimizing makespan on a single batch processing machine with nonidentical job sizes.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
14	Ming Liu 0008, Yinfeng Xu, Chengbin Chu, Feifeng Zheng	Online scheduling on two uniform machines to minimize the makespan.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
14	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	Envy-Free Makespan Approximation	CoRR	2009	DBLP BibTeX RDF
14	Feng Chen, Chung-Yee Lee	Minimizing the makespan in a two-machine cross-docking flow shop problem.	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Dehua Xu, Yunqiang Yin, Hongxing Li	A note on "scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan".	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Jie Zhu 0002, Xiaoping Li 0001, Qian Wang 0011	Complete local search with limited memory algorithm for no-wait job shops to minimize makespan.	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Xiuli Wang, T. C. Edwin Cheng	Production scheduling with supply and delivery considerations to minimize the makespan.	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Daniel Baraz, Gur Mosheiov	Erratum to "A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time" [European Journal of Operational Research, 184 (2) (2008), 810-813].	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Christos Koulamas, George J. Kyparisis	A modified LPT algorithm for the two uniform parallel machine makespan minimization problem.	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín	A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
14	Bin Fu, Yumei Huo, Hairong Zhao	Makespan Minimization with Machine Availability Constraints.	Discret. Math. Algorithms Appl.	2009	DBLP DOI BibTeX RDF
14	Vahid Roshanaei, B. Naderi 0001, Fariborz Jolai, M. Khalili	A variable neighborhood search for job shop scheduling with set-up times to minimize makespan.	Future Gener. Comput. Syst.	2009	DBLP DOI BibTeX RDF
14	Lixin Tang, Peng Liu 0004	Minimizing makespan in a two-machine flowshop scheduling with batching and release time.	Math. Comput. Model.	2009	DBLP DOI BibTeX RDF
14	Adam Janiak, Wladyslaw A. Janiak, Radoslaw Rudek, Agnieszka Wielgus	Solution algorithms for the makespan minimization problem with the general learning model.	Comput. Ind. Eng.	2009	DBLP DOI BibTeX RDF
14	Lucio Bianco, Massimiliano Caramia	An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations.	CTW	2009	DBLP BibTeX RDF
14	Liya Fan, Fa Zhang 0001, Gongming Wang, Zhiyong Liu 0002	An effective scheduling algorithm for Linear Makespan Minimization on Unrelated Parallel Machines.	HiPC	2009	DBLP DOI BibTeX RDF
14	Fatma Hermès, Jacques Carlier, Aziz Moukrim, Khaled Ghédira	Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time.	ICINCO-ICSO	2009	DBLP BibTeX RDF
14	Yuzhong Zhang, Jianfeng Ren, Chengfei Wang	Scheduling with Rejection to Minimize the Makespan.	COCOA	2009	DBLP DOI BibTeX RDF	scheduling with rejection, worst case performance ratio, Approximation algorithm, dynamic programming
14	Saeid Safaei, Babak Dalvand, Zahra Derakhshandeh, Vahid Safaei	Molecular Solutions for the Bin-packing and Minimum Makespan Scheduling Problems on DNA-based Supercomputing.	PDPTA	2009	DBLP BibTeX RDF
14	Haodi Feng, Hong Liu 0001	Minimizing Makespan on an Unbounded Parallel Batch Processor with Rejection and Release Times.	CSIE (2)	2009	DBLP DOI BibTeX RDF
14	Yundong Mu, Xiao Guo	On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption.	SSME	2009	DBLP DOI BibTeX RDF
14	Maxim Sviridenko	Minimum Makespan on Unrelated Machines.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
14	Lingfa Lu, Jinjiang Yuan	Single Machine Scheduling with Job Delivery to minimize makespan.	Asia Pac. J. Oper. Res.	2008	DBLP DOI BibTeX RDF
14	Yvonne Bleischwitz, Florian Schoppmann	New efficiency results for makespan cost sharing.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
14	Min Ji 0001, T. C. Edwin Cheng	An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
14	Seong-Woo Choi, Yeong-Dae Kim	Minimizing makespan on an m-machine re-entrant flowshop.	Comput. Oper. Res.	2008	DBLP DOI BibTeX RDF
14	Dehua Xu, Kaibiao Sun, Hongxing Li	Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan.	Comput. Oper. Res.	2008	DBLP DOI BibTeX RDF
14	Ching-Fang Liaw	An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops.	Comput. Oper. Res.	2008	DBLP DOI BibTeX RDF
14	Pawel Jan Kalczynski, Jerzy Kamburowski	An improved NEH heuristic to minimize makespan in permutation flow shops.	Comput. Oper. Res.	2008	DBLP DOI BibTeX RDF
14	René de Koster, Mengfei Yu	Minimizing makespan and throughput times at Aalsmeer flower auction.	J. Oper. Res. Soc.	2008	DBLP DOI BibTeX RDF
14	Wen-Hung Kuo, Dar-Li Yang	Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect.	J. Oper. Res. Soc.	2008	DBLP DOI BibTeX RDF
14	Jose M. Framiñan, Rainer Leisten	A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria.	OR Spectr.	2008	DBLP DOI BibTeX RDF
14	Chinyao Low, Chou-Jung Hsu, Chwen-Tzeng Su	Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration.	Comput. Math. Appl.	2008	DBLP DOI BibTeX RDF
14	Lingfa Lu, Jinjiang Yuan, Liqi Zhang	Single machine scheduling with release dates and job delivery to minimize the makespan.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
14	Lingfa Lu, Liqi Zhang, Jinjiang Yuan	The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
14	Janina A. Brenner, Guido Schäfer	Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
14	Q. Q. Nong, C. T. Ng 0001, T. C. Edwin Cheng	The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan.	Oper. Res. Lett.	2008	DBLP DOI BibTeX RDF
14	Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He	On-line scheduling on a batch machine to minimize makespan with limited restarts.	Oper. Res. Lett.	2008	DBLP DOI BibTeX RDF
14	Lingfa Lu, Jinjiang Yuan	Unbounded parallel batch scheduling with job delivery to minimize makespan.	Oper. Res. Lett.	2008	DBLP DOI BibTeX RDF
14	Nihat Kasap, Haldun Aytug, Anand A. Paul	Erratum to "Minimizing makespan on a single machine subject to random breakdowns": [Oper. Res. Letters 34 (2006) 29-36].	Oper. Res. Lett.	2008	DBLP DOI BibTeX RDF
14	Leah Epstein, Arik Ganot	Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Scheduling, Load balancing, Online algorithms, Resource augmentation