Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
79 | Naveen Garg 0001, Amit Kumar 0001, Vinayaka Pandit |
Order Scheduling Models: Hardness and Algorithms. |
FSTTCS |
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. |
J. Oper. Res. Soc. |
2009 |
DBLP DOI BibTeX RDF |
|
59 | Julien Robert, Nicolas Schabanel |
Non-clairvoyant scheduling with precedence constraints. |
SODA |
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. |
J. Sched. |
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. |
ICFIE |
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. |
CSCWD |
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. |
IEEE Congress on Evolutionary Computation |
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. |
MICAI |
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. |
CSCWD |
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. |
CSCWD |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Xiaoping Li 0001, Qian Wang 0011 |
Heuristics for permutation flow shops to minimize total flowtime. |
CSCWD |
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. |
GECCO |
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. |
COCOON |
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. |
IPDPS |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Fatos Xhafa, Leonard Barolli, Arjan Durresi |
Immediate Mode Scheduling of Independent Jobs in Computational Grids. |
AINA |
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. |
NBiS |
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. |
Ann. Oper. Res. |
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. |
ICORES |
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. |
Concurr. Comput. Pract. Exp. |
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. |
Eng. Appl. Artif. Intell. |
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. |
OR Spectr. |
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. |
Knowl. Based Syst. |
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. |
Eng. Appl. Artif. Intell. |
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. |
Robotics Comput. Integr. Manuf. |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Yaarit Miriam Cohen, Pinar Keskinocak, Jordi Pereira |
A note on the flowtime network restoration problem. |
IISE Trans. |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Igor Averbakh |
The pairwise flowtime network construction problem. |
Oper. Res. Lett. |
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. |
Eng. Appl. Artif. Intell. |
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. |
ICAART (1) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier |
Task Bundle Delegation for Reducing the Flowtime. |
ICAART (Revised Selected Papers) |
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. |
Expert Syst. Appl. |
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. |
Expert Syst. Appl. |
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. |
Expert Syst. Appl. |
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. |
Swarm Evol. Comput. |
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. |
Eur. J. Oper. Res. |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Paz Perez-Gonzalez, Jose M. Framiñan |
Single machine interfering jobs problem with flowtime objective. |
J. Intell. Manuf. |
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. |
Swarm Evol. Comput. |
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. |
Comput. Ind. Eng. |
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. |
Comput. Ind. Eng. |
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. |
ICDCS |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Andreas Wiese |
Fixed-Parameter Approximation Schemes for Weighted Flowtime. |
APPROX-RANDOM |
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. |
Comput. Oper. Res. |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Brenda Courtad, Kenneth R. Baker, Michael J. Magazine, George G. Polak |
Minimizing flowtime for paired tasks. |
Eur. J. Oper. Res. |
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. |
Expert Syst. Appl. |
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. |
J. Intell. Fuzzy Syst. |
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. |
IEEE Trans. Evol. Comput. |
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. |
J. Sched. |
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. |
Algorithms |
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. |
Expert Syst. Appl. |
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. |
Comput. Oper. Res. |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Xia Zhu, Xiaoping Li 0001 |
Iterative search method for total flowtime minimization no-wait flowshop problem. |
Int. J. Mach. Learn. Cybern. |
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. |
Asia Pac. J. Oper. Res. |
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. |
Inf. Sci. |
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. |
Adv. Eng. Softw. |
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. |
Comput. Oper. Res. |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Quan-Ke Pan, Rubén Ruiz |
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. |
Comput. Oper. Res. |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Zied Bouyahia, Monia Bellalouna, Khaled Ghédira |
Load balancing a priori strategy for the probabilistic weighted flowtime problem. |
Comput. Ind. Eng. |
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. |
Int. J. Math. Oper. Res. |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Kyle Fox, Madhukar Korupolu |
Weighted Flowtime on Capacitated Machines. |
SODA |
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. |
Expert Syst. Appl. |
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. |
Expert Syst. Appl. |
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. |
Comput. Math. Appl. |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Quan-Ke Pan, Rubén Ruiz |
Local search methods for the flowshop scheduling problem with flowtime minimization. |
Eur. J. Oper. Res. |
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. |
Comput. Ind. Eng. |
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. |
FSKD |
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. |
Expert Syst. Appl. |
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. |
Inf. Sci. |
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. |
J. Intell. Manuf. |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Baruch Mor, Gur Mosheiov |
Single machine batch scheduling with two competing agents to minimize total flowtime. |
Eur. J. Oper. Res. |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Yi Zhang 0009, Xiaoping Li 0001 |
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization. |
Comput. Ind. Eng. |
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. |
CSCWD |
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. |
ICIC (2) |
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. |
ICIC (2) |
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. |
ICAIC (2) |
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. |
Eur. J. Oper. Res. |
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. |
IEEE Congress on Evolutionary Computation |
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. |
ICSI (1) |
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. |
SMC |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Kirk Pruhs, Julien Robert, Nicolas Schabanel |
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability. |
WAOA |
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. |
Comput. Oper. Res. |
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. |
Comput. Oper. Res. |
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. |
Int. J. Comput. Integr. Manuf. |
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. |
Eur. J. Oper. Res. |
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. |
FCS |
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. |
OR Spectr. |
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. |
Eur. J. Oper. Res. |
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. |
CSCWD |
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. |
Eur. J. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Dimitrios G. Pandelis |
Optimal preemptive scheduling on uniform machines with discounted flowtime objectives. |
Eur. J. Oper. Res. |
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. |
Hybrid Metaheuristics |
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. |
CISched |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Xiaoping Li 0001, Qian Wang 0011 |
Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization. |
BASYS |
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. |
CASE |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Jose M. Framiñan, Rainer Leisten, Rafael Ruiz-Usano |
Comparison of heuristics for flowtime minimisation in permutation flowshops. |
Comput. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Simon Dunstall, Andrew Wirth |
Heuristic methods for the identical parallel machine flowtime problem with set-up times. |
Comput. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Xiuli Wang, T. C. Edwin Cheng |
Two-machine flowshop scheduling with job class setups to minimize total flowtime. |
Comput. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Joseph Y.-T. Leung, Hairong Zhao |
Minimizing mean flowtime and makespan on master-slave systems. |
J. Parallel Distributed Comput. |
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. |
Eur. J. Oper. Res. |
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. |
Eur. J. Oper. Res. |
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. |
Comput. Ind. Eng. |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Chandrasekharan Rajendran, Hans Ziegler |
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. |
Comput. Ind. Eng. |
2005 |
DBLP DOI BibTeX RDF |
|