The two authors deal with the topic of the final assembly scheduling realized by the use of Genetic Algorithms (GAs). The objective of the research was to study in depth the use of GA for scheduling mixed-model assembly lines and to propose a model able to produce feasible solutions according to the particular requirements of an important Italian motorbike company, the Aprilia group, as well as...

In this paper mixed finite element methods of higher-order for time-dependent contact problems are discussed. The mixed methods are based on resolving the contact conditions by the introduction of Lagrange multipliers. Dynamic Signorini problems with and without friction are considered involving thermomechanical and rolling contact. Rothe’s method is used to provide a suitable time and space di...

multistage stochastic programming is a key technology for making decisions over time in an uncertain environment. one of the promising areas in which this technology is implementable, is medium term planning of electricity production and trading where decision makers are typically faced with uncertain parameters (such as future demands and market prices) that can be described by stochastic proc...

preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical. The desired execution semantics are that all jobs should execute correctly provided all ...