Branch and Bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags

  • Fatmah Bader Almathkour Kuwait University
  • Omar Belgacem University of Sfax, Tunisia
  • Said Toumi College of Business Administration, Majmaah University
  • Bassem Jarboui Higher Colleges of Technology, Abu Dhabi, UAE

Abstract

This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.

Author Biographies

Omar Belgacem, University of Sfax, Tunisia

MODILS Laboratory, Faculty of Economics and Management

Said Toumi, College of Business Administration, Majmaah University

Department of Business Administration, College of Business Administration, Majmaah University, Al Majmaah 11952, Saudi Arabia

Published
2022-03-21
How to Cite
ALMATHKOUR, Fatmah Bader et al. Branch and Bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags. Yugoslav Journal of Operations Research, [S.l.], v. 32, n. 1, p. 45–59, mar. 2022. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/1005>. Date accessed: 04 dec. 2024.
Citation Formats
Issue
Vol 32 No 1 (2022)
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.