Citations (41)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (9)
Eliana M. González-Neira & Jairo R. Montoya-Torres. (2017) A GRASP meta-heuristic for the hybrid flowshop scheduling problem. Journal of Decision Systems 26:3, pages 294-306.
Read now
Read now
F. Jolai, M. Rabiee & H. Asefi. (2012) A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times. International Journal of Production Research 50:24, pages 7447-7466.
Read now
Read now
Jeffrey Schaller. (2012) Scheduling a permutation flow shop with family setups to minimise total tardiness. International Journal of Production Research 50:8, pages 2204-2217.
Read now
Read now
J. Behnamian, S.M.T. Fatemi Ghomi & M. Zandieh. (2010) Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times. International Journal of Production Research 48:5, pages 1415-1438.
Read now
Read now
A. Alfieri. (2009) Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study. International Journal of Production Research 47:18, pages 5129-5145.
Read now
Read now
Chun-Lung Chen & Chuen-Lung Chen. (2008) Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines. International Journal of Production Research 46:22, pages 6415-6430.
Read now
Read now
G. I. Zobolas, C. D. Tarantilis & G. Ioannou. (2008) Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling. International Journal of Production Research 46:12, pages 3359-3386.
Read now
Read now
S.-W. Choi, Y.-D. Kim
& G.-C. Lee. (2005) Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. International Journal of Production Research 43:11, pages 2149-2167.
Read now
Read now
G.-C. Lee & Y.-D. Kim
. (2004) A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness. International Journal of Production Research 42:22, pages 4731-4743.
Read now
Read now
Articles from other publishers (32)
E.G. Birgin, J.E. Ferreira & D.P. Ronconi. (2020) A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research 114, pages 104824.
Crossref
Crossref
Jing-jing Wang & Ling Wang. (2019) An Iterated Greedy Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Total Tardiness Minimization. An Iterated Greedy Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Total Tardiness Minimization.
Chunlong Yu, Quirico Semeraro & Andrea Matta. (2018) A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Computers & Operations Research 100, pages 211-229.
Crossref
Crossref
Yi Tan, Lars Mönch & John W. Fowler. (2017) A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines. Journal of Scheduling 21:2, pages 209-226.
Crossref
Crossref
Eliana María González-Neira, Rafael Guillermo García-Cáceres, Juan Pablo Caballero-Villalobos, Lina Paola Molina-Sánchez & Jairo R. Montoya-Torres. (2016) Stochastic flexible flow shop scheduling problem under quantitative and qualitative decision criteria. Computers & Industrial Engineering 101, pages 128-144.
Crossref
Crossref
Jairo R. Montoya-Torres, Elyn L. Solano-Charris & Andres Muñoz-Villamizar. (2016) Assessing the Performance of Dispatching Policies for Hybrid Flowshop Manufacturing Systems. IFAC-PapersOnLine 49:31, pages 109-113.
Crossref
Crossref
E.G. Birgin, J.E. Ferreira & D.P. Ronconi. (2015) List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. European Journal of Operational Research 247:2, pages 421-440.
Crossref
Crossref
J. Behnamian. 2015. Handbook of Research on Artificial Intelligence Techniques and Algorithms. Handbook of Research on Artificial Intelligence Techniques and Algorithms
478
508
.
J. Behnamian, S. M. T. Fatemi Ghomi & M. Zandieh. (2014) Realistic variant of just-in-time flowshop scheduling: integration of L p -metric method in PSO-like algorithm. The International Journal of Advanced Manufacturing Technology 75:9-12, pages 1787-1797.
Crossref
Crossref
Johannes Hinckeldeyn, Rob Dekkers, Nils Altfeld & Jochen Kreutzfeldt. (2014) Expanding bottleneck management from manufacturing to product design and engineering processes. Computers & Industrial Engineering 76, pages 415-428.
Crossref
Crossref
Guilherme B. Mainieri & Débora P. Ronconi. (2012) New heuristics for total tardiness minimization in a flexible flowshop. Optimization Letters 7:4, pages 665-684.
Crossref
Crossref
Ravindra Gokhale & M. Mathirajan. (2011) Scheduling identical parallel machines with machine eligibility restrictions to minimize total weighted flowtime in automobile gear manufacturing. The International Journal of Advanced Manufacturing Technology 60:9-12, pages 1099-1110.
Crossref
Crossref
Bong-Kyun Kim & Yeong-Dae Kim. (2011) Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit. Computers & Industrial Engineering 61:4, pages 1309-1317.
Crossref
Crossref
Naim Yalaoui, Halim Mahdi, Lionel Amodeo & Farouk Yalaoui. (2011) A particle swarm optimization under fuzzy logic controller to solve a scheduling problem. A particle swarm optimization under fuzzy logic controller to solve a scheduling problem.
June-Young Bang & Yeong-Dae Kim. (2011) Scheduling algorithms for a semiconductor probing facility. Computers & Operations Research 38:3, pages 666-673.
Crossref
Crossref
Yeong-Dae Kim, Jae-Hun Kang, Gyeong-Eun Lee & Seung-Kil Lim. (2011) Scheduling Algorithms for Minimizing Tardiness of Orders at the Burn-in Workstation in a Semiconductor Manufacturing System. IEEE Transactions on Semiconductor Manufacturing 24:1, pages 14-26.
Crossref
Crossref
Guilherme Barroso Mainieri & Débora Pretti Ronconi. (2010) Regras de despacho para a minimização do atraso total no ambiente flowshop flexível. Gestão & Produção 17:4, pages 683-692.
Crossref
Crossref
J. Q. Wang, J. B. Yang, J. Chen, S. F. Zhang & S. D. Sun. (2010) Multi-bottleneck permutation flow-shop scheduling driven by bottleneck. Multi-bottleneck permutation flow-shop scheduling driven by bottleneck.
Yong-Chan Choi, Yeong-Dae Kim & June-Young Bang. (2010) Scheduling algorithms for an air conditioner manufacturing system composed of multiple parallel assembly lines. The International Journal of Advanced Manufacturing Technology 51:9-12, pages 1225-1241.
Crossref
Crossref
Rubén Ruiz & José Antonio Vázquez-Rodríguez. (2010) The hybrid flow shop scheduling problem. European Journal of Operational Research 205:1, pages 1-18.
Crossref
Crossref
Imma Ribas, Rainer Leisten & Jose M. Framiñan. (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research 37:8, pages 1439-1454.
Crossref
Crossref
XIAOFENG HU, JINGSONG BAO & YE JIN. (2011) A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD. Asia-Pacific Journal of Operational Research 26:06, pages 817-829.
Crossref
Crossref
Chun-Lung Chen & Chuen-Lung Chen. (2009) A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines. Computers & Operations Research 36:11, pages 3073-3081.
Crossref
Crossref
J. Behnamian, S.M.T. Fatemi Ghomi & M. Zandieh. (2009) A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Systems with Applications 36:8, pages 11057-11069.
Crossref
Crossref
Chun-Lung Chen & Chuen-Lung Chen. (2008) Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. The International Journal of Advanced Manufacturing Technology 43:1-2, pages 161-169.
Crossref
Crossref
Hyun-Seon Choi, Hyung-Won Kim, Dong-Ho Lee, Junggee Yoon, Chang Yeon Yun & Kevin B. Chae. (2008) Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates. The International Journal of Advanced Manufacturing Technology 42:9-10, pages 963-973.
Crossref
Crossref
Chun-Lung Chen & Chuen-Lung Chen. (2009) Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines. Computers & Industrial Engineering 56:4, pages 1393-1401.
Crossref
Crossref
H-W Kim & D-H Lee. (2009) Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 223:4, pages 433-442.
Crossref
Crossref
G.I. Zobolas, C.D. Tarantilis & G. Ioannou. (2009) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research 36:4, pages 1249-1267.
Crossref
Crossref
Hyun-Seon Choi & Dong-Ho Lee. (2009) Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops. Computers & Industrial Engineering 56:1, pages 113-120.
Crossref
Crossref
Yeong-Dae Kim, Byung-Jun Joo & Jong-Ho Shin. (2007) Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. Journal of Heuristics 15:1, pages 19-42.
Crossref
Crossref
Chun-lung Chen & Chuen-lung Chen. (2006) A Heuristic Method for a Flexible Flow Line with Unrelated Parallel Machines Problem. A Heuristic Method for a Flexible Flow Line with Unrelated Parallel Machines Problem.