A polynomial time algorithm for unloading boxes off a gravity conveyor

DOI10.1016/J.DISOPT.2013.07.004MaRDI QIDQ1799383zbMATH OpenOpenAlexFDO

Authors Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine

Publication date 18 October 2018

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2013.07.004

zbMATH Keywords

boxesdynamic programminggravity conveyorunloading

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• A faster polynomial algorithm for 2-cyclic robotic scheduling
• Optimal retrieval strategies for carousel conveyors
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• On one polynomially solvable case of the decentralized transportation problem
• A polynomial time algorithm for convex cost lot-sizing problems

Cites work

• Scheduling cross docking operations under full, partial and no information on inbound arrivals

Describes a project that uses

Uses Software

• Algorithm 97

This page was built for publication: A polynomial time algorithm for unloading boxes off a gravity conveyor

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