Scheduling dedicated jobs with variative processing times (Q5963650): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10878-014-9787-0 / rank | |||
Property / cites work | |||
Property / cites work: Minimizing maximum weight of subsets of a maximum matching in a bipartite graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Determining crane areas in intermodal transshipment yards: the yard partition problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling co-operating stacking cranes with predetermined container sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Assignment Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4323632 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10878-014-9787-0 / rank | |||
Normal rank |
Latest revision as of 13:40, 9 December 2024
scientific article; zbMATH DE number 6544338
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling dedicated jobs with variative processing times |
scientific article; zbMATH DE number 6544338 |
Statements
Scheduling dedicated jobs with variative processing times (English)
0 references
23 February 2016
0 references
bipartite graph
0 references
maximal matching
0 references
NP-hardness
0 references
integer linear programming
0 references
rail-rail yard
0 references