A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment (Q1806642): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving a bicriterion scheduling problem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:59, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment |
scientific article |
Statements
A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment (English)
0 references
8 November 1999
0 references
multiple-product resource-constrained scheduling
0 references
flexible manufacturing system
0 references
resource flexibility
0 references
0-1 integer linear programming
0 references
branch and bound
0 references
