2012
DOI: 10.1007/s00170-012-4035-1
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling compound trucks in multi-door cross-docking terminals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0
4

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 32 publications
(26 citation statements)
references
References 14 publications
0
22
0
4
Order By: Relevance
“…1: [(1, 57), (4,12), (6,12)]; 2: [(2, 66), (4,12), (6,14)]; 3: [ (4,14), (5,55), (6,13)]; 4: [ (3,78), (4,13), (6,15)]. This problem is solved by the proposed algorithm of section 3 for three cases.…”
Section: Page 29 Of 46mentioning
confidence: 94%
See 4 more Smart Citations
“…1: [(1, 57), (4,12), (6,12)]; 2: [(2, 66), (4,12), (6,14)]; 3: [ (4,14), (5,55), (6,13)]; 4: [ (3,78), (4,13), (6,15)]. This problem is solved by the proposed algorithm of section 3 for three cases.…”
Section: Page 29 Of 46mentioning
confidence: 94%
“…The quantity of products in inbound trucks is as follows according to the format inbound truck: [(product type, quantity). (1,13), (2,12), (3,21)]. This problem is solved by the proposed algorithm of section 3 for three cases.…”
Section: Scheduling a Cross Docking Problem With Three Inbound Trucksmentioning
confidence: 98%
See 3 more Smart Citations