101
Views
16
CrossRef citations to date
0
Altmetric
General Paper

Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time

, , &
Pages 709-719 | Received 08 Jan 2014, Accepted 17 Apr 2014, Published online: 21 Dec 2017

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

Read on this site (3)

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
Hongfeng Wang, Yaping Fu, Min Huang & Junwei Wang. (2016) Multiobjective optimisation design for enterprise system operation in the case of scheduling problem with deteriorating jobs. Enterprise Information Systems 10:3, pages 268-285.
Read now

Articles from other publishers (13)

Hua Chen, Lin Chen & Guochuan Zhang. (2024) FPT algorithms for a special block-structured integer program with applications in scheduling. Mathematical Programming.
Crossref
Hatice VURĞUN KOÇ & Ertan GÜNER. (2023) Akış Atölyesi Çizelgeleme Probleminin Sistematik Literatür Taraması ve Bütünsel Bir ÇerçevesiA Systematic Literature Review and An Integrated Framework of the Flowshop Scheduling Problem. Verimlilik Dergisi 57:3, pages 577-594.
Crossref
Lijun He, Raymond Chiong & Wenfeng Li. (2022) Energy-efficient open-shop scheduling with multiple automated guided vehicles and deteriorating jobs. Journal of Industrial Information Integration 30, pages 100387.
Crossref
Wenhan Li, Xiaolong Chen, Junqing Li, Hongyan Sang, Yuyan Han & Shubo Du. (2022) An improved iterated greedy algorithm for distributed robotic flowshop scheduling with order constraints. Computers & Industrial Engineering 164, pages 107907.
Crossref
Xiaochun Feng & Xiangpei Hu. (2021) A Heuristic Solution Approach to Order Batching and Sequencing for Manual Picking and Packing Lines considering Fatiguing Effect. Scientific Programming 2021, pages 1-17.
Crossref
Shaojun Lu, Xinbao Liu, Jun Pei & Panos M. Pardalos. (2018) Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines. Optimization Letters 15:2, pages 537-551.
Crossref
Yaping Fu, MengChu Zhou, Xiwang Guo & Liang Qi. (2020) Scheduling Dual-Objective Stochastic Hybrid Flow Shop With Deteriorating Jobs via Bi-Population Evolutionary Algorithm. IEEE Transactions on Systems, Man, and Cybernetics: Systems 50:12, pages 5037-5048.
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
Wen-Chiung Lee & Jen-Ya Wang. (2020) A three-agent scheduling problem for minimizing the flow time on two machines. RAIRO - Operations Research 54:2, pages 307-323.
Crossref
Stanisław Gawiejnowicz. (2020) A review of four decades of time-dependent scheduling: main results, new topics, and open problems. Journal of Scheduling 23:1, pages 3-47.
Crossref
Mehdi Mrad, Sabrine Chalghoumi, Talel Ladhari & Anis Gharbi. (2017) Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates. International Transactions in Operational Research 26:6, pages 2432-2449.
Crossref
Derya Deliktas, Orhan Torkul & Ozden Ustun. (2017) A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method. International Transactions in Operational Research 26:6, pages 2410-2431.
Crossref
Yaping Fu, Hongfeng Wang, Guangdong Tian, Zhiwu Li & Hesuan Hu. (2018) Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm. Journal of Intelligent Manufacturing 30:5, pages 2257-2272.
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.