A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis

DOI10.1016/S0167-6377(02)00147-5zbMath1010.90026MaRDI QIDQ1866998

Yongpei Guan, Raymond K. Cheung, Chung-Lun Li, Wen-Qiang Xiao

Publication date: 2 April 2003

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

zbMATH Keywords

schedulingsequencingheuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Complexity and performance of numerical algorithms (65Y20)

Related Items (11)

Berth allocation at indented berths for mega-containerships ⋮ Multi-objective and prioritized berth allocation in container ports ⋮ Berth allocation with time-dependent physical limitations on vessels ⋮ Mathematical models for the berth allocation problem in dry bulk terminals ⋮ A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports ⋮ Time-constrained project scheduling with adjacent resources ⋮ Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex ⋮ Double layer programming model to the scheduling of remote sensing data processing tasks ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals ⋮ A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem

Cites Work

• The berth planning problem
• Scheduling multiprocessor tasks -- An overview
• Current trends in deterministic scheduling
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis