A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates

Rakrouki, Mohamed Ali; Kooli, Anis; Chalghoumi, Sabrine; Ladhari, Talel

doi:10.1007/s12351-017-0308-7

Cited by 10 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Large Job Instances (n ≥ 50) Below, we further test the performance of the proposed two heuristic algorithms together with the previous list scheduling algorithms with large job input instances. Especially, we consider two scenarios with regard to the variation range of the processing times of jobs, i.e., p j ∈ [5,10] or p j ∈ [8,10]. Similar to the case of small job input instances, three instances are generated for each combination (m, n), and the average results are reported in Tables 2 and 3, where the running time is in seconds.…”

Section: Small Job Instances (N ≤ 15)mentioning

confidence: 99%

“…In parallel machine scheduling, it generally contains two decision issues, i.e., sequencing and job assignment [2,3]. Various optimization objectives, including the makespan and the total completion time, have been well addressed in previous studies [4][5][6][7]. In addition to the above classical objectives, workload balance between the machines together with the corresponding operators is also a major aspect of decision making in manufacturing industry [8][9][10].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Identical Parallel Machine Scheduling Considering Workload Smoothness Index

2023

View full text Add to dashboard Cite

Workload balance is significant in the manufacturing industry. However, on the one hand, some existing specific criteria cannot achieve the minimization workload imbalance of parallel machines. On the other hand, there are few algorithms in existing studies that can effectively solve the parallel machine scheduling problem with the objective of minimizing workload imbalance. Inspired by this, we investigate an identical parallel machine scheduling problem with the objective of the minimum workload smoothness index. We first establish a mathematical model for the considered problem and then linearize its objective function. We prove the NP-hardness of the problem by reducing the PARTITION problem to it, and we provide both the upper bound and lower bound of the studied problem. An efficient genetic algorithm and an improved list scheduling algorithm are also proposed to efficiently address the considered problem. The numerical results demonstrate the effectiveness of the proposed methods.

show abstract

Section: Small Job Instances (N ≤ 15)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Identical Parallel Machine Scheduling Considering Workload Smoothness Index

2023

View full text Add to dashboard Cite

show abstract

“…, in the deterministic version, which is strongly Np-Hard [5] able to solve up to 50 jobs [19]. Due to the high complexity of this problem, heuristic methods have been ever the researchers' focus, for example, MINITI heuristic [6,20]. Rossi et al [21] proposed a simple highefficiency FF-RN heuristic method by modifying the NEH heuristic and compared it with the best simple heuristics of PFSSP reviewed [21].…”

Section: Literature Reviewmentioning

confidence: 99%

Robust and Stable Flow Shop Scheduling Problem under Uncertain Processing Times and Machines’ Disruption

Abtahi

Sahraeian

2021

IJE

View full text Add to dashboard Cite

This paper presents a predictive robust and stable approach for a two-machine flow shop scheduling problem with machine disruption and uncertain job processing time. Indeed, a general approach is proposed that can be used for robustness and stability optimization in an m-machine flow shop or job shop scheduling problem. The robustness measure is the total expected realized completion time. The expected sum of squared aberration between each jobs' completion time in the realized and initial schedules is the stability measure. We proposed and compared two methods to deal with such an NPhard problem; a method based on decomposing the problem into subproblem and solving each subproblem, and a theorem-based method. The extensive computational results indicated that the second method has a better performance in terms of robustness and stability, especially in large-sized problems. In other words, the second method is preferable because of the better manufacturer responsiveness to the customer and the production staff satisfaction enhancement.The expected real completion time of job j on the machine i

show abstract

“…Addressing the same problem, [27] proposed a branch and bound algorithm that yields better solutions compared to the earlier study. Reference [28] further improved the solution quality to the two-machine scheduling problem with time constraints in a reasonable computational time. Most recently, [29] analyzed the complexities involved in the scheduling problems with release time constraints in a service application area.…”

Section: Introductionmentioning

confidence: 99%

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times

et al. 2020

View full text Add to dashboard Cite

Production management of perishable goods is highly complex and requires well-informed decisions in corresponding stages. In such production environments, scheduling problems with time constraints are of high relevance to ensure the timely flow of the work-in-process material and goods. This study introduces the no-wait flowshop scheduling problem with release times (NWFSP-RT) to help advance decision support systems in the food production industry. For this purpose, an original mixed-integer linear programming (MILP) formulation is proposed for minimizing the makespan. Since Beam Search (BS) algorithm has been successfully applied to solve various scheduling problems, a BS algorithm, and an improved variant, the local search-based Beam Search (BSLS) algorithms are developed to solve the NWFSP-RT problem. Extensive numerical analysis is conducted to analyze the performance of the algorithms in solving this highly intractable extension of the scheduling problems. We showed that BSLS effectively avoids early convergence and local optimality while dismissing non-promising search directions within a partial enumeration solution approach. The statistical analysis confirmed that the improved BS algorithm performs better in terms of solution quality. Applications of the developed heuristic are worthwhile research topics to pursue in solving other complex optimization problems. INDEX TERMS Flowshop scheduling, no-wait, release time, Beam Search.

show abstract

A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates

Cited by 10 publications

References 20 publications

Identical Parallel Machine Scheduling Considering Workload Smoothness Index

Identical Parallel Machine Scheduling Considering Workload Smoothness Index

Robust and Stable Flow Shop Scheduling Problem under Uncertain Processing Times and Machines’ Disruption

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times

Contact Info

Product

Resources

About