A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis
- 31 October 2002
- journal article
- research article
- Published by Elsevier BV in Operations Research Letters
- Vol. 30 (5), 343-350
- https://doi.org/10.1016/s0167-6377(02)00147-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Higher-Dimensional Packing with Order ConstraintsLecture Notes in Computer Science, 2001
- Scheduling one and two-processor tasks on two parallel processorsIIE Transactions, 1999
- General multiprocessor task schedulingNaval Research Logistics (NRL), 1999
- Scheduling with multiple-job-on-one-processor patternIIE Transactions, 1998
- The berth planning problemOperations Research Letters, 1998
- Optimizing submarine berthing with a persistence incentiveNaval Research Logistics (NRL), 1997
- Scheduling multiprocessor tasks — An overviewEuropean Journal of Operational Research, 1996
- An exact algorithm for general, orthogonal, two-dimensional knapsack problemsEuropean Journal of Operational Research, 1995
- A study of container berth allocationJournal of Advanced Transportation, 1992
- The crane scheduling problemTransportation Research Part B: Methodological, 1989