References
- BlazewiczJDrabowskiMWeglarzJScheduling multiprocessor tasks to minimize schedule lengthIEEE Trans Comput19863538939310.1109/TC.1986.1676781
- BlazewiczJMachowiakMMouniéGTrystramDScheduling malleable tasks with convex processing speed functionsRev Iberoam de Comp20002158165
- BlazewiczJMachowiakMMouniéGTrystramDApproximation algorithm for scheduling independent malleable tasksLect Notes Comput Sci2001215019119710.1007/3-540-44681-8_29
- BlazewiczJKovalyovMYMachowiakMTrystramDWeglarzJScheduling malleable tasks on parallel processors to minimize the makespanAnn Opns Res2004129658010.1023/B:ANOR.0000030682.25673.c0
- CordeauJ-FLaporteGLegatePMocciaLModels and tabu search heuristics for the berth-allocation problemTransport Sci20053952653810.1287/trsc.1050.0120
- DaganzoCFThe crane scheduling problemTransport Res B19892315917510.1016/0191-2615(89)90001-5
- DrozdowskiMScheduling parallel tasks—Algorithms and complexityHandbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapter 252004125
- DuJLeungJY-TComplexity of scheduling parallel tasks systemsSIAM J Discrete Math1989247348710.1137/0402042
- DutotP-FMouniéGTrystramDScheduling parallel tasks—Approximation algorithmsHandbook of Scheduling: Algorithms, Models, and Performance Analysis, :Chapter 262004124
- GrahamRLBounds on multiprocessing timing anomaliesSIAM J Appl Math19691741642910.1137/0117039
- GuanYXiaoW-QCheungRKLiC-LA multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysisOpns Res Lett20023034335010.1016/S0167-6377(02)00147-5
- HansenPOğuzCMladenovićNVariable neighborhood search for minimum cost berth allocationEur J Opl Res200819163664910.1016/j.ejor.2006.12.057
- ImaiANagaiwaKTatCWEfficient planning of berth allocation for container terminals in AsiaJ Adv Transport199731759410.1002/atr.5670310107
- ImaiANishimuraEPapadimitriouSThe dynamic berth allocation problem for a container portTransport Res B20013540141710.1016/S0191-2615(99)00057-0
- ImaiANishimuraEPapadimitriouSBerth allocation with service priorityTransport Res B20033743745710.1016/S0191-2615(02)00023-1
- ImaiAChenHCNishimuraEPapadimitriouSThe simultaneous berth and quay crane allocation problemTransport Res E20084490092010.1016/j.tre.2007.03.003
- LiC-LCaiXLeeC-YScheduling with multiple-job-on-one-processor patternIIE Trans199830433445
- LimAThe berth planning problemOpns Res Lett19982210511010.1016/S0167-6377(98)00010-8
- LimARodriguesBXuZA m-parallel crane scheduling problem with a non-crossing constraintNav Res Log20075411512710.1002/nav.20189
- LiuJWanY-WWangLQuay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departuresNav Res Log200653607410.1002/nav.20108
- LloydECritical path scheduling with resource and processor constraintsJ ACM19822978181110.1145/322326.322336
- Ludwig WT (1995). Algorithms for scheduling malleable and non-malleable parallel tasks. PhD Thesis, Department of Computer Sciences, University of Wisconsin–Madison.
- MeiselFBierwithCHeuristics for the integration of crane productivity in the berth allocation problemTransport Res E20094519620910.1016/j.tre.2008.03.001
- MocciaLCordeauJ-FGaudiosoMLaporteGA branch-and-cut algorithm for the quay crane scheduling problem in a container terminalNav Res Log200653455910.1002/nav.20121
- Mounié G, Rapine C and Trystram D (1999). Efficient approximation algorithms for scheduling malleable tasks. In: Miller G and Ramachandran V (eds). Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAA '99), ACM: USA, pp 23–32.
- MurtyKGLiuJWanY-WLinnRA decision support system for operations in a container terminalDecis Support Syst20053930933210.1016/j.dss.2003.11.002
- ParkKTKimKHBerth scheduling for container terminals by using sub-gradient optimization techniqueJ Opl Res Soc2002531054106210.1057/palgrave.jors.2601412
- ParkY-MKimKHA scheduling method for berth and quay cranesOR Spectrum20032512310.1007/s00291-002-0109-z
- PeterkofskyRIDaganzoCFA branch-and-bound solution method for the crane scheduling problemTransport Res B19902415917210.1016/0191-2615(90)90014-P
- SammarraMCordeauJ-FLaporteGMonacoMFA tabu search heuristic for the quay crane scheduling problemJ Sched20071032733610.1007/s10951-007-0029-5
- SteenkenDVossSStahlbockRContainer terminal operation and operations research: A classification and literature reviewOR SPectrum20042634910.1007/s00291-003-0157-z
- Turek J, Wolf J and Yu P (1992). Approximate algorithms for scheduling parallelizable tasks. In: Snyder L (ed). 4th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM: USA, pp 323–332.
- VisIFAde KosterRTransshipment of containers at a container terminal: An overviewEur J Opl Res200314711610.1016/S0377-2217(02)00293-X
- WeglarzJModelling and control of dynamic resource allocation project scheduling systemsOptimization and Control of Dynamic Operational Research Models1982105140