A case study of a hybrid flow shop with no-wait and limited idle time to minimize material waste

Harbaoui, Houda; Khalfallah, Sofiane; Bellenguez‐Morineau, Odile

doi:10.1109/sisy.2017.8080554

Cited by 6 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another type is "minimal idle"-though in practice this is modeled similarly to setups. Similarly, a "limited idle" or "maximal idle" time can be imposed as well [15]. Finally, both the minimal and maximal idle time constraints can be enforced at the same time.…”

Section: Problem Constraintsmentioning

confidence: 99%

“…In order to better model real-life situations, more specific problem variants with additional constraints are considered. Such constraints may include, for example, transport times [12], setups [13], limited buffers [14] or idle times [15]. As a result, state-of-the-art solving methods often have to employ problem-specific properties to be efficient.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Parallel Makespan Calculation for Flow Shop Scheduling Problem with Minimal and Maximal Idle Time

Rudy

2021

Applied Sciences

View full text Add to dashboard Cite

In this paper, a flow shop scheduling problem with minimal and maximal machine idle time with the goal of minimizing makespan is considered. The mathematical model of the problem is presented. A generalization of the prefix sum, called the job shift scan, for computing required shifts for overlapping jobs is proposed. A work-efficient algorithm for computing the job shift scan in parallel for the PRAM model with n processors is proposed and its time complexity of O(logn) is proven. Then, an algorithm for computing the makespan in time O(mlogn) in parallel using the prefix sum and job shift scan is proposed. Computer experiments on GPU were conducted using the CUDA platform. The results indicate multi-thread GPU vs. single-thread GPU speedups of up to 350 and 1000 for job shift scan and makespan calculation algorithms, respectively. Multi-thread GPU vs. single-thread CPU speedups up to 4.5 and 14.7, respectively, were observed as well. The experiments on the Taillard-based problem instances using a simulated annealing solving method and employing the parallel makespan calculation show that the method is able to perform many more iterations in the given time limit and obtain better results than the non-parallel version.

show abstract

Section: Problem Constraintsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Parallel Makespan Calculation for Flow Shop Scheduling Problem with Minimal and Maximal Idle Time

Rudy

2021

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…In Harbaoui et al (2017), the problem of waste due to machine idle-time in a hybrid flowshop is tackled. The problem occurs in an industrial case of pasta production where the machines need to be cleaned if production is interrupted for more than 30 minutes, resulting in wasted material.…”

Section: Idle Time Considerationsmentioning

confidence: 99%