Previous Page 2
Martin Gavalec, Karel Zimmermann (2010)
Kybernetika
A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.
Filik, Ümmühan Başaran, Kurban, Mehmet (2010)
Mathematical Problems in Engineering
M. Duran Toksarı, Daniel Oron, Ertan Güner (2010)
RAIRO - Operations Research
This paper studies scheduling problems which include a combination of nonlinear job deterioration and a time-dependent learning effect. We use past sequence dependent (p-s-d) setup times, which is first introduced by Koulamas and Kyparisis [Eur. J. Oper. Res.187 (2008) 1045–1049]. They considered a new form of setup times which depend on all already scheduled jobs from the current batch. Job deterioration and learning co-exist in various real life scheduling settings. By the effects of learning...
Laureano F. Escudero, Gloria Pérez Sáinz de Rozas (1990)
Trabajos de Investigación Operativa
In this work we describe some strategies that have been proved to be very efficient for solving the following type of scheduling problems: Assume a set of jobs is to be performed along a planning horizon by selecting one from several alternatives for doing so. Besides selecting the alternative for each job, the target consists of choosing the periods at which each component of the work will be done, such that a set of scheduling and technological constraints is satisfied. The problem is formulated...
Previous Page 2