EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On Bornological Structure

Anwar.N.I, Sh.K.Said Husain

Academic Science Journal · 2024

DOI: 10.24237/asj.02.02.764b ↗

Kurz gefasst

Fachartikel in der Zeitschrift Academic Science Journal, 2024. Verfasst von Anwar.N.I und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For multi criteria sequencing problem on one machine, we propose a modified branch and bound algorithm (MBAB) to find efficient (pareto optimal) solutions in this paper. The criteria are total completion time ( ), total lateness ( ), and maximum tardiness (Tmax). A collection of n independent tasks(jobs) has to be sequenced on one machine , tasks(jobs)j (j=1,2,3,…..,n) requires processing time Pj and due data dj . The MBAB algorithm depends on branch and bound technique. Applied examples are used to show applicability of MBAB algorithm. The MBAB algorithm is compared with complete enumeration method (CEM). Conclusions are formulated on the performance of the (MBAB) algorithm.

Zitieren

APA

Anwar.N.I, & Husain, S. (2024). On Bornological Structure. Academic Science Journal. https://doi.org/10.24237/asj.02.02.764b

Vancouver

Anwar.N.I, Husain S. On Bornological Structure. Academic Science Journal. 2024. doi:10.24237/asj.02.02.764b

BibTeX
@article{AnwarNI2024,
  author = {Anwar.N.I and Husain, Sh.K.Said},
  title = {On Bornological Structure},
  journal = {Academic Science Journal},
  year = {2024},
  doi = {10.24237/asj.02.02.764b}
}
Kostenlos starten →