Scheduling in computer and manufacturing systems
due date schedulingexact and approximative algorithmsflexible manufacturing systemsheuristicsparallel processor schedulingresource constrained schedulingsemi-identical processorssingle processor scheduling
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
The last monograph on scheduling problems was published in 1982. Since then many new results have been published in scientific journals. In recent years new scheduling problems have been formulated due to changing production technologies. This monograph takes in account these developments. Besides classical results on scheduling new results are covered. The new topics discussed in the book are e.g. (1) due date scheduling problems and problems with changeover costs covered in the chapter on single processor scheduling, (2) semi-identical processors and problems with multiprocessor tasks included in the chapter on parallel processor scheduling. Furthermore, complete chapters are devoted to resource constrained scheduling and to scheduling in flexible manufacturing systems. The chapter on static shop scheduling is rather short and does not contain of all the recent main developments. The book also gives detailed complexity results for the problem areas discussed. Exact and approximative algorithms as well as some heuristics are covered. Algorithms which are presented in a Pascal like notation are well readable. In most cases correctness proofs are missing. The book is well suited for computer scientists and industrial engineers. In particular the chapter on knowledge based scheduling mainly addresses scientists working in these areas. A mathematician who is also interested in proofs has to consult the original literature.
- scientific article; zbMATH DE number 736667
- Scheduling computer and manufacturing processes
- scientific article; zbMATH DE number 1640601
- Process Scheduling in a Computer System
- Scheduling. Theory, algorithms, and systems
- Scheduling. Theory, algorithms, and systems
- scientific article; zbMATH DE number 1016640
- Scheduling: theory and applications
- Scheduling methods for a class of flexible manufacturing systems
- scientific article; zbMATH DE number 1082109
- Preemptive scheduling and antichain polyhedra
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Two branch and bound algorithms for the permutation flow shop problem
- Extensions of coloring models for scheduling purposes
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Minimizing the overhead for some tree-scheduling problems
- Minimizing the schedule length for a parallel 3D-grid precedence graph
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Scheduling in synchronous networks and the greedy algorithm
- Vehicle scheduling in two-cycle flexible manufacturing systems
- Scheduling complete intrees on two uniform processors with communication delays
- Real-time scheduling of linear speedup parallel tasks
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A variant of the permutation flow shop model with variable processing times
- On the complexity of two machine job-shop scheduling with regular objective functions
- FUN: a dynamic method for scheduling problems
- Resource-constrained project scheduling: A survey of recent developments.
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints.
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- An integrated dispatching model for rail yards operations.
- Dynamic scheduling of parallel computations
- A framework for the description of evolutionary algorithms
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Match-up scheduling under a machine breakdown
- Lot-size scheduling of two types of jobs on identical machines
- Preface: Project management and scheduling
- Parallel machine scheduling with machine availability and eligibility constraints
- Improving delivery reliability by a new due-date setting rule
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
- Optimal preemptive scheduling on a fixed number of identical parallel machines
- A review of TSP based approaches for flowshop scheduling
- scientific article; zbMATH DE number 1640601 (Why is no real title available?)
- Scheduling chains to minimize mean flow time
- Deterministic and stochastic scheduling with teamwork tasks
- Acquisition planning and scheduling of computing resources
- scientific article; zbMATH DE number 4135694 (Why is no real title available?)
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
- scientific article; zbMATH DE number 3989090 (Why is no real title available?)
- Les problèmes d'ordonnancement
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- scientific article; zbMATH DE number 736667 (Why is no real title available?)
- Scheduling computer and manufacturing processes
- Scheduling algorithms.
- scientific article; zbMATH DE number 2042676 (Why is no real title available?)
- Scheduling Precedence Task Graphs with Disturbances
- Bicriteria scheduling for due date assignment with total weighted tardiness
- Planning and Scheduling in Manufacturing and Services
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- scientific article; zbMATH DE number 830382 (Why is no real title available?)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation
- Manufacturing Scheduling Systems
- scientific article; zbMATH DE number 5039508 (Why is no real title available?)
- Inequality-sum: a global constraint capturing the objective function
- Handbook on Scheduling
- Sensitivity analysis of scheduling algorithms
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Two-agent single-machine scheduling with release dates to minimize the makespan
- Scheduling on uniform machines with a conflict graph: complexity and resolution
- Random trees in queueing systems with deadlines
- Scheduling jobs with varying processing times
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
This page was built for publication: Scheduling in computer and manufacturing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023677)
