Branch and bound crossed with GA to solve hybrid flowshops (Q1296101): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Branch and bound algorithm for the flow shop with multiple processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A multi-stage parallel-processor flowshop problem with minimum flowtime / rank | |||
Normal rank | |||
Revision as of 21:19, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch and bound crossed with GA to solve hybrid flowshops |
scientific article |
Statements
Branch and bound crossed with GA to solve hybrid flowshops (English)
0 references
10 September 2000
0 references
genetic algorithm
0 references
hybrid flowshop scheduling
0 references
branch-and-bound algorithm
0 references
heuristics
0 references
initial upper bound
0 references
