Andere Kunden interessierten sich auch für
![Conflict-free Vehicle Routing with an Application to Personal Rapid Transit]( "Conflict-free Vehicle Routing with an Application to Personal Rapid Transit")
Conflict-free Vehicle Routing with an Application to Personal Rapid Transit22,30 €![Modeling and Simulation of Protein Folding]( "Modeling and Simulation of Protein Folding")
Modeling and Simulation of Protein Folding25,99 €![Adaptive Numerical Integration of Dynamical Contact Problems]( "Adaptive Numerical Integration of Dynamical Contact Problems")
Adaptive Numerical Integration of Dynamical Contact Problems31,10 €![The Power of Compromise. Reference Point Methods and Approximation in Multicriteria Optimization]( "The Power of Compromise. Reference Point Methods and Approximation in Multicriteria Optimization")
The Power of Compromise. Reference Point Methods and Approximation in Multicriteria Optimization26,40 €![Convex Relaxations for Mixed-Integer Nonlinear Programs]( "Convex Relaxations for Mixed-Integer Nonlinear Programs")
Convex Relaxations for Mixed-Integer Nonlinear Programs43,85 €![Regularization Methods for Item Response and Paired Comparison Models]( "Regularization Methods for Item Response and Paired Comparison Models")
Regularization Methods for Item Response and Paired Comparison Models45,00 €![Spectral-density-driven Bootstrap and Time Series Modeling on Dynamic Networks]( "Spectral-density-driven Bootstrap and Time Series Modeling on Dynamic Networks")
Spectral-density-driven Bootstrap and Time Series Modeling on Dynamic Networks35,30 €
Among the most important problems in combinatorial optimization are scheduling problems. In this paper, machine scheduling is considered. Usually in such problems a set of jobs and a set of machines are given. The task is to assign the jobs to the machines and to determine a schedule for each machine. The schedule determines at what times the machine will process the jobs assigned to it. Often, constraints must be taken into account. Typical constraints are times by which certain jobs must be completed (deadlines), that some jobs can only be processed when certain other jobs are completed (precedence constraints), or that some jobs are only available from a given time (release dates).
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.