Container vessel scheduling with bi-directional flows

DOI10.1016/J.ORL.2006.03.010zbMATH Open1149.90339OpenAlexW2017538886MaRDI QIDQ2643792FDOQ2643792

Authors: Yanyan Li 

Publication date: 27 August 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.03.010

Recommendations

• The crane scheduling problem: models and solution approaches
• A multiple-crane-constrained scheduling problem in a container terminal
• Analysis of a new vehicle scheduling and location problem
• Scheduling of container storage and retrieval
• Short-Term Scheduling of Vessels for Shipping Bulk or Semi-Bulk Commodities Originating in a Single Area

zbMATH Keywords

mathematical programmingheuristicbi-directional flowcontainer vessel scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Title not available (Why is that?)
• Dynamic version of the economic lot size model
• Quantitative models for reverse logistics: A review
• Remanufacturing planning for the reverse Wagner/Whitin models
• Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
• On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
• Optimal Inventory Policy with Multiple Set-Up Costs
• The dynamic lot size model with quantity discount

Cited In (9)

• Scheduling bidirectional traffic on a path
• Decentralized production-distribution planning in multi-echelon supply chain network using intelligent agents
• Investigations into control strategies of supply chain planning models: a case study
• Operations research at container terminals: a literature update
• Ship routing and scheduling in the new millennium
• On- and offline scheduling of bidirectional traffic
• Scheduling vessels and container-yard operations with conflicting objectives
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• Analysis of a new vehicle scheduling and location problem

This page was built for publication: Container vessel scheduling with bi-directional flows

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