English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Cross-docking is a logistics strategy that minimizes the storage and pickingfunctions of conventional warehouses. The objective is to unload the cargo frominbound trucks and directly load it into outbound trucks, with little or nostorage. The success of the strategy depends on an efficient transshipmentoperation. This work undertakes a study of truck scheduling in a cross-dockingcenter. The problem is modeled as a two-machine flow shop scheduling problemwith precedence constraints, with the objective of minimizing the makespan. Theproposed method is based on a Lagrangean relaxation solved by a Volumealgorithm over a time-indexed formulation. We use polynomial time heuristicsfor generating efficient upper and lower bounds in a computationally efficienttime, outperforming current results in the literature for small and large sizeinstances.

A hybrid Lagrangean metaheuristic for the two-machine cross-docking flow shop scheduling problem