310
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

Permutation flow-shop scheduling problem to optimize a quadratic objective function

, , , , &
Pages 1589-1603 | Received 21 Jun 2016, Accepted 07 Nov 2016, Published online: 08 Dec 2016

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

Read on this site (6)

Xin-Na Geng, Ji-Bo Wang & Danyu Bai. (2019) Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Engineering Optimization 51:8, pages 1301-1323.
Read now
Lin-Hui Sun, Chen-Chen Ge, Wei Zhang, Ji-Bo Wang & Yuan-Yuan Lu. (2019) Permutation flowshop scheduling with simple linear deterioration. Engineering Optimization 51:8, pages 1281-1300.
Read now
Xin Chen, Zhongyu Wang, Erwin Pesch, Malgorzata Sterna & Jacek Błażewicz. (2019) Two-machine flow-shop scheduling to minimize total late work: revisited. Engineering Optimization 51:7, pages 1268-1278.
Read now
Feng Liu, Jing Yang & Yuan-Yuan Lu. (2019) Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs. Engineering Optimization 51:5, pages 862-874.
Read now
Ji-Bo Wang & Xi-Xi Liang. (2019) Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint. Engineering Optimization 51:2, pages 231-246.
Read now
Hangfei Huang & Keping Li. (2017) Train timetable optimization for both a rail line and a network with graph-based approaches. Engineering Optimization 49:12, pages 2133-2149.
Read now

Articles from other publishers (9)

Tasnim Mraihi, Olfa Belkahla Driss & Hind Bril EL-Haouzi. (2024) Distributed Permutation Flow Shop Scheduling Problem with Worker flexibility: Review, trends and model proposition. Expert Systems with Applications 238, pages 121947.
Crossref
Danyu Bai, Xiaoyuan Bai, Haoran Li, Quan-ke Pan, Chin-Chia Wu, Liang Gao, Meiting Guo & Lin Lin. (2022) Blocking flowshop scheduling problems with release dates. Swarm and Evolutionary Computation 74, pages 101140.
Crossref
Xinyue Wang, Tao Ren, Danyu Bai, Chinenye Ezeh, Haodong Zhang & Zhuoran Dong. (2022) Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates. Swarm and Evolutionary Computation 69, pages 100996.
Crossref
Danyu Bai, Xiaoyuan Bai, Jie Yang, Xingong Zhang, Tao Ren, Chenxi Xie & Bingqian Liu. (2021) Minimization of maximum lateness in a flowshop learning effect scheduling with release dates. Computers & Industrial Engineering 158, pages 107309.
Crossref
Caio Paziani Tomazella & Marcelo Seido Nagano. (2020) A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem. Expert Systems with Applications 158, pages 113556.
Crossref
Danyu Bai, Hanyu Xue, Ling Wang, Chin-Chia Wu, Win-Chin Lin & Danladi H. Abdulkadir. (2020) Effective algorithms for single-machine learning-effect scheduling to minimize completion-time-based criteria with release dates. Expert Systems with Applications 156, pages 113445.
Crossref
Yuyan He, Aihu Wang, Hailiang Su & Mengyao Wang. (2019) Particle Swarm Optimization Using Neighborhood-Based Mutation Operator and Intermediate Disturbance Strategy for Outbound Container Storage Location Assignment Problem. Mathematical Problems in Engineering 2019, pages 1-13.
Crossref
Kai-Cheng Wei, Xue Sun, Hsun Chu & Chao-Chin Wu. (2017) Reconstructing permutation table to improve the Tabu Search for the PFSP on GPU. The Journal of Supercomputing 73:11, pages 4711-4738.
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

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.