A branch and bound algorithm for the two-stage assembly scheduling problem (Q1280185): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank | |||
Normal rank | |||
Revision as of 17:52, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the two-stage assembly scheduling problem |
scientific article |
Statements
A branch and bound algorithm for the two-stage assembly scheduling problem (English)
0 references
6 October 1999
0 references
branch and bound
0 references
two-stage assembly scheduling
0 references
maximum completion time
0 references
makespan
0 references
0 references
0 references
