The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness of this approach...
The NP-hard problem of car sequencing has received a lot of attention these last years. Whereas a direct
approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to
sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale
neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car
sequencing problems. The effectiveness of this approach...
A special class of scheduling problems is studied in this paper,
named Hybrid Flowshop, n jobs have to be performed
in a shop and each of them has the same routing (so this is
a flowshop). A job consists in k different operations.
A set of machines are able to perform each operation and this
set is called a stage. So when a job consists in two operations,
there are two stages in the shop. After introducing the scheduling
generalities, we define our preocupations and we propose a notation
in...
The paper deals with the problem how to locate a set of polygon vertices on given circles fulfilling some criteria of "regularity" of individual and composed polygons. Specifying the conditions we can obtain a lot of particular versions of this general problem. Some of them are already solved, the others are not.
Applications of this theory can be found in scheduling of periodically repeating processes, e.g. in coordination of several urban lines on a common leg, in optimization of the rhythm of...
This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain jobs....
Currently displaying 1 –
8 of
8