scientific article; zbMATH DE number 91028

MaRDI QIDQ4017172zbMATH OpenFDO

Authors M. A. Forbes, J. N. Holt, P. J. Kilby, A. M. Watts

Publication date 16 January 1993

zbMATH Keywords

branch and boundbus driver schedulingmatching

Mathematics Subject Classification ID

Computer system organization (68M99) Parallel algorithms in computer science (68W10)

Recommendations

• A quasi-assignment algorithm for bus scheduling
• On some matching problems arising in vehicle scheduling models
• scientific article; zbMATH DE number 1424450
• An Algorithm for Bus Scheduling Problems
• An efficient algorithm for the bipartite matching problem

Cited in

(11)

• An efficient algorithm for the bipartite matching problem
• Aircrew schedule generation using repeated matching
• \(n\)-Tokyoites' loop-line commuter problem
• A repeated matching heuristic for the single-source capacitated facility location problem
• scientific article; zbMATH DE number 3980894 (Why is no real title available?)
• On some matching problems arising in vehicle scheduling models
• A quasi-assignment algorithm for bus scheduling
• scientific article; zbMATH DE number 1568937 (Why is no real title available?)
• scientific article; zbMATH DE number 2221470 (Why is no real title available?)
• A stochastic optimization approach for staff scheduling decisions at inpatient units
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017172)