Optimal deployment of eventually-serializable data services

DOI10.1007/S10479-010-0684-3MaRDI QIDQ545558zbMATH OpenOpenAlexFDO

Authors Alexander A. Schwarzmann, Laurent Michel, Elaine L. Sonderegger, Pascal Van Hentenryck

Publication date 22 June 2011

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-010-0684-3

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 1263990
• Replicated data types, specification, verification, optimality
• Principles of Distributed Systems
• Eventually-serializable data services
• Minimal replication cost for availability

Cites work

• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• scientific article; zbMATH DE number 1263990 (Why is no real title available?)
• scientific article; zbMATH DE number 2013830 (Why is no real title available?)
• Crossdocking—JIT scheduling with time windows
• Eventually-serializable data services
• Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
• Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks
• Truck dock assignment problem with operational time constraint within crossdocks
• Truck scheduling at zero-inventory cross docking terminals
• Uppaal in a nutshell

Cited in

(3)

• Transshipment service through crossdocks with both soft and hard time windows
• scientific article; zbMATH DE number 1263990 (Why is no real title available?)
• Eventually-serializable data services

Describes a project that uses

Uses Software

• PVS
• Uppaal

This page was built for publication: Optimal deployment of eventually-serializable data services

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