Challenging Difficult Problems
»
Achieve getting the most jobs done in a certain amount of time
»
Manage jobs as quickly as possible, on average
»
Respect some strict priorities (hard deadlines)
»
Respect some priority indications (soft deadlines)
Job scheduling falls into two categories:
»
Jobs that are hard to solve properly and require advanced algorithms to solve
»
Jobs that are easier to deal with and that can be solved by simple greedy
algorithms
Most of the scheduling you perform actually falls among those solvable by greedy
algorithms. For instance, managing jobs as quickly as possible is a common
requirement for industrial production or the service industry when each job serves
the needs of a client and you want to do your best for all your clients. Here’s how
you can determine a context for such an algorithm:
Do'stlaringiz bilan baham: |