Abstract (EN):
Scheduling problems are widely recognized as important
optimization problems.Fus, scheduling theory has become
a fundamental area within the general Neld of combinatorial
optimization. Multiprocessor and shop scheduling problems
are known to be hard to solve optimally. Scheduling problems
are naturally very varied, both in application domains and
in featured constraints. To date, researchers have been working
on scheduling problems derived from new applications
such as scheduling problems in logistical airport operations
management processes, decentralized systems and selNsh
organizations, grid computing, and bioinformatics. Fese
scheduling problems rePect real-life situations for including
learning eQects or deteriorating jobs.
Language:
English
Type (Professor's evaluation):
Scientific