This paper presents novel approaches for generating sequencing rules for the carsequencing (CS) problem in cases of two and multiple processing times per station.The CS problem decides on the succession of different car models launched down amixed-model assembly line. It aims to avoid work...

Rubik’s Cube is a popular three-dimensional mechanical puzzle developed inthe 1970’s. The aim of the puzzle is to restore a scrambled cube such that eachof the six faces of the cube is a solid color. This paper proposes an evolutionaryoptimization solver that finds a sequence of turns which...

While in the past decades research on multi-objective evolutionaryalgorithms (MOEA) has aimed at finding the wholeset of Pareto optimal solutions, current approaches focus ononly those parts of the Pareto front which satisfy the preferencesof the decision maker (DM). Therefore, they integratethe...

The paper deals with the two most important mathematical models for sequencing products on a mixed-model assembly line in order to minimize work overload the mixed-model sequencing (MMS) model and the car sequencing (CS) model. Although both models follow the same underlying objective, only MMS...

The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this...

The car sequencing problem is a widespread short-term decision problem, in whichsequences of different car models launched down a mixed-model assembly line are tobe determined. To avoid work overloads of workforce, car sequencing restricts themaximum occurrence of labor-intensive options, e.g.,...

This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work...

This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work...

The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this...