Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags

Hamdi, Imen; Loukil, Taïcir

doi:10.1007/s11590-014-0761-7

Cited by 12 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These models are tested by running the CPLEX 11 solver on a DELL PC/2.20 GHz with 4.00 Go RAM. The tests are conducted on a set of generated instances following the scheme described in Hamdi and Loukil (2015b). The processing times and the minimal time lags are generated from a uniform distribution between 20 and 50 and [0, min ], respectively where min ∈ {0, 7, 14} .…”

Section: Computational Resultsmentioning

confidence: 99%

“…Also, they proposed some computationally efficient heuristics. Nearly at the same time, Hamdi and Loukil (2015b) extend the research about the permutation flowshop problem with minimal time lags by considering the case of m-machine and optimizing the total number of tardy jobs criterion. They proposed some heuristic procedures based on known and new rules.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Hamdi

Toumi

2019

J Ind Eng Int

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Hamdi

Toumi

2019

J Ind Eng Int

Self Cite

View full text Add to dashboard Cite

show abstract

“…LBBD applications to shop and factory scheduling include aircraft repair shop scheduling [6], job shop scheduling with human resurce constraints [51], permutation flowshop scheduling with time lags [52,53], one-machine scheduling problems [22,104,105], and flowshop planning and scheduling with deteriorating machines [7]. There is also an application to feature-based assembly planning [71].…”

Section: Shop Factory and Employee Schedulingmentioning

confidence: 99%

Logic-Based Benders Decomposition for Large-Scale Optimization

Hooker

2019

Springer Optimization and Its Applications

View full text Add to dashboard Cite

Logic-based Benders decomposition (LBBD) is a substantial generalization of classical Benders decomposition that, in principle, allows the subproblem to be any optimization problem rather than specifically a linear or nonlinear programming problem. It is amenable to a wide variety large-scale problems that decouple or otherwise simplify when certain decision variables are fixed. This chapter presents the basic theory of LBBD and explains how classical Benders decomposition is a special case. It also describes branch and check, a variant of LBBD that solves the master problem only once. It illustrates in detail how Benders cuts and subproblem relaxations can be developed for some planning and scheduling problems. It then describes the role of LBBD in three large-scale case studies. The chapter concludes with an extensive survey of the LBBD literature, organized by problem domain, to allow the reader to explore how Benders cuts have been developed for a wide range of applications.

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%

“…[16] proposed a Branch and Bound algorithm to solve the permutation flowshop scheduling problem with minimal time lags to minimize the total tardiness. Then, [14] developed an upper and lower bounds for the problem with minimal time lags. Also, other researches used the Mixed Integer Linear Programming to solve the permutation flowshop scheduling problem with time lags.…”

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

Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags

Cited by 12 publications

References 15 publications

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

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

Logic-Based Benders Decomposition for Large-Scale Optimization

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

Contact Info

Product

Resources

About