Scheduling algorithms.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Production models (90B30) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
The book consists of three parts: (a) the first part covers basic facts like the introduction, classification of scheduling problems, methods of combinatorial optimization and computational complexity (chapters 1--3), (b) the second part deals with classical scheduling problems like single machine scheduling, parallel machine scheduling and shop scheduling problems and contains complexity results and algorithms for these problems (chapters 4--6). (c) the third part is devoted to recent discussed problems in connection with flexible manufacturing. The author has considered scheduling with due dates, batching problems, scheduling with changeover and transportation times, multi-purpose machines and multiprocessor tasks (chapters 7--11). In comparison with the first edition, the third part contains several new results in the area. Very useful are the new complexity columns at the end of each chapter (giving an overview about the complexity results) for all considered scheduling problems. Finally, there exists also a web page (see http://www.mathematik.uni-osnabrueck.de/research/OR/class/) provided by the author and Sigrid Knust where interested researchers can find new and updated complexity results for scheduling problems. This book is an important reference and very good source of inspiration for advanced students and researchers in mathematics, computer science, operations research and industrial engineering.
- scientific article; zbMATH DE number 830382
- scientific article; zbMATH DE number 2114378
- scientific article; zbMATH DE number 1634827
- Scheduling in computer and manufacturing systems
- Scheduling
- Scheduling algorithms
- Handbook on Scheduling
- scientific article; zbMATH DE number 782644
- scientific article; zbMATH DE number 846900
- Time-dependent scheduling
- Planning production using mathematical programming: The case of a woodturning company
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- On maximizing the throughput of multiprocessor tasks.
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- The complexity of two-job shop problems with multi-purpose unrelated machines.
- Single machine scheduling to minimize the number of late jobs under uncertainty.
- Open shop scheduling problems with late work criteria.
- Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- A possibilistic approach to sequencing problems with fuzzy parameters
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Preemptive scheduling on identical parallel machines subject to deadlines.
- PERT scheduling with convex cost functions.
- On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
- Parallel machine scheduling models with fuzzy processing times
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- Memory management optimization problems for integrated circuit simulators
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- An analysis of totally clairvoyant scheduling
- A polynomial time algorithm for Zero-Clairvoyant scheduling
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Designing PTASs for MIN-SUM scheduling problems
- Scheduling in a contaminated area: a model and polynomial algorithms
- Flowshop scheduling research after five decades
- A review of TSP based approaches for flowshop scheduling
- Approximating schedules
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- Solving the job-shop scheduling problem optimally by dynamic programming
- Scheduling algorithms
- Online scheduling with interval conflicts
- scientific article; zbMATH DE number 736667 (Why is no real title available?)
- scientific article; zbMATH DE number 2001585 (Why is no real title available?)
- Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- scientific article; zbMATH DE number 830382 (Why is no real title available?)
- Online over time scheduling on parallel-batch machines: a survey
- Scheduling partially ordered jobs faster than \(2^n\)
- Maximizing project cash availability
- Bounding strategies for the hybrid flow shop scheduling problem
- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
- Probabilistic analysis of shelf algorithms for strip packing
- Approximate algorithms to pack rectangles into several strips
- Scheduling. Theory, algorithms, and systems
- Scheduling with tails and deadlines
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines
- Multiindex optimal production planning problems
- Data transfer planning with tree placement for collaborative environments
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling
- An efficient approximation for the generalized assignment problem
- Maximizing the throughput of parallel jobs on hypercubes
- Scheduling equal processing time jobs to minimize the weighted number of late jobs
- Optimal scheduling of a two-stage hybrid flow shop
- Solving a concrete sleepers production scheduling by genetic algorithms
- Optimal scheduling combinatorics
- Two machine scheduling under disruptions with transportation considerations
- A note on the two machine job shop with the weighted late work criterion
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
This page was built for publication: Scheduling algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4396949)
