A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates

We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration. Computational experiments, on a large set of randomly...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operational research Ročník 20; číslo 1; s. 21 - 35
Hlavní autoři: Rakrouki, Mohamed Ali, Kooli, Anis, Chalghoumi, Sabrine, Ladhari, Talel
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020
Springer Nature B.V
Témata:
Algorithms
Business and Management
Completion time
Computational Intelligence
Job shops
Lower bounds
Management Science
Operations Research
Operations Research/Decision Theory
Original Paper
Permutations
Production scheduling
Release dates
Branch-and-bound
Flowshop
Release dates
Total completion time
ISSN:1109-2858, 1866-1505
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!
Popis
Shrnutí:We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration. Computational experiments, on a large set of randomly generated instances, provide evidence that the proposed procedure performs consistently well.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1109-2858
1866-1505
DOI:10.1007/s12351-017-0308-7