EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Local Search Methods and Some Dominance Rules of Minimizing Multi-Objectives with Release Date and Setup Time of Families on Two-Machine Flow Shop Scheduling

Sajjad Majeed Jasim, Marwa Bunyan Kadhim, Hanan Ali chachan

Boletim da Sociedade Paranaense de Matemática · 27.10.2026 · 44 · 1-11

DOI: 10.5269/bspm.84783 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 27.10.2026. Verfasst von Sajjad Majeed Jasim und 2 weiteren Autor:innen. Die Arbeit nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study investigates a flow shop scheduling problem with constraints on the first machine, including job release times $r_i$ and family setup times $S_f$. The objective is to minimize a multi-objective function combining total completion time, total tardiness, and total late work: $F_2/r_j,S_f/\sum_{k=1}^m\sum_{f=1}^F\sum_{j=1}^{n_f}(C_{kj_f} +T_{kj_f}+V_{kj_f })$. The problem is NP-hard, and a set of structural and dominance rules was derived to enhance the Branch and Bound (BAB) procedure. Two metaheuristic methods, Genetic Algorithm (GA) and Simulated Annealing (SA), were applied to obtain high-quality solutions, and a hybrid algorithm combining both approaches was proposed to improve exploration and exploitation. Computational results show that the hybrid approach outperforms the individual methods in terms of solution quality and stability, maintaining high performance even for large-scale instances with up to $n\leq 9000$.

Zitieren

APA

Jasim, S. M., Kadhim, M. B., & chachan, H. A. (2026). Local Search Methods and Some Dominance Rules of Minimizing Multi-Objectives with Release Date and Setup Time of Families on Two-Machine Flow Shop Scheduling. Boletim da Sociedade Paranaense de Matemática, 44, 1-11. https://doi.org/10.5269/bspm.84783

Vancouver

Jasim SM, Kadhim MB, chachan HA. Local Search Methods and Some Dominance Rules of Minimizing Multi-Objectives with Release Date and Setup Time of Families on Two-Machine Flow Shop Scheduling. Boletim da Sociedade Paranaense de Matemática. 2026;44:1-11. doi:10.5269/bspm.84783

BibTeX
@article{Jasim2026,
  author = {Jasim, Sajjad Majeed and Kadhim, Marwa Bunyan and chachan, Hanan Ali},
  title = {Local Search Methods and Some Dominance Rules of Minimizing Multi-Objectives with Release Date and Setup Time of Families on Two-Machine Flow Shop Scheduling},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2026},
  volume = {44},
  pages = {1--11},
  doi = {10.5269/bspm.84783}
}
Kostenlos starten →