Single machine scheduling problem for minimizing total tardiness of a weighted jobs in a batch delivery system, stochastic rework and reprocessing times

Poongothai, V.; Godhandaraman, P.; Jenifer, A. Arockia

doi:10.1063/1.5112317

Cited by 5 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are many objectives must be satisfied like number of late jobs, total lateness and completion time. The single machine, closed shop, flow shop, open shop and hybrid job shop are as considered as scheduling [2]. In this study, we introduced one of single machine problems, so that (1/ / (∑ 𝐶 𝜎 𝑗 + 𝑅 𝐿 + 𝑇 𝑚𝑎𝑥 )) is minimized.…”

Section: Introductionmentioning

confidence: 99%

Exact Method with Dominance Rules for Solving Scheduling on a Single Machine Problem with Multiobjective Function

Ahmed¹,

Ali

2022

MJS

View full text Add to dashboard Cite

The present article proposes an exact algorithm for the single-machine scheduling problem to minimize the sum of total completion times, range of lateness and maximum tardiness on a single machine (1/ /(∑ C_(σ_j + R_L + T_max)), where machine idle time is prohibited. In this paper, one of the multiobjective function problem for single criteria on just one machine is being studied. To obtain the optimal solution for the suggested problem, we propose to use Branch and Bound method (BAB) depending upon some dominance rules. This exact method used new technique to obtain three upper bounds (UB) and single lower bound (LB). The proposed BAB method proved its sufficiency by the practical results for n ≤ 15 in a reasonable time. Lastly, we proved a theorem as special case for our problem.

show abstract

Section: Introductionmentioning

confidence: 99%

Exact Method with Dominance Rules for Solving Scheduling on a Single Machine Problem with Multiobjective Function

Ahmed¹,

Ali

2022

MJS

View full text Add to dashboard Cite

show abstract

“…Despite the passage of over 40 years this problem is still attractive to many researchers. Therefore, its various variants are considered in the papers published in recent years: Cordone and Hosteins [3], Rostami et al [4], Poongothai et al [5], Gafarow and Werner [6] polynomial algorithms for special cases) Ertem et al [7]. A comprehensive review of the literature on scheduling problems with critical lines is presented in the following papers: Chenga, et al [8], Adamu and Adewumi [9].…”

Section: Introductionmentioning

confidence: 99%

Parallel Algorithm with Blocks for a Single-Machine Total Weighted Tardiness Scheduling Problem

Uchroński

2021

Applied Sciences

View full text Add to dashboard Cite

In this paper, the weighted tardiness single-machine scheduling problem is considered. To solve it an approximate (tabu search) algorithm, which works by improving the current solution by searching the neighborhood, is used. Methods of eliminating bad solutions from the neighborhood (the so-called block elimination properties) were also presented and implemented in the algorithm. Blocks allow a significant shortening of the process of searching the neighborhood generated by insert type moves. The designed parallel tabu search algorithm was implemented using the MPI (Message Passing Interface) library. The obtained speedups are very large (over 60,000×) and superlinear. This may be a sign that the parallel algorithm is superior to the sequential one as the sequential algorithm is not able to effectively search the solution space for the problem under consideration. Only the introduction of diversification process through parallelization can provide an adequate coverage of the entire search process. The current methods of parallelization of metaheuristics give a speedup which strongly depends on the problem’s instances, rarely greater than number of used parallel processors. The method proposed here allows the obtaining of huge speedup values (over 60,000×), but only when so-called blocks are used. The above-mentioned speedup values can be obtained on high performance computing infrastructures such as clusters with the use of MPI library.

show abstract

Lunar cycle inspired PSO for single machine total weighted tardiness scheduling problem

2021

View full text Add to dashboard Cite

Single machine scheduling problem for minimizing total tardiness of a weighted jobs in a batch delivery system, stochastic rework and reprocessing times

Cited by 5 publications

References 14 publications

Exact Method with Dominance Rules for Solving Scheduling on a Single Machine Problem with Multiobjective Function

Exact Method with Dominance Rules for Solving Scheduling on a Single Machine Problem with Multiobjective Function

Parallel Algorithm with Blocks for a Single-Machine Total Weighted Tardiness Scheduling Problem

Lunar cycle inspired PSO for single machine total weighted tardiness scheduling problem

Contact Info

Product

Resources

About