A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan (Q1296660): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Heuristic for Three-Machine Flow Shop Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
Latest revision as of 20:25, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan |
scientific article |
Statements
A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan (English)
0 references
2 August 1999
0 references
scheduling
0 references
hybrid flowshop
0 references
heuristics
0 references
