ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM

This paper considers a bi-criteria planning problems on a single machine, with the goal of minimizing total square time duration and maximizing earliness. To solve this problem we have to find the Pareto set. We introduced a strong relation between lower bound, upper bound  of the problem and the nu...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Tikrit Journal of Pure Science 2023-01, Vol.27 (6), p.88-91
Hauptverfasser:	Rzgar F. Mahmood, Ayad Mohammed Ramadan, Mediya B. Mrakhan, Nasyar Hussein Qader4
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!