61
Views
18
CrossRef citations to date
0
Altmetric
ORIGINAL ARTICLES

Algorithms with performance guarantees for flow shops with regular objective functions

&
Pages 1107-1111 | Received 01 Apr 2004, Accepted 01 Jan 2005, Published online: 23 Feb 2007

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

Read on this site (5)

Tao Ren, Peng Zhao, Da Zhang, Bingqian Liu, Huawei Yuan & Danyu Bai. (2017) Permutation flow-shop scheduling problem to optimize a quadratic objective function. Engineering Optimization 49:9, pages 1589-1603.
Read now
Danyu Bai. (2015) Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates. International Journal of Systems Science 46:11, pages 1994-2005.
Read now
Danyu Bai & Zhihai Zhang. (2014) On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem. International Journal of Systems Science 45:8, pages 1657-1667.
Read now
J-B Wang & M-Z Wang. (2012) Worst-case analysis for flow shop scheduling problems with an exponential learning effect. Journal of the Operational Research Society 63:1, pages 130-137.
Read now

Articles from other publishers (13)

Xi-Xi Liang, Bo Zhang, Ji-Bo Wang, Na Yin & Xue Huang. (2019) Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects. Journal of Applied Mathematics and Computing 61:1-2, pages 373-388.
Crossref
Danyu Bai, Jianheng Liang, Bingqian Liu, Mengqian Tang & Zhi-Hai Zhang. (2017) Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates. Computers & Industrial Engineering 112, pages 336-347.
Crossref
S. Afshin Mansouri, Emel Aktas & Umut Besikci. (2016) Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption. European Journal of Operational Research 248:3, pages 772-788.
Crossref
Ji-Bo Wang & Jian-Jun Wang. (2014) Flowshop scheduling with a general exponential learning effect. Computers & Operations Research 43, pages 292-308.
Crossref
Zhi-Hai Zhang & Danyu Bai. (2014) An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times. Applied Mathematics and Computation 230, pages 238-247.
Crossref
Xiao-Yuan Wang, Zhili Zhou, Xi Zhang, Ping Ji & Ji-Bo Wang. (2013) Several flow shop scheduling problems with truncated position-based learning effect. Computers & Operations Research 40:12, pages 2906-2929.
Crossref
Lin-Hui Sun, Kai Cui, Ju-Hong Chen, Jun Wang & Xian-Chen He. (2013) Some results of the worst-case analysis for flow shop scheduling with a learning effect. Annals of Operations Research 211:1, pages 481-490.
Crossref
Mohamed Haouari & Mohamed Kharbeche. (2013) An assignment-based lower bound for a class of two-machine flow shop problems. Computers & Operations Research 40:7, pages 1693-1699.
Crossref
Gang Li, Xiao-Yuan Wang, Ji-Bo Wang & Lin-Yan Sun. (2013) Worst case analysis of flow shop scheduling problems with a time-dependent learning effect. International Journal of Production Economics 142:1, pages 98-104.
Crossref
Wen-Hung Kuo, Chou-Jung Hsu & Dar-Li Yang. (2012) Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect. Information Sciences 184:1, pages 282-297.
Crossref
Tao Ren, Yuandong Diao & Xiaochuan Luo. (2012) Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems. Journal of Applied Mathematics 2012, pages 1-9.
Crossref
Ji-Bo Wang & Ming-Zheng Wang. (2011) Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Annals of Operations Research 191:1, pages 155-169.
Crossref
Zhiyong Xu, Linyan Sun & Juntao Gong. (2008) Worst-case analysis for flow shop scheduling with a learning effect. International Journal of Production Economics 113:2, pages 748-753.
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.