164
Views
17
CrossRef citations to date
0
Altmetric
General Paper

A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint

&
Pages 1542-1554 | Received 22 Nov 2013, Accepted 28 Oct 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 (4)

Zhe Zhang, Xue Gong, Xiaoling Song, Yong Yin, Benjamin Lev & Xiaoyang Zhou. (2023) A nonanticipatory policy for stochastic seru scheduling problems. Journal of the Operational Research Society 0:0, pages 1-12.
Read now
Wenhui Yang, Lu Chen & Stèphane Dauzère-Pèrés. (2022) A dynamic optimisation approach for a single machine scheduling problem with machine conditions and maintenance decisions. International Journal of Production Research 60:10, pages 3047-3062.
Read now
Ahlam Azzamouri, Najat Bara, Selwa Elfirdoussi, Imane Essaadi, Frédéric Fontane & Vincent Giard. (2020) DSS approach for heterogeneous parallel machines scheduling considering proximate supply chain constraints. International Journal of Production Research 58:18, pages 5502-5520.
Read now
Lu Zhen, Hao Hao, Xin Shi, Lufei Huang & Yi Hu. (2018) Task assignment and sequencing decision model under uncertain available time of service providers. Journal of the Operational Research Society 69:12, pages 1935-1946.
Read now

Articles from other publishers (13)

Chung-Ho Su & Jen-Ya Wang. (2022) A makespan minimization problem for versatile developers in the game industry. RAIRO - Operations Research 56:6, pages 3895-3913.
Crossref
Chung-Ho Su & Jen-Ya Wang. (2022) A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers. Mathematics 10:7, pages 1200.
Crossref
Khodakaram Salimifard, Jingpeng Li, Davood Mohammadi & Reza Moghdani. (2020) A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs. Applied Intelligence 51:7, pages 4143-4161.
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
Deming Lei & Meiyao Liu. (2020) An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance. Computers & Industrial Engineering 141, pages 106320.
Crossref
Jen-Ya Wang, Meng-Wei Chen & Kuen-Fang Jea. (2020) Minimizing the Total Tardiness of a Game Project Considering the Overlap Effect. IEEE Access 8, pages 216507-216518.
Crossref
Kai Li, Wei Xiao & ShanLin Yang. (2019) Minimizing total tardiness on two uniform parallel machines considering a cost constraint. Expert Systems with Applications 123, pages 143-153.
Crossref
Yaping Fu, Guanjie Jiang, Guangdong Tian & Zhenling Wang. (2018) Job scheduling and resource allocation in parallel‐machine system via a hybrid nested partition method. IEEJ Transactions on Electrical and Electronic Engineering 14:4, pages 597-604.
Crossref
Almasarwah Najat, Chen Yuan, Suer Gursel & Yuan Tao. (2019) Minimizing the Number of Tardy Jobs on Identical Parallel Machines Subject to Periodic Maintenance. Procedia Manufacturing 38, pages 1409-1416.
Crossref
Kai Li, Wei Xiao & Shan-lin Yang. (2019) Scheduling uniform manufacturing resources via the Internet: A review. Journal of Manufacturing Systems 50, pages 247-262.
Crossref
Hongtao Hu, Yiwei Wu & Tingsong Wang. (2018) A Metaheuristic Method for the Task Assignment Problem in Continuous-Casting Production. Discrete Dynamics in Nature and Society 2018, pages 1-12.
Crossref
Yaping Fu, Guangdong Tian, Zhiwu Li & Zhenling Wang. (2018) Parallel machine scheduling with dynamic resource allocation via a master–slave genetic algorithm. IEEJ Transactions on Electrical and Electronic Engineering 13:5, pages 748-756.
Crossref
Oliver Herr & Asvin Goel. (2016) Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints. European Journal of Operational Research 248:1, pages 123-135.
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.