A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2011.06.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2011.06.013 / rank | |||
Normal rank | |||
Latest revision as of 01:19, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system |
scientific article |
Statements
A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (English)
0 references
14 May 2012
0 references
heuristics
0 references
distribution systems
0 references
assignment
0 references
routing
0 references
scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
