A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags

2015 ◽  
Vol 23 (4) ◽  
pp. 387 ◽  
Author(s):  
Imen Hamdi ◽  
Ammar Oulamara ◽  
Taïcir Loukil
Keyword(s):  
Branch And Bound ◽  
Total Tardiness ◽  
Branch And Bound Algorithm ◽  
Time Lags ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Permutation Flowshop ◽  
Minimal Time ◽  
Flowshop Scheduling Problem

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

2021 ◽  
pp. 23-23
Author(s):  
Fatmah Almathkour ◽  
Omar Belgacem ◽  
Said Toumi ◽  
Bassem Jarboui
Keyword(s):  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Total Weighted Tardiness ◽  
Time Lags ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Permutation Flowshop ◽  
Weighted Tardiness ◽  
Time Requirements ◽  
Flowshop Scheduling Problem

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.

scholarly journals MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags

2019 ◽  
Vol 15 (S1) ◽  
pp. 223-229
Author(s):  
Imen Hamdi ◽  
Saïd Toumi
Keyword(s):  
Mixed Integer Linear Programming ◽  
Valid Inequalities ◽  
Mixed Integer ◽  
Time Lags ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Permutation Flowshop ◽  
Feasible Schedule ◽  
Minimal Time ◽  
Flowshop Scheduling Problem

Abstract In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim to tighten the models’ representations. One of them is based on dominance rules from the literature. Then, we provide the results of extensive computational experiments used to measure the performance of the proposed MILP models. They are shown to be able to solve optimally instances until the size 40-job and even several larger problem classes, with up to 60 jobs. Furthermore, we can distinguish the effect of the minimal time lags and the inclusion of the valid inequalities in the basic MILP model on the results.

Sign in / Sign up

Export Citation Format

Share Document