This paper presents the solution of a basic problem defined by J. Černý which solves a concrete everyday problem in railway and road transport (the problem of optimization of time-tables by some criteria).
This paper considers an M/M/R/N queue with heterogeneous servers in which customers balk (do not enter) with a constant probability . We develop the maximum likelihood estimates of the parameters for the M/M/R/N queue with balking and heterogeneous servers. This is a generalization of the M/M/2 queue with heterogeneous servers (without balking), and the M/M/2/N queue with balking and heterogeneous servers in the literature. We also develop the confidence interval formula for the parameter , the...
This paper considers an M/M/R/N queue with heterogeneous servers in which customers balk (do not enter) with a constant probability (1 - b). We develop the maximum likelihood estimates of the parameters for the M/M/R/N queue with balking and heterogeneous servers. This is a generalization of the M/M/2 queue with heterogeneous servers (without balking), and the M/M/2/N queue with balking and heterogeneous servers in the literature. We also develop the confidence interval formula for the parameter...
In this paper we deal with mathematical modeling of real processes that are based on preference relations in the sense that, for every pair of distinct alternatives, the processes are linked to a value of preference degree of one alternative over the other one. The use of preference relations is usual in decision making, psychology, economics, knowledge acquisition techniques for knowledge-based systems, social choice and many other social sciences. For designing useful mathematical models of such...
The line balancing problem consits in assigning tasks to stations in order to respect precedence constraints and cycle time constraints. In this paper, the cycle time is fixed and the objective is to minimize the number of stations. We propose to use metaheuristics based on simulated annealing by exploiting the link between the line balancing problem and the bin packing problem. The principle of the method lies in the combination between a metaheuristic and a bin packing heuristic. Two representations of...
Dans ce papier, nous traitons le problème de minimisation du makespan dans un flow shop hybride à deux étages avec machines dédiées. En premier lieu, nous présentons des propriétés de base, un ensemble de bornes inférieures et deux cas polynomiaux. En second lieu, nous proposons une nouvelle heuristique qui exploite ces propriétés, et cherche à placer les jobs, en tenant compte pour chaque instance du problème, de la valeur de la borne inférieure. La dernière partie de ce travail présente les résultats expérimentaux...
Este trabajo estudia el problema de planificación de la producción representado por un modelo de costes cóncavos sujeto a limitaciones de capacidad. La relajación lineal del modelo es analizada usando un enfoque primal-dual. Las soluciones del dual se obtienen resolviendo para cada producto modelos sin restricciones de capacidad asignando un precio a las mismas. El primal reducido supone un test de admisibilidad de dichas soluciones. El dual reducido permite calcular los nuevos precios recomendados...