369
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

Open shop scheduling problem to minimize total weighted completion time

, , &
Pages 98-112 | Received 06 Jul 2015, Accepted 02 Mar 2016, Published online: 18 Apr 2016

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

Read on this site (5)

Levi R. Abreu, Marcelo S. Nagano & Bruno A. Prata. (2023) A new two-stage constraint programming approach for open shop scheduling problem with machine blocking. International Journal of Production Research 61:24, pages 8560-8579.
Read now
Zhe Zhang, Xiaoling Song, Xue Gong, Yong Yin, Benjamin Lev & Xiaoyang Zhou. (2023) An effective heuristic based on 3-opt strategy for seru scheduling problems with learning effect. International Journal of Production Research 61:6, pages 1938-1954.
Read now
Levi Ribeiro de Abreu, Kennedy Anderson Guimarães Araújo, Bruno de Athayde Prata, Marcelo Seido Nagano & João Vitor Moccellin. (2022) A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization 54:9, pages 1563-1582.
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
Fuhong Jiang, Xingong Zhang, Danyu Bai & Chin-Chia Wu. (2018) Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop. Engineering Optimization 50:4, pages 684-697.
Read now

Articles from other publishers (10)

Yaping Fu, Haobin Li, Min Huang & Hui Xiao. (2023) Bi-Objective Modeling and Optimization for Stochastic Two-Stage Open Shop Scheduling Problems in the Sharing Economy. IEEE Transactions on Engineering Management 70:10, pages 3395-3409.
Crossref
Lanjun Wan, Haoxin Zhao, Xueyan Cui, Changyun Li & Xiaojun Deng. 2023. Advanced Intelligent Computing Technology and Applications. Advanced Intelligent Computing Technology and Applications 109 123 .
Bruno de Athayde Prata, Carlos Diego Rodrigues & Jose Manuel Framinan. (2022) A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. Expert Systems with Applications 189, pages 116097.
Crossref
Erica Pastore, Arianna Alfieri, Claudio Castiglione, Gaia Nicosia & Fabio Salassa. (2022) A Matheuristic Approach to the Open Shop Scheduling Problem with Sequence-Dependent Setup Times*. IFAC-PapersOnLine 55:10, pages 2167-2172.
Crossref
Tamer F. Abdelmaguid. (2021) Bi-objective dynamic multiprocessor open shop scheduling for maintenance and healthcare diagnostics. Expert Systems with Applications 186, pages 115777.
Crossref
Minghai Yuan, Yadong Li, Lizhi Zhang & Fengque Pei. (2021) Research on intelligent workshop resource scheduling method based on improved NSGA-II algorithm. Robotics and Computer-Integrated Manufacturing 71, pages 102141.
Crossref
J. Behnamian, S. Memar Dezfooli & H. Asgari. (2021) A scatter search algorithm with a novel solution representation for flexible open shop scheduling: a multi-objective optimization. The Journal of Supercomputing.
Crossref
Gonzalo Mejía & Francisco Yuraszeck. (2020) A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times. European Journal of Operational Research 285:2, pages 484-496.
Crossref
Li-Ning Xing, Yuanyuan Liu, Haiyan Li, Chin-Chia Wu, Win-Chin Lin & Wu Song. (2020) A Hybrid Discrete Differential Evolution Algorithm to Solve the Split Delivery Vehicle Routing Problem. IEEE Access 8, pages 207962-207972.
Crossref
Wen-Chiung Lee & Jen-Ya Wang. (2018) Minimizing the Total Weighted Completion Time for Three Cooperating Agents. Minimizing the Total Weighted Completion Time for Three Cooperating Agents.

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.