193
Views
80
CrossRef citations to date
0
Altmetric
Original Articles

Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

&
Pages 1643-1654 | Published online: 19 Apr 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (17)

Alex J. Ruiz-Torres, Giuseppe Paletta & Belarmino Adenso-Díaz. (2022) Hybrid two stage flowshop scheduling with secondary resources based on time buckets. International Journal of Production Research 60:6, pages 1954-1972.
Read now
Cuiwen Cao, Yao Zhang, Xingsheng Gu, Dan Li & Jie Li. (2021) An improved gravitational search algorithm to the hybrid flowshop with unrelated parallel machines scheduling problem. International Journal of Production Research 59:18, pages 5592-5608.
Read now
Enrique Gerstl, Baruch Mor & Gur Mosheiov. (2019) Scheduling on a proportionate flowshop to minimise total late work. International Journal of Production Research 57:2, pages 531-543.
Read now
Jose Cruz & Manuel Nunez. (2011) Batch-size-based rearrangement of the shop floor into mini-lines. International Journal of Production Research 49:17, pages 5099-5119.
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
Mejdi Souki & Abdelwaheb Rebai. (2010) Heuristics for the Operating Theatre Planning and Scheduling. Journal of Decision Systems 19:2, pages 225-252.
Read now
Adnène Hajji, Ali Gharbi, Jean-Pierre Kenné & Yamamoto Hidehiko. (2009) Production and changeover control policies of a class of failure prone buffered flow-shops. Production Planning & Control 20:8, pages 785-800.
Read now
B.K. Choi & J.C. Seo. (2009) Capacity-filtering algorithms for finite-capacity planning of a flexible flow line. International Journal of Production Research 47:12, pages 3363-3386.
Read now
D. Quadt & H. Kuhn . (2005) Conceptual framework for lot-sizing and scheduling of flexible flow lines. International Journal of Production Research 43:11, pages 2291-2308.
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
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
Astghik Babayan & David He . (2004) Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach. International Journal of Production Research 42:4, pages 777-799.
Read now
G.-C. Lee, Y.-D. Kim & S.-W. Choi. (2004) Bottleneck-focused scheduling for a hybrid flowshop. International Journal of Production Research 42:1, pages 165-181.
Read now
Lixin Tang, PeterB. Luh, Jiyin Liu & Lei Fang. (2002) Steel-making process scheduling using Lagrangian relaxation. International Journal of Production Research 40:1, pages 55-70.
Read now
UNGI JOO. (2001) JOB ASSIGNMENT ALGORITHMS ON UNIFORM PARALLEL MACHINES. Engineering Optimization 33:3, pages 351-371.
Read now
GEORGE VAIRAKTARAKIS & MOHSEN ELHAFSI. (2000) The use of flowlines to simplify routing complexity in two-stage flowshops. IIE Transactions 32:8, pages 687-699.
Read now
PANAGIOTIS KOUVELIS & GEORGE VAIRAKTARAKIS. (1998) Flowshops with processing flexibility across production stages. IIE Transactions 30:8, pages 735-746.
Read now

Articles from other publishers (63)

Yuan Kuang, Xiuli Wu, Ziqi Chen & Wence Li. (2024) A two-stage cross-neighborhood search algorithm bridging different solution representation spaces for solving the hybrid flow shop scheduling problem. Swarm and Evolutionary Computation 84, pages 101455.
Crossref
Jiaxin Fan, Yingli Li, Jin Xie, Chunjiang Zhang, Weiming Shen & Liang Gao. (2023) A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-Shop Scheduling Problem. IEEE Transactions on Cybernetics 53:3, pages 1752-1764.
Crossref
Youjun An, Xiaohui Chen, Kaizhou Gao, Lin Zhang, Yinghe Li & Ziye Zhao. (2023) Integrated optimization of real-time order acceptance and flexible job-shop rescheduling with multi-level imperfect maintenance constraints. Swarm and Evolutionary Computation 77, pages 101243.
Crossref
Youjun An, Xiaohui Chen, Kaizhou Gao, Lin Zhang, Yinghe Li & Ziye Zhao. (2023) A hybrid multi-objective evolutionary algorithm for solving an adaptive flexible job-shop rescheduling problem with real-time order acceptance and condition-based preventive maintenance. Expert Systems with Applications 212, pages 118711.
Crossref
Germán Herrera Vidal, Jairo R. Coronado Hernández & Claudia Minnaard. (2021) Modeling and statistical analysis of complexity in manufacturing systems under flow shop and hybrid environments. The International Journal of Advanced Manufacturing Technology 118:9-10, pages 3049-3058.
Crossref
Sebastian Lang, Tobias Reggelin, Johann Schmidt, Marcel Müller & Abdulrahman Nahhas. (2021) NeuroEvolution of augmenting topologies for solving a two-stage hybrid flow shop scheduling problem: A comparison of different solution strategies. Expert Systems with Applications 172, pages 114666.
Crossref
Elmira Gheisariha, Madjid Tavana, Fariborz Jolai & Meysam Rabiee. (2021) A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation. Mathematics and Computers in Simulation 180, pages 152-178.
Crossref
Tzu-Li Chen, Chen-Yang Cheng & Yi-Han Chou. (2018) Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming. Annals of Operations Research 290:1-2, pages 813-836.
Crossref
Biao Zhang, Quan-ke Pan, Liang Gao, Xin-li Zhang & Kun-kun Peng. (2018) A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem. Soft Computing 23:17, pages 8101-8129.
Crossref
Sang-Oh Shim, KyungBae Park & SungYong Choi. (2017) Innovative Production Scheduling with Customer Satisfaction Based Measurement for the Sustainability of Manufacturing Firms. Sustainability 9:12, pages 2249.
Crossref
Lingfa Lu & Liqi Zhang. (2016) Single-machine scheduling with production and rejection costs to minimize the maximum earliness. Journal of Combinatorial Optimization 34:2, pages 331-342.
Crossref
Biao Zhang, Quan-ke Pan, Liang Gao, Xin-li Zhang, Hong-yan Sang & Jun-qing Li. (2017) An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Applied Soft Computing 52, pages 14-27.
Crossref
M. Zandieh, M. B. Abiri & Seyed Habib A. Rahmati. (2016) Bi-objective scheduling of flexible flow lines: a gradual transition tabu search approach. Production Engineering 10:4-5, pages 477-488.
Crossref
Huixin Tian, Kun Li & Wei Liu. (2016) A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time. Mathematical Problems in Engineering 2016, pages 1-11.
Crossref
A. Ghodratnama, F. Jolai & R. Tavakkoli-Moghaddam. (2015) Solving a new multi-objective multi-route flexible flow line problem by multi-objective particle swarm optimization and NSGA-II. Journal of Manufacturing Systems 36, pages 189-202.
Crossref
Baruch Mor & Gur Mosheiov. (2015) A note: Minimizing maximum earliness on a proportionate flowshop. Information Processing Letters 115:2, pages 253-255.
Crossref
J. Behnamian. 2015. Handbook of Research on Artificial Intelligence Techniques and Algorithms. Handbook of Research on Artificial Intelligence Techniques and Algorithms 478 508 .
Antonio Costa, Fulvio Antonio Cappadonna & Sergio Fichera. (2014) A novel genetic algorithm for the hybrid flow shop scheduling with parallel batching and eligibility constraints. The International Journal of Advanced Manufacturing Technology 75:5-8, pages 833-847.
Crossref
Hao Luo, Bing Du, George Q. Huang, Huaping Chen & Xiaolin Li. (2013) Hybrid flow shop scheduling considering machine electricity consumption cost. International Journal of Production Economics 146:2, pages 423-439.
Crossref
Xiao Chun Zhu, Jian Feng Zhao & Mu Lan Wang. (2013) Adaptive Genetic Algorithm for Hybrid Flow-Shop Scheduling. Advanced Materials Research 753-755, pages 2925-2929.
Crossref
Quan-Ke Pan, Ling Wang, Kun Mao, Jin-Hui Zhao & Min Zhang. (2013) An Effective Artificial Bee Colony Algorithm for a Real-World Hybrid Flowshop Problem in Steelmaking Process. IEEE Transactions on Automation Science and Engineering 10:2, pages 307-322.
Crossref
Hamilton Emmons & George VairaktarakisHamilton Emmons & George Vairaktarakis. 2013. Flow Shop Scheduling. Flow Shop Scheduling 161 187 .
Victor Hugo Yaurima-Basaldua, Andrei Tchernykh, Yair Castro-Garcia, Victor Manuel Villagomez-Ramos & Larisa Burtseva. 2012. Parallel Processing and Applied Mathematics. Parallel Processing and Applied Mathematics 61 70 .
Hang-Min Cho, Suk-Joo Bae, Jungwuk Kim & In-Jae Jeong. (2011) Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Computers & Industrial Engineering 61:3, pages 529-541.
Crossref
Tadeusz Sawik. 2011. Scheduling in Supply Chains Using Mixed Integer Programming. Scheduling in Supply Chains Using Mixed Integer Programming 437 447 .
Haibo Tang & Chunming Ye. (2010) A plant growth simulation algorithm for permutation flow shop scheduling to minimize makespan. A plant growth simulation algorithm for permutation flow shop scheduling to minimize makespan.
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
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
Bo Liu, Ling Wang, Ying Liu, Bin Qian & Yi-Hui Jin. (2010) An effective hybrid particle swarm optimization for batch scheduling of polypropylene processes. Computers & Chemical Engineering 34:4, pages 518-528.
Crossref
Tatsushi Nishi, Yuichiro Hiranaka & Masahiro Inuiguchi. (2010) Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. Computers & Operations Research 37:1, pages 189-198.
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
Marie E. Matta. (2009) A genetic algorithm for the proportionate multiprocessor open shop. Computers & Operations Research 36:9, pages 2601-2618.
Crossref
Mejdi Souki & Abdelwaheb Rebai. (2009) Memetic differential evolution algorithm for operating room scheduling. Memetic differential evolution algorithm for operating room scheduling.
Victor Yaurima, Larisa Burtseva & Andrei Tchernykh. (2009) Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Computers & Industrial Engineering 56:4, pages 1452-1463.
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
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
Carlos D. Paternina-Arboleda, Jairo R. Montoya-Torres, Milton J. Acero-Dominguez & Maria C. Herrera-Hernandez. (2007) Scheduling jobs on a k-stage flexible flow-shop. Annals of Operations Research 164:1, pages 29-40.
Crossref
Joseph Y.-T. Leung & Hairong Zhao. (2007) Scheduling problems in master-slave model. Annals of Operations Research 159:1, pages 215-231.
Crossref
Victor Yaurima, Larisa Burtseva & Andrei Tchernykh. 2008. Parallel Processing and Applied Mathematics. Parallel Processing and Applied Mathematics 608 617 .
Magdalene Marinaki. 2009. Encyclopedia of Optimization. Encyclopedia of Optimization 1060 1068 .
Daniel Quadt & Heinrich Kuhn. (2007) A taxonomy of flexible flow line scheduling procedures. European Journal of Operational Research 178:3, pages 686-698.
Crossref
Daniel Quadt & Heinrich Kuhn. (2007) Batch scheduling of jobs with identical process times on flexible flow lines. International Journal of Production Economics 105:2, pages 385-401.
Crossref
Rubén Ruiz & Concepción Maroto. (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169:3, pages 781-800.
Crossref
H. Hentous & F. Benhammadi. (2006) Heuristics Resolution of a Constrained Hybrid Flow Shop Problem. Heuristics Resolution of a Constrained Hybrid Flow Shop Problem.
Hong Wang. (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Systems 22:2, pages 78-85.
Crossref
Hiroshi MORITA & Naoki SHIO. (2005) Hybrid Branch and Bound Method with Genetic Algorithm for Flexible Flowshop Scheduling Problem. JSME International Journal Series C 48:1, pages 46-52.
Crossref
T. Sawik. (2005) Integer programming approach to production scheduling for make-to-order manufacturing. Mathematical and Computer Modelling 41:1, pages 99-118.
Crossref
TADEUSZ SAWIK, ANDREAS SCHALLER & THOMAS M. TIRPAK. (2002) SCHEDULING OF PRINTED WIRING BOARD ASSEMBLY IN SURFACE MOUNT TECHNOLOGY LINES. Journal of Electronics Manufacturing 11:01, pages 1-17.
Crossref
Housni Djellab & Khaled Djellab. (2002) Preemptive Hybrid Flowshop Scheduling problem of interval orders. European Journal of Operational Research 137:1, pages 37-49.
Crossref
Meral Azizoğlu, Ergin Çakmak & Suna Kondakci. (2001) A flexible flowshop problem with total flow time minimization. European Journal of Operational Research 132:3, pages 528-538.
Crossref
Jinliang Cheng, Yoshiyuki Karuno & Hiroshi Kise. (2001) A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM. Journal of the Operations Research Society of Japan 44:2, pages 140-156.
Crossref
T. Sawik. (2000) Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling 31:13, pages 39-52.
Crossref
Masaaki Ohba, Toshifumi Uetake & Hitoshi Tsubone. (2000) Logistics innovation in the film manufacturing industry. Integrated Manufacturing Systems 11:2, pages 121-127.
Crossref
Hitoshi Tsubone, Masahiko Suzuki, Toshifumi Uetake & Masaaki Ohba. (2007) A Comparison between Basic Cyclic Scheduling and Variable Cyclic Scheduling in a Two‐stage Hybrid Flow Shop. Decision Sciences 31:1, pages 197-222.
Crossref
S.M.A. Suliman. (2000) A two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics 64:1-3, pages 143-152.
Crossref
O. Moursli & Y. Pochet. (2000) A branch-and-bound algorithm for the hybrid flowshop. International Journal of Production Economics 64:1-3, pages 113-125.
Crossref
Valérie Botta-Genoulaz. (2000) Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. International Journal of Production Economics 64:1-3, pages 101-111.
Crossref
Wendong Xiao, Peifeng Hao, Sen Zhang & Xinhe Xu. (2000) Hybrid flow shop scheduling using genetic algorithms. Hybrid flow shop scheduling using genetic algorithms.
Sushil Verma & Maged Dessouky. (1999) Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines. Journal of Scheduling 2:3, pages 135-150.
Crossref
Fouad Riane, Abdelhakim Artiba & Salah E. Elmaghraby. (1998) A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan. European Journal of Operational Research 109:2, pages 321-329.
Crossref
Maged M. Dessouky, Mohamed I. Dessouky & Sushil K. Verma. (1998) Flowshop scheduling with identical jobs and uniform parallel machines. European Journal of Operational Research 109:3, pages 620-631.
Crossref
Alain Guinet & Marie Legrand. (1998) Reduction of job-shop problems to flow-shop problems with precedence constraints. European Journal of Operational Research 109:1, pages 96-110.
Crossref
Omar Moursli. (1997) Branch and Bound Lower Bounds for the Hybrid Flowshop. IFAC Proceedings Volumes 30:14, pages 31-36.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.