Efficient (re-)scheduling: An auction approach

We consider one-sided scheduling problems like the un/loading at sea-ports. These are typically handled on a first-come-first-serve basis, which is grossly inefficient. We propose a scheduling auction in the spirit of the Clark–Groves–Vickrey mechanism, and shows that it is free of the deficiencies that tend to plague it in other applications