Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse

DOI10.1016/j.ejor.2017.03.007zbMath1375.90141OpenAlexW2592725105MaRDI QIDQ1683060

Lixin Tang, Yuan Yuan

Publication date: 6 December 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.007

zbMATH Keywords

schedulinglogisticsapproximate dynamic programmingcoil warehousetime-space network flow formulation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Approximate dynamic programming for an energy-efficient parallel machine scheduling problem, An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand, An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints, Novel models and algorithms for location assignment for outbound containers in container terminals, Cross-docking based factory logistics unitisation process: an approximate dynamic programming approach, Yard crane scheduling for container storage, retrieval, and relocation

Cites Work

• Crane scheduling in container yards with inter-crane interference
• An optimization model for the container pre-marshalling problem
• The fleet assignment problem: Solving a large scale integer program
• An exact method for scheduling a yard crane
• The crane scheduling problem: models and solution approaches
• A heuristic rule for relocating blocks
• Approximate Dynamic Programming
• Models and algorithms for shuffling problems in steel plants