A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach

•A bi-objective unit-time job shop scheduling is modeled as a mixed graph coloring.•A new branch-and-bound and an epsilon-constraint algorithms address bi-objective mixed graph coloring.•A new lower bound is proposed for the sum of path-endpoints coloring.•The lower bound improves considerably upon...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 132; S. 105319
Hauptverfasser:	KOUIDER, Ahmed, AIT HADDADÈNE, Hacène
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.08.2021 Pergamon Press Inc
Schlagworte:	[formula omitted]-constraint Algorithms Benchmarks Bi-objective branch-and-bound Completion time Graph coloring Job shop scheduling Job shops Lower bounds Mixed graph coloring Multiobjective optimization Operations research Optimization Performance measurement Scheduling constraint Scheduling Bi-objective branch-and-bound Multiobjective optimization Mixed graph coloring
ISSN:	0305-0548, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!