Heuristic algorithms for two machine re-entrant flow shop (Q930923): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimizing makespan on a two-machine re-entrant flowshop / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition methods for reentrant flow shops with sequence-dependent setup times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A heuristic algorithm for two-machine re-entrant shop scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Batching and Scheduling in FMS Hubs: Flow Time Considerations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing makespan in re-entrant permutation flow-shops / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3525911 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing Makespan in a Class of Reentrant Shops / rank | |||
Normal rank | |||
Latest revision as of 12:30, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic algorithms for two machine re-entrant flow shop |
scientific article |
Statements
Heuristic algorithms for two machine re-entrant flow shop (English)
0 references
24 June 2008
0 references
scheduling
0 references
re-entrant flow shop
0 references
makespan
0 references
heuristic algorithm
0 references
