An exact method for the 2D guillotine strip packing problem.
Bekrar, Abdelghani, Kacem, Imed (2009)
Advances in Operations Research
Similarity:
Displaying similar documents to “Metaheuristics based on Bin Packing for the line balancing problem”
An exact method for the 2D guillotine strip packing problem.
France Telecom workforce scheduling problem: a challenge
Sebastian Pokutta, Gautier Stauffer (2009)
RAIRO - Operations Research
Similarity:
In this paper, we describe the methodology used to tackle France Telecom workforce scheduling problem (the subject of the Roadef Challenge 2007) and we report the results obtained on the different data sets provided for the competition. Since the problem at hand appears to be NP-hard and due to the high dimensions of the instance sets, we use a two-step heuristical approach. We first devise a problem-tailored heuristic that provides good feasible solutions and then we use a meta-heuristic...
Analysis of transmissions scheduling with packet fragmentation.
Menakerman, Nir, Rom, Raphael (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Optimization of the Raster-Scan Circle-Drawing Algorithm Based on Predicate Transformers
Nedeljko Ostojić, Dušan Starčević (2000)
The Yugoslav Journal of Operations Research
Similarity:
A Time-Predefined Approach to Course Timetabling
Edmund Burke, Yuri Bykov, James Newall, Sanja Petrović (2003)
The Yugoslav Journal of Operations Research
Similarity:
Efficient Improvement of Brain-Tharp's Algorithm
Dejan Simić, Dušan Starčević (1999)
The Yugoslav Journal of Operations Research
Similarity:
ACS-TS: Train scheduling using ant colony system.
Ghoseiri, Keivan, Morshedsolouk, Fahimeh (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Online LIB problems : heuristics for bin covering and lower bounds for bin packing
Luke Finlay, Prabhu Manyem (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced...
Heuristic Algorithm for Single Resource Constrained Project Scheduling Problem Based on the Dynamic Programming
Ivan Stanimirović, Marko Petković, Predrag Stanimirović, Miroslav Ćirić (2009)
The Yugoslav Journal of Operations Research
Similarity:
A literature review on circle and sphere packing problems: models and methodologies.
Hifi, Mhand, M'hallah, Rym (2009)
Advances in Operations Research
Similarity:
MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
Thibaut Lust, Jacques Teghem (2008)
RAIRO - Operations Research
Similarity:
We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the first parent. A local search is then applied to the offspring. We experiment this scheme with...