Container vessel scheduling with bi-directional flows

Authors:
Z. -L. Chen;L. Lei;H. Zhong
Affiliations:
Robert H. Smith School of Business, University of Maryland, USA;MSIS Department, Rutgers School of Business, Rutgers University, 180 University Avenue, Newark, New Jersey 07102, USA;SUNY-Oneonta, State University of New York, USA
Venue:
Operations Research Letters
Year:
2007

Citing 7
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Supply-Chain Management for Recoverable Manufacturing Systems

Interfaces
On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures

Operations Research
Ship Routing and Scheduling: Status and Perspectives

Transportation Science
A computer-based decision support system for vessel fleet scheduling: experience and future research

Decision Support Systems
Dynamic Lot Sizing with Batch Ordering and Truckload Discounts

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a strongly NP-hard container vessel scheduling problem with bi-directional flows. We show that a special case of it is solvable as a linear program. This property is then used to design a heuristic for the general case.