Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
14 | Jingying Huang, Liya Wang, Zhibin Jiang |
A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Prod. Res. ![In: Int. J. Prod. Res. 58(13), pp. 4086-4102, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Vaneet Aggarwal, Ruijiu Mao |
Preemptive scheduling for approximate computing on heterogeneous machines: Tradeoff between weighted accuracy and makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 153, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Muberra Allahverdi, Ali Allahverdi |
Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 54(2), pp. 529-553, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Harendra Kumar, Shailendra Giri |
Optimisation of makespan of a flow shop problem using multi layer neural network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Sci. Math. ![In: Int. J. Comput. Sci. Math. 11(2), pp. 107-122, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Pengwei Wang 0001, Yinghui Lei, Promise Ricardo Agbedanu, Zhaohui Zhang |
Makespan-Driven Workflow Scheduling in Clouds Using Immune-Based PSO Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 8, pp. 29281-29290, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Guanqun Ni, Lei Chen |
Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 8, pp. 186805-186812, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Yanming Fu, Zhuohang Li, Ningjiang Chen, Chiwen Qu |
A Discrete Multi-Objective Rider Optimization Algorithm for Hybrid Flowshop Scheduling Problem Considering Makespan, Noise and Dust Pollution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 8, pp. 88527-88546, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Zigao Wu, Shudong Sun, Shaohua Yu |
Optimizing makespan and stability risks in job shop scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 122, pp. 104963, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Sadiqi Assia, Ikram El Abbassi, Abdellah Elbarkany, Moumen Darcherif, Ahmed El Biyaali |
Green Scheduling of Jobs and Flexible Periods of Maintenance in a Two-Machine Flowshop to Minimize Makespan, a Measure of Service Level and Total Energy Consumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Oper. Res. ![In: Adv. Oper. Res. 2020, pp. 9732563:1-9732563:9, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | R. Vijayalakshmi, V. Vasudevan, Seifedine Nimer Kadry, R. Lakshmana Kumar |
Optimization of makespan and resource utilization in the fog computing environment through task scheduling algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Wavelets Multiresolution Inf. Process. ![In: Int. J. Wavelets Multiresolution Inf. Process. 18(1), pp. 1941025:1-1941025:12, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Ali Allahverdi, Harun Aydilek, Asiye Aydilek |
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 365, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Daniel R. Page, Roberto Solis-Oba |
Makespan minimization on unrelated parallel machines with a few bags. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 821, pp. 34-44, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Daniel R. Page, Roberto Solis-Oba, Marten Maack |
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 809, pp. 204-217, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Sven O. Krumke, Le Huy Minh |
Robust absolute single machine makespan scheduling-location problem on trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 48(1), pp. 29-32, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Oliver Bachtler, Sven O. Krumke, Le Huy Minh |
Robust single machine makespan scheduling with release date uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 48(6), pp. 816-819, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Guiliang Gong, Raymond Chiong, Qianwang Deng, Qiang Luo |
A memetic algorithm for multi-objective distributed production scheduling: minimizing the makespan and total energy consumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Manuf. ![In: J. Intell. Manuf. 31(6), pp. 1443-1466, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Xiumin Zhou, Gongxuan Zhang, Tian Wang, Mingyue Zhang, Xiji Wang, Wei Zhang |
Makespan-Cost-Reliability-Optimized Workflow Scheduling Using Evolutionary Techniques in Clouds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Circuits Syst. Comput. ![In: J. Circuits Syst. Comput. 29(10), pp. 2050167:1-2050167:21, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Jing Huang 0012, Renfa Li, Xun Jiao, Yu Jiang 0001, Wanli Chang 0001 |
Dynamic DAG Scheduling on Multiprocessor Systems: Reliability, Energy, and Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11), pp. 3336-3347, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Saeid Alirezazadeh, Luís A. Alexandre |
Improving Makespan in Dynamic Task Allocation for Cloud Robotic Systems with Time Window Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.03555, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Debasis Dwibedy, Rakesh Mohanty |
Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.04698, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Jan Dvorák, Martin Heller, Zdenek Hanzálek |
Makespan minimization of Time-Triggered traffic on a TTEthernet network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.16863, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Janardhan Kulkarni, Shi Li 0001, Jakub Tarnawski, Minwei Ye |
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.13891, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Anupam Gupta 0001, Amit Kumar 0001, Viswanath Nagarajan, Xiangkun Shen |
Stochastic Makespan Minimization in Structured Set Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.11153, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Ali Asghari, Mohammad Karim Sohrabi, Farzin Yaghmaee |
Online scheduling of dependent tasks of cloud's workflows to enhance resource utilization and reduce the makespan using multiple reinforcement learning-based agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 24(21), pp. 16177-16199, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Deniz Türsel Eliiyi, Liang Gao 0001 |
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Swarm Evol. Comput. ![In: Swarm Evol. Comput. 54, pp. 100660, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Klaus Jansen, Kim-Manuel Klein, José Verschae |
Closing the Gap for Makespan Scheduling via Sparsification Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 45(4), pp. 1371-1392, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Morteza Davari, Mohammad Ranjbar, Patrick De Causmaecker, Roel Leus |
Minimizing makespan on a single machine with release dates and inventory constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 286(1), pp. 115-128, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Tae-Sun Yu, Michael L. Pinedo |
Flow shops with reentry: Reversibility properties and makespan optimal schedules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 282(2), pp. 478-490, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Ibrahim Muter |
Exact algorithms to minimize makespan on single and parallel batch processing machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 285(2), pp. 470-483, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Victor Verdugo, José Verschae, Andreas Wiese |
Breaking symmetries to rescue sum of squares in the case of makespan scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 183(1), pp. 583-618, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Antonio Costa 0001, F. V. Cappadonna, Sergio Fichera |
Minimizing makespan in a Flow Shop Sequence Dependent Group Scheduling problem with blocking constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Appl. Artif. Intell. ![In: Eng. Appl. Artif. Intell. 89, pp. 103413, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Ansis Ozolins |
A new exact algorithm for no-wait job shop problem to minimize makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 20(4), pp. 2333-2363, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Paz Perez-Gonzalez, Victor Fernandez-Viagas, Jose M. Framiñan |
Permutation flowshop scheduling with periodic maintenance and makespan objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 143, pp. 106369, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Shijin Wang 0002, Ruochen Wu, Feng Chu 0001, Jianbo Yu, Xin Liu 0025 |
An improved formulation and efficient heuristics for the discrete parallel-machine makespan ScheLoc problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 140, pp. 106238, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Nir Halman |
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 23(6), pp. 643-648, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Cheng He, Chunqi Xu, Hao Lin |
Serial-batching scheduling with two agents to minimize makespan and maximum cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 23(5), pp. 609-617, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Christophe Sauvey, Nathalie Sauer |
Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 13(5), pp. 112, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Yuri N. Sotskov, Natalja M. Matsveichuk, Vadzim D. Hatsura |
Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 13(1), pp. 4, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Lisi Cao, Jianhong Hao, Dakui Jiang |
Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex. ![In: Complex. 2020, pp. 1647401:1-1647401:6, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Dawei Li, Xiwen Lu |
Two-machine flow shop scheduling with an operator non-availability period to minimize makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 39(4), pp. 1060-1078, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Jin Sun 0001, Lu Yin 0005, Minhui Zou, Yi Zhang 0025, Tianqi Zhang, Junlong Zhou |
Makespan-minimization workflow scheduling for complex networks with social groups in edge computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Syst. Archit. ![In: J. Syst. Archit. 108, pp. 101799, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Anupam Gupta 0001, Amit Kumar 0001, Viswanath Nagarajan, Xiangkun Shen |
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings, pp. 158-170, 2020, Springer, 978-3-030-45770-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Janardhan Kulkarni, Shi Li 0001, Jakub Tarnawski, Minwei Ye |
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 2770-2789, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Damla Yüksel, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan |
Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2020, Glasgow, United Kingdom, July 19-24, 2020, pp. 1-8, 2020, IEEE, 978-1-7281-6929-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Ali Al-Haboobi, Gabor Kecskemeti |
Improving Existing WMS for Reduced Makespan of Workflows with Lambda. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par Workshops ![In: Euro-Par 2020: Parallel Processing Workshops - Euro-Par 2020 International Workshops, Warsaw, Poland, August 24-25, 2020, Revised Selected Papers, pp. 261-272, 2020, Springer, 978-3-030-71592-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Olivier Beaumont, Julien Langou, Willy Quach, Alena Shilova |
A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2020: Parallel Processing - 26th International Conference on Parallel and Distributed Computing, Warsaw, Poland, August 24-28, 2020, Proceedings, pp. 134-150, 2020, Springer, 978-3-030-57674-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Angel A. Juan, Pedro Copado, Javier Panadero, Christoph Laroque, Rocio de la Torre |
A Discrete-Event Heuristic for Makespan Optimization in Multi-Server Flow-Shop Problems with Machine re-entering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Winter Simulation Conference, WSC 2020, Orlando, FL, USA, December 14-18, 2020, pp. 1492-1502, 2020, IEEE, 978-1-7281-9499-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Alexander V. Kononov, Yulia V. Kovalenko |
Makespan Minimization for Parallel Jobs with Energy Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MOTOR ![In: Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Novosibirsk, Russia, July 6-10, 2020, Proceedings, pp. 289-300, 2020, Springer, 978-3-030-49987-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Pascal Bercher, Conny Olz |
POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020., pp. 9785-9793, 2020, AAAI Press, 978-1-57735-823-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Monique Simplicio Viana, Orides Morandin Junior, Rodrigo Colnago Contreras |
Transgenic Genetic Algorithm to Minimize the Makespan in the Job Shop Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAART (2) ![In: Proceedings of the 12th International Conference on Agents and Artificial Intelligence, ICAART 2020, Volume 2, Valletta, Malta, February 22-24, 2020., pp. 463-474, 2020, SCITEPRESS, 978-989-758-395-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Jesper Nederlof, Céline M. F. Swennenhuis |
On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 25:1-25:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-172-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Gustavo Castellano |
Minimising Makespan of Discrete Controllers: A Qualitative Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
14 | Nadra Tabassam |
Minimizing the makespan of diagnostic multi-query graphs in embedded real time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
14 | Fuqing Zhao, Shuo Qin, Guoqiang Yang, Weimin Ma, Chuck Zhang, Houbin Song |
A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 126, pp. 41-53, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Mourad Benttaleb, Faicel Hnaien, Farouk Yalaoui |
Minimising the makespan in the two-machine job shop problem under availability constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Prod. Res. ![In: Int. J. Prod. Res. 57(5), pp. 1427-1457, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Chen-Yang Cheng, Kuo-Ching Ying, Hsia-Hsiang Chen, Hsiao-Shan Lu |
Minimising makespan in distributed mixed no-idle flowshops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Prod. Res. ![In: Int. J. Prod. Res. 57(1), pp. 48-60, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Lingfa Lu, Liqi Zhang |
A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 53(4), pp. 1261-1266, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Wei Sun 0035, Yuting Wu, Qi Lou, Yang Yu 0016 |
A Cooperative Coevolution Algorithm for the Seru Production With Minimizing Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 5662-5670, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Belal Ali Al-Maytami, Pingzhi Fan, Abir Hussain, Thar Baker, Panos Liatsis |
A Task Scheduling Algorithm With Improved Makespan Based on Prediction of Tasks Computation Time algorithm for Cloud Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 160916-160926, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Guanghui Zhang, Keyi Xing |
Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 108, pp. 33-43, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Mostafa Khatami, Amir Salehipour, F. J. Hwang |
Makespan minimization for the m-machine ordered flow shop scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 111, pp. 400-414, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Tsui-Ping Chung, Jatinder N. D. Gupta, Haidan Zhao, Frank Werner 0001 |
Minimizing the makespan on two identical parallel machines with mold constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 105, pp. 141-155, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Jeroen Burgelman, Mario Vanhoucke |
Computing project makespan distributions: Markovian PERT networks revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 103, pp. 123-133, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | M. A. Hakim Newton, Vahid Riahi, Abdul Sattar 0001 |
Makespan preserving flowshop reengineering via blocking constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 112, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan |
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 109, pp. 77-88, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ibrahim Kucukkoc |
MILP models to minimise makespan in additive manufacturing machine scheduling problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 105, pp. 58-67, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Victor Fernandez-Viagas, Jose M. Framiñan |
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 112, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | A. Hussain Lal, Vishnu K. R., A. Noorul Haq |
Minimising the makespan in open shop scheduling problems using variants of discrete firefly algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Adv. Oper. Manag. ![In: Int. J. Adv. Oper. Manag. 11(4), pp. 275-286, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Shenghui Li, Wuhui Chen, Yufen Chen, Chuan Chen 0001, Zibin Zheng |
Makespan-minimized computation offloading for smart toys in edge-cloud computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Commer. Res. Appl. ![In: Electron. Commer. Res. Appl. 37, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Arent W. de Jong, Jose Ildefonso U. Rubrico, Masaru Adachi, Takayuki Nakamura, Jun Ota 0001 |
A generalised makespan estimation for shop scheduling problems, using visual data and a convolutional neural network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Integr. Manuf. ![In: Int. J. Comput. Integr. Manuf. 32(6), pp. 559-568, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Laleh Ghalami, Daniel Grosu |
Scheduling parallel identical machines to minimize makespan: A parallel approximation algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 133, pp. 221-231, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ali Beynaghi, Fathollah Moztarzadeh, Amin Shahmardan, Reza Alizadeh Kordabad, Jalil Salimi, Masoud Mozafari |
Makespan minimization for batching work and rework process on a single facility with an aging effect: a hybrid meta-heuristic algorithm for sustainable production management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Manuf. ![In: J. Intell. Manuf. 30(1), pp. 33-45, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Pingping Lu, Gongxuan Zhang, Zhaomeng Zhu, Xiumin Zhou, Jin Sun 0001, Junlong Zhou |
A Review of Cost and Makespan-Aware Workflow Scheduling in Clouds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Circuits Syst. Comput. ![In: J. Circuits Syst. Comput. 28(6), pp. 1930006:1-1930006:28, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Jing Hua 0004, Yingqiong Peng, Yilu Xu, Kun Cao, Jing Jia |
Makespan Minimization for Multiprocessor Real-Time Systems under Thermal and Timing Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Circuits Syst. Comput. ![In: J. Circuits Syst. Comput. 28(9), pp. 1950145:1-1950145:22, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Kun Cao 0001, Junlong Zhou, Peijin Cong, Liying Li, Tongquan Wei, Mingsong Chen, Shiyan Hu, Xiaobo Sharon Hu |
Affinity-Driven Modeling and Scheduling for Makespan Optimization in Heterogeneous Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(7), pp. 1189-1202, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Felix Happach |
Makespan Minimization with OR-Precedence Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.08111, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
14 | Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder |
Approximation results for makespan minimization with budgeted uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.08592, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
14 | Alireza F. Hesaraki, Nico P. Dellaert, Ton de Kok |
Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 275(1), pp. 304-318, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Dmitry I. Arkhipov, Olga Battaïa, Alexander A. Lazarev |
An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 275(1), pp. 35-44, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Yuan Gao, Jinjiang Yuan, Chi To Ng 0001, T. C. E. Cheng |
A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 273(1), pp. 74-81, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Xiumin Zhou, Gongxuan Zhang, Jin Sun 0001, Junlong Zhou, Tongquan Wei, Shiyan Hu |
Minimizing cost and makespan for workflow scheduling in cloud using fuzzy dominance sort based HEFT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Future Gener. Comput. Syst. ![In: Future Gener. Comput. Syst. 93, pp. 278-289, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | R. Rajkumar, R. B. Jeen Robert |
A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Technol. Control. ![In: Inf. Technol. Control. 48(1), pp. 47-57, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Hugo Hissashi Miyata, Marcelo Seido Nagano, Jatinder N. D. Gupta |
Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 135, pp. 79-104, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Chen-Yang Cheng, Kuo-Ching Ying, Shu-Fen Li, Ya-Chu Hsieh |
Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 130, pp. 338-347, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Shih-Wei Lin, Kuo-Ching Ying |
Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 128, pp. 1-7, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Hamed Samarghandi |
Minimizing the makespan in a flow shop environment under minimum and maximum time-lag constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 136, pp. 614-634, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Yumei Huo |
Parallel machine makespan minimization subject to machine availability and total completion time constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 22(4), pp. 433-447, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Liang Gao 0001 |
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 12(5), pp. 100, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Peng Liang 0003, Wen-Si Chen, Mingqiang Luo, Wa He, Guosheng Liu |
Job-shop scheduling problem considering power cost and makespan under time-of-use electricity price. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Methods Sci. Eng. ![In: J. Comput. Methods Sci. Eng. 19(4), pp. 929-941, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Junlong Zhou, Tian Wang, Peijin Cong, Pingping Lu, Tongquan Wei, Mingsong Chen |
Cost and makespan-aware workflow scheduling in hybrid clouds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Syst. Archit. ![In: J. Syst. Archit. 100, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Hanadi Ochi, Olfa Belkahla Driss |
Scheduling the distributed assembly flowshop problem to minimize the makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CENTERIS/ProjMAN/HCist ![In: CENTERIS 2019 - International Conference on ENTERprise Information Systems / ProjMAN 2019 - International Conference on Project MANagement / HCist 2019 - International Conference on Health and Social Care Information Systems and Technologies 2019, Sousse, Tunisia, pp. 471-477, 2019, Elsevier. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Victor Verdugo, José Verschae |
Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings, pp. 427-441, 2019, Springer, 978-3-030-17952-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Xiaolu Zhang, Xi Liu 0002, Weidong Li 0002, Xuejie Zhang 0002 |
Trade-off Between Energy Consumption and Makespan in the Mapreduce Resource Allocation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAIS (2) ![In: Artificial Intelligence and Security - 5th International Conference, ICAIS 2019, New York, NY, USA, July 26-28, 2019, Proceedings, Part II, pp. 239-250, 2019, Springer, 978-3-030-24264-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Jaroslaw Rudy |
Algorithm-Aware Makespan Minimisation for Software Testing Under Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DepCoS-RELCOMEX ![In: Engineering in Dependability of Computer Systems and Networks - Proceedings of the 14th International Conference on Dependability of Computer Systems DepCoS-RELCOMEX, July 1-5, 2019, Brunów, Poland, pp. 435-445, 2019, Springer, 978-3-030-19500-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Junlong Zhou, Kun Cao 0001, Jin Sun 0001, Yi Zhang 0025, Tongquan Wei |
A Framework to Solve the Energy, Makespan and Lifetime Problems in Reliability-Driven Task Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
iThings/GreenCom/CPSCom/SmartData ![In: 2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019, pp. 608-614, 2019, IEEE, 978-1-7281-2980-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ezequiel Castellano, Víctor A. Braberman, Nicolás D'Ippolito, Sebastián Uchitel, Kenji Tei |
Minimising Makespan of Discrete Controllers: A Qualitative Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 58th IEEE Conference on Decision and Control, CDC 2019, Nice, France, December 11-13, 2019, pp. 1068-1075, 2019, IEEE, 978-1-7281-1398-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Hui-Min Gu, Rong Hu, Bin Qian 0001, Huai-Ping Jin, Ling Wang 0001 |
Whale Optimization Algorithm with Local Search for Open Shop Scheduling Problem to Minimize Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Intelligent Computing Theories and Application - 15th International Conference, ICIC 2019, Nanchang, China, August 3-6, 2019, Proceedings, Part II, pp. 678-687, 2019, Springer, 978-3-030-26968-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Shweta Khare, Hongyang Sun 0001, Julien Gascon-Samson, Kaiwen Zhang 0001, Aniruddha Gokhale, Yogesh D. Barve, Anirban Bhattacharjee, Xenofon D. Koutsoukos |
Linearize, predict and place: minimizing the makespan for edge-based stream processing of directed acyclic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEC ![In: Proceedings of the 4th ACM/IEEE Symposium on Edge Computing, SEC 2019, Arlington, Virginia, USA, November 7-9, 2019., pp. 1-14, 2019, ACM, 978-1-4503-6733-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder |
Approximation Results for Makespan Minimization with Budgeted Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers, pp. 60-71, 2019, Springer, 978-3-030-39478-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Joanna Berlinska |
Makespan Minimization in Data Gathering Networks with Dataset Release Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM (2) ![In: Parallel Processing and Applied Mathematics - 13th International Conference, PPAM 2019, Bialystok, Poland, September 8-11, 2019, Revised Selected Papers, Part II, pp. 230-241, 2019, Springer, 978-3-030-43221-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|