Showing 1 - 4 of 4
container terminal, where the objective is to minimize the makespan of the schedule. We present a Branch & Bound algorithm that … uses various combinatorial lower bounds. Computational experiments show that this algorithm is able to produce optimal or …
Persistent link: https://www.econbiz.de/10005795602
container terminal in a dynamic environment. This means that the handling times are not known exactly beforehand and that the … order in which the different pieces of equipment handle the containers need not be specified completely in advance. Instead …
Persistent link: https://www.econbiz.de/10005450923
Inventory policies for joint remanufacturing and manufacturing have recently received much attention. Most efforts, though, were related to (optimal) policy structures and numerical optimization, rather than closed form expressions for calculating near optimal policy parameters. The focus of...
Persistent link: https://www.econbiz.de/10005288402
develop several heuristics based on traditional inventory models. We also investigate the performance of the system as a … performance of the heuristics on a set of sample problems. We find that the average error of the heuristics is quite low. …
Persistent link: https://www.econbiz.de/10005288768