Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags

Hamdi, Imen; Loukil, Taïcir

doi:10.1007/s12351-014-0166-5

Cited by 14 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, there are also studies with different scheduling measures. Hamdi and Loukil [29] developed a heuristic algorithm and a Lagrangian relaxation-based lower bound strategy for minimizing total tardiness, while Dhouib et al [30] proposed simulated annealing algorithms to hierarchically minimize the number of tardy jobs and the makespan for a flow shop.…”

Section: Previous Studiesmentioning

confidence: 99%

Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times

2021

View full text Add to dashboard Cite

This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to minimize a weighted sum of total tardiness of urgent jobs and the makespan of normal jobs. This problem is formulated in mixed integer programming (MIP). By using a commercial optimization solver, the MIP can be used to find an optimal solution. However, because this problem is proved to be NP-hard, solving to optimality requires a significantly long computation time for a practical size problem. Therefore, this study adopts metaheuristic algorithms to obtain a good solution quickly. To complete this, two metaheuristic algorithms (an iterated greedy algorithm and a simulated annealing algorithm) are proposed, and a series of computational experiments were performed to examine the effectiveness and efficiency of the proposed algorithms.

show abstract

Section: Previous Studiesmentioning

confidence: 99%

Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times

2021

View full text Add to dashboard Cite

show abstract

“…The first research to solve the problem with time lags for two machine flowshop and jobshop is given by [6]. Many authors [9], [16], [14], [19], [18], [20], [21], [13], [15] and [17] used an exact methods for solving this problem. Let consider the work of [9] in which the researchers aims to minimize the makespan criterion for m machines with Branch and Bound algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…[21] solved the makespan and maximum tardiness criteria for work force scheduling with position dependent processing times based on mixed integer linear programming. Then, [13] proposed a formulation for the permutation scheduling problem with time lags for the total tardiness criterion. The same authors [15] proposed a new mixed integer linear programming models to solve the problem with time lags that emphasize an effective strategy for determining a lower bound for the total earliness and tardiness criteria.…”

Section: Introductionmentioning

confidence: 99%

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

Almathkour

Belgacem

Toumi

et al. 2022

YUGOSLAV J OPERATION

View full text Add to dashboard Cite

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.

show abstract

“…e study in [24,25] consider flowshop problems with time lag constraints and develop a simulated annealing algorithm and a constructive heuristic algorithm with and insertion mechanism, respectively. On the other hand, for a flowshop problem with LWT for the objective of minimizing total tardiness, a heuristic algorithm and a Lagrangian relaxation-based lower bound strategy [26] have been developed.…”

Section: Introductionmentioning

confidence: 99%

A Genetic Algorithm for a Two-Machine Flowshop with a Limited Waiting Time Constraint and Sequence-Dependent Setup Times

Lee

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This study considers a two-machine flowshop with a limited waiting time constraint between the two machines and sequence-dependent setup times on the second machine. These characteristics are motivated from semiconductor manufacturing systems. The objective of this scheduling problem is to minimize the total tardiness. In this study, a mixed-integer linear programming formulation was provided to define the problem mathematically and used to find optimal solutions using a mathematical programming solver, CPLEX. As CPLEX required a significantly long computation time because this problem is known to be NP-complete, a genetic algorithm was proposed to solve the problem within a short computation time. Computational experiments were performed to evaluate the performance of the proposed algorithm and the suggested GA outperformed the other heuristics considered in the study.

show abstract

Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags

Cited by 14 publications

References 12 publications

Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times

Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times

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

A Genetic Algorithm for a Two-Machine Flowshop with a Limited Waiting Time Constraint and Sequence-Dependent Setup Times

Contact Info

Product

Resources

About