The offline carpool problem revisited

DOI10.1007/978-3-662-48054-0_40MaRDI QIDQ2946418zbMATH OpenOpenAlexFDO

Authors Saad Mneimneh, Saman Farhat

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48054-0_40

zbMATH Keywords

carpool problemfair schedulingflowsgraphsoffline algorithmsonline algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 910905
• Car-sharing between two locations: online scheduling with two servers
• Fairness in Scheduling
• Online scheduling of car-sharing request pairs between two locations
• Car-sharing between two locations: online scheduling with flexible advance bookings

Cites work

• Fairness in Scheduling
• On fairness in the carpool problem
• The Chairman assignment problem
• The optimality of the online greedy algorithm in carpool and chairman assignment problems

Cited in

(5)

• The optimality of the online greedy algorithm in carpool and chairman assignment problems
• Fairness in Scheduling
• Carpooling in social networks
• On fairness in the carpool problem
• scientific article; zbMATH DE number 910905 (Why is no real title available?)

This page was built for publication: The offline carpool problem revisited

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