Algorithms for Scheduling Problems
Dublin Core
Title
Algorithms for Scheduling Problems
Subject
Algorithms for Scheduling Problems
Description
Optimal scheduling is an important area of operations research, as it has both theoretical and
practical aspects. It is clear that efficient algorithms are most desirable for practical applications,
since most real-world scheduling problems have large sizes but require fast decisions. Due to this,
practitioners often prefer to use rather simple algorithms which provide schedules that may be far
from optimal with respect to their quality.
This book is based on a Special Issue entitled ”Algorithms for Scheduling Problems”. In the
Call for Papers, we invited prospective authors to submit their latest research in the area of the
development of scheduling algorithms.
practical aspects. It is clear that efficient algorithms are most desirable for practical applications,
since most real-world scheduling problems have large sizes but require fast decisions. Due to this,
practitioners often prefer to use rather simple algorithms which provide schedules that may be far
from optimal with respect to their quality.
This book is based on a Special Issue entitled ”Algorithms for Scheduling Problems”. In the
Call for Papers, we invited prospective authors to submit their latest research in the area of the
development of scheduling algorithms.
Creator
Frank Werner (Ed.)
Source
https://www.mdpi.com/books/pdfview/book/722
Publisher
MDPI - Multidisciplinary Digital Publishing Institute
Date
2018
Contributor
Baihaqi
Rights
Creative Commons
Format
PDF
Language
English
Type
Textbooks
Files
Collection
Citation
Frank Werner (Ed.) , “Algorithms for Scheduling Problems,” Open Educational Resource (OER) - USK Library, accessed April 24, 2025, http://202.4.186.74:8004/oer/items/show/3095.