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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 132; s. 105319
Hlavní autoři:	KOUIDER, Ahmed, AIT HADDADÈNE, Hacène
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.08.2021 Pergamon Press Inc
Témata:	[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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!