Algorithms for no-wait flowshops with total completion time subject to makespan

[1]  H. M. Soroush,et al.  Solving the single machine scheduling problem with general job-dependent past-sequence-dependent setup times and learning effects , 2012 .

[2]  Ali Allahverdi,et al.  Heuristics for no-wait flowshops with makespan subject to mean completion time , 2012, Appl. Math. Comput..

[3]  Marcelo Seido Nagano,et al.  A new evolutionary clustering search for a no-wait flow shop problem with set-up times , 2012, Eng. Appl. Artif. Intell..

[4]  Joachim Hertzberg,et al.  Online scheduling of flexible job-shops with blocking and transportation , 2012 .

[5]  Shih-Wei Lin,et al.  Scheduling a bi-criteria flowshop manufacturing cell with sequence-dependent family setup times , 2012 .

[6]  Mohamed Benrejeb,et al.  Resolution of the two-part cyclic hoist scheduling problem with bounded processing times in complex lines’ configuration , 2012 .

[7]  Nasser Salmasi,et al.  Permutation flowshops in group scheduling with sequence-dependent setup times , 2012 .

[8]  Kuo-Ching Ying,et al.  Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm , 2012 .

[9]  Kourosh Eshghi,et al.  A hybrid PSO-SA algorithm for the travelling tournament problem , 2012 .

[10]  Chandrasekharan Rajendran,et al.  Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives , 2011 .

[11]  B. Srirangacharyulu,et al.  Minimising mean squared deviation of job completion times about a common due date in multimachine systems , 2011 .

[12]  Andreas Klemmt,et al.  Optimisation approaches for batch scheduling in semiconductor manufacturing , 2011 .

[13]  Sugato Bagchi,et al.  Experiences in implementing simulation-based support for operational decision making in semiconductor manufacturing , 2011 .

[14]  Tarek Y. ElMekkawy,et al.  An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server , 2011 .

[15]  Lin-Yu Tseng,et al.  A hybrid genetic algorithm for no-wait flowshop scheduling problem , 2010 .

[16]  J. Framiñan,et al.  An efficient heuristic for total flowtime minimisation in no-wait flowshops , 2010 .

[17]  Xiaoping Li,et al.  Complete local search with limited memory algorithm for no-wait job shops to minimize makespan , 2009, Eur. J. Oper. Res..

[18]  L. Wang,et al.  A DE-based approach to no-wait flow-shop scheduling , 2009, Comput. Ind. Eng..

[19]  Uday K. Chakraborty,et al.  An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling , 2009 .

[20]  V. Vinod,et al.  Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times , 2009 .

[21]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[22]  Oliver Rose,et al.  Simulation analysis of semiconductor manufacturing with small lot size and batch tool replacements , 2008, 2008 Winter Simulation Conference.

[23]  Uday K. Chakraborty,et al.  An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling , 2008 .

[24]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[25]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..

[26]  Fawaz S. Al-Anzi,et al.  The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time , 2008 .

[27]  Marcelo Seido Nagano,et al.  Evaluating the performance for makespan minimisation in no-wait flowshop sequencing , 2008 .

[28]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[29]  S. Shyu,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[30]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[31]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[32]  Jose M. Framiñan,et al.  Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..

[33]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[34]  Tariq Aldowaisan,et al.  No-wait flowshops with bicriteria of makespan and total completion time , 2002, J. Oper. Res. Soc..

[35]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[36]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[37]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

[38]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[39]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[40]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[41]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

[42]  Rainer Leisten,et al.  A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness , 2006 .

[43]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[44]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[45]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .