FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC (Q3503068): Difference between revisions

Latest revision as of 09:49, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC	scientific article

Statements

instance of

scholarly article

0 references

title

FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC (English)

0 references

0 references

0 references

0 references

Asia-Pacific Journal of Operational Research

0 references

publication date

20 May 2008

0 references

zbMATH Keywords

computational complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Survey of Optimization Models for Train Routing and Scheduling

0 references

The train marshalling problem

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

A dual algorithm for the constrained shortest path problem

0 references

Routing trains through railway stations: Complexity issues

0 references

Q4739657

0 references

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

0 references

Complexity of Scheduling Shops with No Wait in Process

0 references

Bicriteria train scheduling for high-speed passenger railroad planning applications

0 references

full work available at URL

https://doi.org/10.1142/s0217595907001358

0 references

Identifiers

zbMATH Open document ID

1162.90454

0 references

DOI

10.1142/S0217595907001358

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3503068

@@ Property / cites work @@
+A Survey of Optimization Models for Train Routing and Scheduling
+Normal rank
@@ Property / cites work @@
+The train marshalling problem
@@ Property / cites work: The train marshalling problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A dual algorithm for the constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Routing trains through railway stations: Complexity issues
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling Shops with No Wait in Process
+Normal rank
@@ Property / cites work @@
+Bicriteria train scheduling for high-speed passenger railroad planning applications
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0217595907001358
+Normal rank
@@ Property / OpenAlex ID @@
+W2016751795
@@ Property / OpenAlex ID: W2016751795 / rank @@
+Normal rank