Time-Dependent Scheduling

• Κύριος συγγραφέας: Gawiejnowicz, Stanisław (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Monographs in Theoretical Computer Science, An EATCS Series,
• Θέματα: Computer science.; Operations research.; Decision making.; Computer programming.; Computers.; Algorithms.; Artificial intelligence.; Mathematical optimization.; Computer Science.; Theory of Computation.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Optimization.; Artificial Intelligence (incl. Robotics).; Operation Research/Decision Theory.

hebookpresentedtothereaderisdevotedtotime-dependentscheduling. TScheduling problems, in general, consist in the allocation of resources over time in order to perform a set of jobs. Any allocation that meets all requirements concerning the jobs and resources is called a feasible schedule. The quality...

Πίνακας περιεχομένων:

• Fundamentals
• Preliminaries
• Problems and algorithms
• NP-complete problems
• Basics of the scheduling theory
• Basics of time-dependent scheduling
• Complexity
• Single-machine time-dependent scheduling
• Parallel-machine time-dependent scheduling
• Dedicated-machine time-dependent scheduling
• Algorithms
• Approximation and heuristic algorithms
• Greedy algorithms based on signatures
• Local search algorithms
• Advanced Topics
• Matrix methods in time-dependent scheduling
• Scheduling dependent deteriorating jobs
• Time-dependent scheduling with two criteria.