14
Views
18
CrossRef citations to date
0
Altmetric
Original Articles

FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors

, &
Pages 351-366 | Received 01 Apr 1994, Published online: 18 Jun 2013

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

Read on this site (3)

P.-T. Chang, K.-P. Lin, P.-F. Pai, C.-Z. Zhong, C.-H. Lin & L.-T. Hung. (2008) Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem. International Journal of Production Research 46:20, pages 5719-5759.
Read now
Wei Wang & JohnL. Hunsucker. (2004) MAKESPAN DISTRIBUTIONS IN FLOW SHOPS WITH MULTIPLE PROCESSORS. Journal of the Chinese Institute of Industrial Engineers 21:3, pages 242-250.
Read now
Wei Wang & JohnL. Hunsucker. (2003) AN EVALUATION OF THE CDS HEURISTIC IN FLOW SHOPS WITH MULTIPLE PROCESSORS. Journal of the Chinese Institute of Industrial Engineers 20:3, pages 295-304.
Read now

Articles from other publishers (15)

M. Mirabi, S. M. T. Fatemi Ghomi & F. Jolai. (2011) A two-stage hybrid flowshop scheduling problem in machine breakdown condition. Journal of Intelligent Manufacturing 24:1, pages 193-199.
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
Zeng Ling-Li, Zou Feng-Xing, Xu Xiao-hong & Gao Zheng. (2009) Dynamic scheduling of multi-task for hybrid flow-shop based on energy consumption. Dynamic scheduling of multi-task for hybrid flow-shop based on energy consumption.
Gabriela Ochoa, Jose Antonio Vazquez-Rodriguez, Sanja Petrovic & Edmund Burke. (2009) Dispatching rules for production scheduling: A hyper-heuristic landscape analysis. Dispatching rules for production scheduling: A hyper-heuristic landscape analysis.
Xiang Liu, Fengxing Zou & Xiangping Zhang. (2008) Mathematical model and genetic optimization for hybrid flow shop scheduling problem based on energy consumption. Mathematical model and genetic optimization for hybrid flow shop scheduling problem based on energy consumption.
Chao-Tang Tseng, Ching-Jong Liao & Tai-Xiang Liao. (2008) A note on two-stage hybrid flowshop scheduling with missing operations. Computers & Industrial Engineering 54:3, pages 695-704.
Crossref
Jose Antonio Vazquez Rodriguez, Sanja Petrovic & Abdellah Salhi. (2007) An investigation of hyper-heuristic search spaces. An investigation of hyper-heuristic search spaces.
M. Zandieh, S.M.T. Fatemi Ghomi & S.M. Moattar Husseini. (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation 180:1, pages 111-127.
Crossref
J.A. Vazquez Rodriguez & A. Salhi. (2005) Performance of Single Stage Representation Genetic Algorithms in Scheduling Flexible Flow Shops. Performance of Single Stage Representation Genetic Algorithms in Scheduling Flexible Flow Shops.
Mary E. Kurz & Ronald G. Askin. (2004) Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159:1, pages 66-82.
Crossref
Henry W Thornton & John L Hunsucker. (2004) A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. European Journal of Operational Research 152:1, pages 96-114.
Crossref
Hung-Tso Lin & Ching-Jong Liao. (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics 86:2, pages 133-143.
Crossref
Mary E. Kurz & Ronald G. Askin. (2003) Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85:3, pages 371-388.
Crossref
Xi Sun, Kazuko Morizawa & Hiroyuki Nagasawa. (2003) Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. European Journal of Operational Research 146:3, pages 498-516.
Crossref
Wendong Xiao, Peifeng Hao, Sen Zhang & Xinhe Xu. (2000) Hybrid flow shop scheduling using genetic algorithms. Hybrid flow shop scheduling using genetic algorithms.

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.