Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
79 | Naveen Garg 0001, Amit Kumar 0001, Vinayaka Pandit |
Order Scheduling Models: Hardness and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 96-107, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
68 | N. Madhushini, Chandrasekharan Rajendran, Y. Deepa |
Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Oper. Res. Soc. ![In: J. Oper. Res. Soc. 60(7), pp. 991-1004, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
59 | Julien Robert, Nicolas Schabanel |
Non-clairvoyant scheduling with precedence constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 491-500, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
equi-partition, non-clairvoyant algorithm, fairness, online scheduling, precedences |
49 | Xiaoqiang Cai, Xianyi Wu, Xian Zhou 0002 |
Stochastic scheduling on parallel machines to minimize discounted holding costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(4), pp. 375-388, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Discounted holding cost, Discounted rewords, Flowtime, Dynamic policy, Static list policy, SEPT rule, LEPT rule, Parallel machines, Makespan, Stochastic scheduling |
49 | Wenzhong Guo, Guolong Chen, Huang Min, Shuili Chen |
A Discrete Particle Swarm Optimization Algorithm for the Multiobjective Permutation Flowshop Sequencing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFIE ![In: Fuzzy Information and Engineering, Proceedings of the Second International Conference of Fuzzy Information and Engineering, ICFIE 2007, May 13-16, 2007, Guangzhou, China, pp. 323-331, 2007, Springer, 978-3-540-71440-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multiobjective Permutation Flow Shop Sequencing, Discrete Particle Swarm, Total Tardiness, Total Flowtime, Makespan |
43 | Yi Zhang 0009, Xiaoping Li 0001, Qian Wang 0011, Jie Zhu 0002 |
Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 13th International Conference on Computers Supported Cooperative Work in Design, CSCWD 2009, April 22-24, 2009, Santiago, Chile, pp. 582-589, 2009, IEEE, 978-1-4244-3534-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | S. Chandrasekaran, S. G. Ponnambalam, R. K. Suresh, N. Vijayakumar |
Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 4012-4018, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena |
Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2007: Advances in Artificial Intelligence, 6th Mexican International Conference on Artificial Intelligence, Aguascalientes, Mexico, November 4-10, 2007, Proceedings, pp. 1099-1109, 2007, Springer, 978-3-540-76630-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Xia Zhu, Xiaoping Li 0001, Qian Wang 0011 |
Hybrid Heuristic for Total Flowtime Minimization in No-wait Flow Shops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 11th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2007, April 26-28, 2007, Melbourne, Australia, pp. 1050-1054, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Yi Zhang 0009, Xiaoping Li 0001, Qian Wang 0011 |
Web Service Based Method for Large Scale Flow Shops with Flowtime Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 11th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2007, April 26-28, 2007, Melbourne, Australia, pp. 484-489, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Xiaoping Li 0001, Qian Wang 0011 |
Heuristics for permutation flow shops to minimize total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 10th International Conference on CSCW in Design, CSCWD 2006, May 3-5, 2006, Southeast University, Nanjing, China, pp. 107-111, 2006, IEEE, 1-4244-0165-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Mary E. Kurz, Sarah Canterbury |
Minimizing total flowtime and maximum earliness on a single machine using multiple measures of fitness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, pp. 803-809, 2005, ACM, 1-59593-010-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bi-criteria scheduling, multicriteria genetic algorithm |
40 | Axel Simroth, Alexander Souza |
On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 168-177, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Fatos Xhafa, Javier Carretero, Enrique Alba 0001, Bernabé Dorronsoro |
Design and evaluation of tabu search method for job scheduling in distributed environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, pp. 1-8, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Fatos Xhafa, Leonard Barolli, Arjan Durresi |
Immediate Mode Scheduling of Independent Jobs in Computational Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 21st International Conference on Advanced Information Networking and Applications (AINA 2007), May 21-23, 2007, Niagara Falls, Canada, pp. 970-977, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Fatos Xhafa, Joanna Kolodziej, Leonard Barolli, Akli Fundo |
A GA+TS Hybrid Algorithm for Independent Batch Scheduling in Computational Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NBiS ![In: The 14th International Conference on Network-Based Information Systems, NBiS 2011, Tirana, Albania, September 7-9, 2011, pp. 229-235, 2011, IEEE Computer Society, 978-1-4577-0789-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
Flowtime, Genetic Algorithms, Tabu Search, Hybridization, Computational Grids, Makespan, Meta-heuristics |
29 | Rubén Ruiz, Ali Allahverdi |
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 156(1), pp. 143-171, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
No-wait, Total flowtime, Setup times, Stochastic local search, Flowshop |
23 | Camille Bonnin, Arnaud Malapert, Margaux Nattaf, Marie-Laure Espinouse |
Toward a Global Constraint for Minimizing the Flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICORES ![In: Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, ICORES 2024, Rome, Italy, February 24-26, 2024., pp. 70-81, 2024, SCITEPRESS, 978-989-758-681-1. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Satya Deo Kumar Ram, Shashank Srivastava, Krishn Kumar Mishra |
Redefining the learning mechanism in teaching-learning-based optimization and its applications for flowtime-aware-cost minimizing of the workflow in cloud. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 35(23), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Hengwei Guo, Hongyan Sang, Xujin Zhang, Peng Duan, Junqing Li, Yuyan Han |
An effective fruit fly optimization algorithm for the distributed permutation flowshop scheduling problem with total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Appl. Artif. Intell. ![In: Eng. Appl. Artif. Intell. 123(Part B), pp. 106347, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Fernando Luis Rossi, Marcelo Seido Nagano |
Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR Spectr. ![In: OR Spectr. 44(4), pp. 1311-1346, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Jia-Yang Mao, Quan-Ke Pan, Zhong-Hua Miao, Liang Gao 0001, Shuai Chen |
A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Based Syst. ![In: Knowl. Based Syst. 242, pp. 108413, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Fuqing Zhao, Shilu Di, Ling Wang 0001, Tianpeng Xu, Ningning Zhu, Jonrinaldi |
A self-learning hyper-heuristic for the distributed assembly blocking flow shop scheduling problem with total flowtime criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Appl. Artif. Intell. ![In: Eng. Appl. Artif. Intell. 116, pp. 105418, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Ilkay Saracoglu, Gürsel A. Süer, Patrick Gannon |
Minimizing makespan and flowtime in a parallel multi-stage cellular manufacturing company. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Robotics Comput. Integr. Manuf. ![In: Robotics Comput. Integr. Manuf. 72, pp. 102182, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Yaarit Miriam Cohen, Pinar Keskinocak, Jordi Pereira |
A note on the flowtime network restoration problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IISE Trans. ![In: IISE Trans. 53(12), pp. 1351-1352, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Igor Averbakh |
The pairwise flowtime network construction problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 49(6), pp. 902-907, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Shuai Chen, Quan-Ke Pan, Liang Gao 0001, Hong-yan Sang |
A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Appl. Artif. Intell. ![In: Eng. Appl. Artif. Intell. 104, pp. 104375, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier |
A Multi-Agent Negotiation Strategy for Reducing the Flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAART (1) ![In: Proceedings of the 13th International Conference on Agents and Artificial Intelligence, ICAART 2021, Volume 1, Online Streaming, February 4-6, 2021., pp. 58-68, 2021, SCITEPRESS, 978-989-758-484-8. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier |
Task Bundle Delegation for Reducing the Flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAART (Revised Selected Papers) ![In: Agents and Artificial Intelligence - 13th International Conference, ICAART 2021, Virtual Event, February 4-6, 2021, Revised Selected Papers, pp. 22-45, 2021, Springer, 978-3-031-10160-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Quan-Ke Pan, Liang Gao 0001, Ling Wang 0001, Jing Liang 0005, Xinyu Li 0001 |
Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 124, pp. 309-324, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Fernando Luis Rossi, Marcelo Seido Nagano |
Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 125, pp. 40-54, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Carlos Eduardo de Andrade, Thuener Silva, Luciana S. Pessoa |
Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 128, pp. 67-80, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Hongyan Sang, Quan-Ke Pan, Jun-Qing Li 0001, Ping Wang, Yu-Yan Han, Kai-Zhou Gao, Peng Duan |
Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Swarm Evol. Comput. ![In: Swarm Evol. Comput. 44, pp. 64-73, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
|
23 | Paz Perez-Gonzalez, Jose M. Framiñan |
Single machine interfering jobs problem with flowtime objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Manuf. ![In: J. Intell. Manuf. 29(5), pp. 953-972, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Chin-Chia Wu, Jia-Yang Chen, Win-Chin Lin, Kunjung Lai, Shang-Chia Liu, Pay-Wen Yu |
A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Swarm Evol. Comput. ![In: Swarm Evol. Comput. 41, pp. 97-110, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Chin-Chia Wu, Shang-Chia Liu, Tzu-Yun Lin, Tzu-Hsuan Yang, I-Hong Chung, Win-Chin Lin |
Bicriterion total flowtime and maximum tardiness minimization for an order scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 117, pp. 152-163, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan |
The distributed permutation flow shop to minimise the total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 118, pp. 464-477, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Zhiming Hu, Baochun Li, Chen Chen, Xiaodi Ke |
FlowTime: Dynamic Scheduling of Deadline-Aware Workflows and Ad-Hoc Jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 38th IEEE International Conference on Distributed Computing Systems, ICDCS 2018, Vienna, Austria, July 2-6, 2018, pp. 929-938, 2018, IEEE Computer Society, 978-1-5386-6871-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Andreas Wiese |
Fixed-Parameter Approximation Schemes for Weighted Flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA, pp. 28:1-28:19, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-085-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Victor Fernandez-Viagas, Jose M. Framiñan |
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 81, pp. 167-177, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Brenda Courtad, Kenneth R. Baker, Michael J. Magazine, George G. Polak |
Minimizing flowtime for paired tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 259(3), pp. 818-828, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Victor Fernandez-Viagas, Rainer Leisten, Jose M. Framiñan |
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 61, pp. 290-301, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 31(3), pp. 1731-1743, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Valentino Santucci, Marco Baioletti, Alfredo Milani |
Algebraic Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem With Total Flowtime Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Evol. Comput. ![In: IEEE Trans. Evol. Comput. 20(5), pp. 682-694, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Peruvemba Sundaram Ravi, Levent Tunçel, Michael Huang |
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 19(5), pp. 547-561, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Kaizhou Gao |
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 9(4), pp. 71, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Imma Ribas, Ramón Companys, Xavier Tort-Martorell |
An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 42(15-16), pp. 6155-6167, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Victor Fernandez-Viagas, Jose M. Framiñan |
A new set of high-performing heuristics to minimise flowtime in permutation flowshops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 53, pp. 68-80, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Xia Zhu, Xiaoping Li 0001 |
Iterative search method for total flowtime minimization no-wait flowshop problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Mach. Learn. Cybern. ![In: Int. J. Mach. Learn. Cybern. 6(5), pp. 747-761, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Yunqiang Yin, Shuenn-Ren Cheng, Chin-Chia Wu |
Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 31(6), 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Quan-Ke Pan, Yan Dong 0001 |
An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 277, pp. 643-655, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Cristian Mateos, Elina Pacini, Carlos García Garino |
An ACO-inspired algorithm for minimizing weighted flowtime in cloud-based parameter sweep experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Eng. Softw. ![In: Adv. Eng. Softw. 56, pp. 38-50, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Shih-Wei Lin, Kuo-Ching Ying |
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 40(6), pp. 1625-1647, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Quan-Ke Pan, Rubén Ruiz |
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 40(1), pp. 117-128, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Zied Bouyahia, Monia Bellalouna, Khaled Ghédira |
Load balancing a priori strategy for the probabilistic weighted flowtime problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 64(1), pp. 1-10, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Sameer Sharma, Deepak Gupta, Seema Sharma |
Bicriteria scheduling on parallel machines: total tardiness and weighted flowtime in fuzzy environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Math. Oper. Res. ![In: Int. J. Math. Oper. Res. 5(4), pp. 492-507, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Kyle Fox, Madhukar Korupolu |
Weighted Flowtime on Capacitated Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 129-143, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Wagner Emanoel Costa, Marco César Goldbarg, Elizabeth Ferreira Gouvea Goldbarg |
Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 39(18), pp. 13118-13126, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Wagner Emanoel Costa, Marco César Goldbarg, Elizabeth Ferreira Gouvea Goldbarg |
New VNS heuristic for total flowtime flowshop scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 39(9), pp. 8149-8161, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Ching-Jong Liao, Chien-Wen Chao, Liang-Chuan Chen |
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Math. Appl. ![In: Comput. Math. Appl. 63(1), pp. 110-117, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Quan-Ke Pan, Rubén Ruiz |
Local search methods for the flowshop scheduling problem with flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 222(1), pp. 31-43, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Xiuli Wang, T. C. E. Cheng |
Performance bound analysis of a heuristic for the total weighted flowtime problem with fixed delivery dates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 62(2), pp. 451-456, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Hong-yan Sang, Jun-Hua Duan |
An efficient discrete artificial bee colony algorithm for total flowtime lot-streaming flowshop. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD ![In: 9th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2012, 29-31 May 2012, Chongqing, China, pp. 1585-1588, 2012, IEEE, 978-1-4673-0025-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Xiao Xu, Zhenhao Xu, Xingsheng Gu |
An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 38(7), pp. 7970-7979, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Angela Hsiang-Ling Chen |
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 181(16), pp. 3459-3475, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Johnny C. Ho, Francisco J. López, Alex J. Ruiz-Torres, Tzu-Liang (Bill) Tseng |
Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Manuf. ![In: J. Intell. Manuf. 22(2), pp. 179-190, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Baruch Mor, Gur Mosheiov |
Single machine batch scheduling with two competing agents to minimize total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 215(3), pp. 524-531, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Yi Zhang 0009, Xiaoping Li 0001 |
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 60(4), pp. 706-718, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Xia Zhu, Xiaoping Li 0001, Qian Wang 0011 |
An evolutionary algorithm for no-wait flowshop problems with flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 2011 15th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2011, June 8-10, 2011, Lausanne, Switzerland, pp. 285-290, 2011, IEEE, 978-1-4577-0387-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Yu-Yan Han, Jun-Hua Duan, Yu-Jie Yang, Min Zhang, Bao Yun |
Minimizing the Total Flowtime Flowshop with Blocking Using a Discrete Artificial Bee Colony. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence - 7th International Conference, ICIC 2011, Zhengzhou, China, August 11-14, 2011, Revised Selected Papers, pp. 91-97, 2011, Springer, 978-3-642-25943-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ling Wang 0001, Angela Hsiang-Ling Chen |
A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence - 7th International Conference, ICIC 2011, Zhengzhou, China, August 11-14, 2011, Revised Selected Papers, pp. 83-90, 2011, Springer, 978-3-642-25943-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Xingye Dong, Houkuan Huang, Ping Chen |
Study on Iterated Local Search Algorithm for Permutation Flowshop Problem with Total Flowtime Objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAIC (2) ![In: Applied Informatics and Communication - International Conference, ICAIC 2011, Xi'an, China, August 20-21, 2011, Proceedings, Part II, pp. 236-245, 2011, Springer, 978-3-642-23219-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül Toptal, Manoj Kumar Tiwari |
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 201(1), pp. 89-98, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Angela Hsiang-Ling Chen |
A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2010, Barcelona, Spain, 18-23 July 2010, pp. 1-8, 2010, IEEE, 978-1-4244-6909-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Xianpeng Wang 0002, Lixin Tang |
An Improved Particle Swarm Optimization for Permutation Flowshop Scheduling Problem with Total Flowtime Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSI (1) ![In: Advances in Swarm Intelligence, First International Conference, ICSI 2010, Beijing, China, June 12-15, 2010, Proceedings, Part I, pp. 144-151, 2010, Springer, 978-3-642-13494-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Yi Zhang 0009, Xiaoping Li 0001 |
A Quantum-inspired Iterated Greedy algorithm for permutation flowshops with total flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC ![In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Istanbul, Turkey, 10-13 October 2010, pp. 1912-1917, 2010, IEEE, 978-1-4244-6588-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Kirk Pruhs, Julien Robert, Nicolas Schabanel |
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers, pp. 237-248, 2010, Springer, 978-3-642-18317-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Bassem Jarboui, Mansour Eddaly, Patrick Siarry |
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 36(9), pp. 2638-2646, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Xingye Dong, Houkuan Huang, Ping Chen |
An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 36(5), pp. 1664-1669, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | R. Rajkumar, P. Shahabudeen |
Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Integr. Manuf. ![In: Int. J. Comput. Integr. Manuf. 22(10), pp. 987-998, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Yi Zhang 0009, Xiaoping Li 0001, Qian Wang 0011 |
Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 196(3), pp. 869-876, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Zied Bouyahia, Monia Bellalouna, Khaled Ghédira, Patrick Jaillet |
A Priori Strategies for the Probabilistic Total Weighted Flowtime on Parallel Identical Machines Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCS ![In: Proceedings of the 2009 International Conference on Foundations of Computer Science, FCS 2009, July 13-16, 2009, Las Vegas, Nevada, USA, pp. 145-151, 2009, CSREA Press, 1-60132-103-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
23 | Jose M. Framiñan, Rainer Leisten |
A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR Spectr. ![In: OR Spectr. 30(4), pp. 787-804, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Joseph Y.-T. Leung, Chung-Yee Lee, Chung W. Ng, Gilbert H. Young |
Preemptive multiprocessor order scheduling to minimize total weighted flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 190(1), pp. 40-51, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Yi Zhang 0009, Xiaoping Li 0001, Jie Zhu 0002, Qian Wang 0011 |
Composite heuristic algorithm for permutation flowshop scheduling problems with total flowtime minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 12th International Conference on CSCW in Design, CSCWD 2008, April 16-18, 2008, Nanyang Hotel, Xi'an Jiaotong University, Xi'an, China, pp. 903-907, 2008, IEEE, 978-1-4244-1650-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Mehmet Fatih Tasgetiren, Yun-Chia Liang, Mehmet Sevkli, Günes Gençyilmaz |
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 177(3), pp. 1930-1947, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Dimitrios G. Pandelis |
Optimal preemptive scheduling on uniform machines with discounted flowtime objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 177(1), pp. 630-637, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena |
Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics, 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings, pp. 69-81, 2007, Springer, 978-3-540-75513-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Yun-Chia Liang |
A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISched ![In: 2007 IEEE Symposium on Computational Intelligence in Scheduling, CISched 2007, Honolulu, Hawaii, USA, April 2-4, 2007, pp. 251-258, 2007, IEEE, 1-4244-0704-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Xiaoping Li 0001, Qian Wang 0011 |
Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BASYS ![In: Information Technology For Balanced Manufacturing Systems - IFIP TC5, WG 5.5 Seventh International Conference on Information Technology for Balanced Automation Systems in Manufacturing and Services, Niagara Falls, Ontario, Canada, September 4-6, 2006, pp. 349-356, 2006, Springer, 978-0-387-36590-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | S. Chandrasekaran, R. K. Suresh, S. G. Ponnambalam, N. Vijayakumar |
An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASE ![In: 2006 IEEE International Conference on Automation Science and Engineering, Shanghai, China, 7-10 October 2006, pp. 513-518, 2006, IEEE, 1-4244-0310-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Jose M. Framiñan, Rainer Leisten, Rafael Ruiz-Usano |
Comparison of heuristics for flowtime minimisation in permutation flowshops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 32, pp. 1237-1254, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Simon Dunstall, Andrew Wirth |
Heuristic methods for the identical parallel machine flowtime problem with set-up times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 32, pp. 2479-2491, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Xiuli Wang, T. C. Edwin Cheng |
Two-machine flowshop scheduling with job class setups to minimize total flowtime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 32, pp. 2751-2770, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Joseph Y.-T. Leung, Hairong Zhao |
Minimizing mean flowtime and makespan on master-slave systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 65(7), pp. 843-856, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Seda Özmutlu, Catherine M. Harmonosky |
A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: Threshold-based alternate routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 166(2), pp. 369-384, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | T. K. Varadharajan, Chandrasekharan Rajendran |
A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 167(3), pp. 772-795, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | S. Thiagarajan, Chandrasekharan Rajendran |
Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 49(4), pp. 463-503, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Chandrasekharan Rajendran, Hans Ziegler |
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 48(4), pp. 789-797, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|