Optimizing blocking flow shop scheduling problem with total completion time criterion

The blocking flow shop scheduling problem has found many applications in manufacturing systems. There are a few exact methods for solving this problem with different criteria. In this paper, efforts will be made to optimize the total completion time criterion for this problem. We present two mixed b...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 40; číslo 7; s. 1874 - 1883
Hlavní autoři:	Moslehi, Ghasem, Khorasanian, Danial
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier Ltd 01.07.2013 Elsevier Pergamon Press Inc
Témata:	Algorithms Applied sciences Blocking flow shop Branch & bound algorithms Branch and bound Completion time Criteria Dominance Exact sciences and technology Integer programming Inventory control, production control. Distribution Job shops Machine shops Mathematical models Mathematical problems Mathematical programming Mixed binary integer programming model Operational research and scientific management Operational research. Management science Optimization Production scheduling Scheduling Scheduling, sequencing Studies Total completion time Scheduling Blocking flow shop Mixed binary integer programming model Branch and bound Total completion time Production system Lower bound Branch and bound method Blocking Dominance Mixed integer programming Makespan Optimization Upper bound Deadtime Idle time Implicit enumeration method Problem solving Flow shop
ISSN:	0305-0548, 1873-765X, 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!