Sciweavers

908 search results - page 32 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
102
Voted
EOR
2007
78views more  EOR 2007»
15 years 1 months ago
A heuristic for the three-dimensional strip packing problem
The contribution presents a heuristic for the three-dimensional strip packing problem (3D-SPP) with rectangular pieces (boxes). The considered 3D-SPP can be formulated as follows:...
Andreas Bortfeldt, Daniel Mack
112
Voted
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 8 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
JCO
2002
96views more  JCO 2002»
15 years 1 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
91
Voted
CISIS
2009
IEEE
15 years 8 months ago
Multiple-Paths Search with Concurrent Thread Scheduling for Fast AND/OR Tree Search
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
Fumiyo Takano, Yoshitaka Maekawa, Hironori Kasahar...
ATMOS
2008
187views Optimization» more  ATMOS 2008»
15 years 3 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz