Scheduling computer and manufacturing processes
This book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. Various scheduling problems are discussed where different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factors are involved. Polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches (including tabu search, simulated annealing, genetic algorithms, and ejection chains) are presented and discussed. Most important classical results, including single and parallel processor cases, are surveyed. The more general models are also studied, related to modern parallel computer systems and taking into account communication delays, and multiprocessor and divisible tasks. Moreover, resource-constrained, imprecise computation, flexible flow shop and dynamic job shop scheduling, as well as flexible manufacturing systems, are considered. Finally, results from interactive and knowledge-based scheduling are surveyed and used, together with previous results, for solving practical problems in the framework of computer integrated manufacturing and object-oriented modeling. This book is a continuation of the book `Scheduling in computer and manufacturing systems' by \textit{J. Blazewicz}, \textit{K. Ecker}, \textit{G. Schmidt} and \textit{J. Weglarz} (Berlin, Springer-Verlag 1993; Zbl 0767.90033). But, this book is not only a revision of the previous one, but also provides new topics of the scheduling research. Examples are ejection chains in the framework of meta-heuristics, imprecise computation (i.e., minimizing the amount of processing of tasks exceeding due dates) and lot size scheduling in the framework of the parallel processor scheduling, scheduling tasks with communication delays, and batch scheduling in flexible manufacturing systems. As a result this book has 491 pages and 113 figures. In this sense, it is more complete and more readable than the previous one.
- A quadratic algorithm for the 2-cyclic robotic scheduling problem
- Preemptive scheduling in the presence of transportation times
- Scheduling for parallel processing
- Minimizing the number of machines for minimum length schedules
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- A framework for decision support systems of scheduling problems
- Heuristics for multimode scheduling problems with dedicated resources
- Random sequencing jobs with deadlines problem: Growth of the optimal solution values
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Single machine batch scheduling with jointly compressible setup and processing times.
- Complexity and approximation results for scheduling multiprocessor tasks on a ring.
- Complexity of some special types of timetabling problems
- Dynamic scheduling of stochastic jobs on a single machine
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
- Arranging program statements for locality on the basis of neighbourhood preferences
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
- Scheduling on parallel machines with preemption and transportation delays
- A graph based model for survivability applications
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Scheduling of resource tasks
- Review of properties of different precedence graphs for scheduling problems
- A new hierarchical architecture for air traffic management: optimisation of airway capacity in a free flight scenario
- The simple F2//C with forbidden tasks in first or last position: a problem more complex that it seems
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing
- Mean flow time minimization with given bounds of processing times
- Scheduling with limited machine availability
- Scheduling multiprocessor tasks for mean flow time criterion
- Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- Routing equal-size messages on a slotted ring
- CHECKCOL: improved local search for graph coloring
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- On uniform \(k\)-partition problems
- Optimization of the integrated problem of employee timetabling and job shop scheduling
- scientific article; zbMATH DE number 1640601 (Why is no real title available?)
- Multicriteria scheduling problems: a survey
- Scheduling cyclic tasks with binary periods
- Hybrid flow-shop with adjustment
- Scheduling multiprocessor tasks on two parallel processors
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- Scheduling in computer and manufacturing systems
- scientific article; zbMATH DE number 736667 (Why is no real title available?)
- Production scheduling with alternative process plans
- A heuristic method to schedule training programs for small and medium enterprises
- A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines
- Deterministic Search Algorithm for Sequencing and Scheduling
- scientific article; zbMATH DE number 2230238 (Why is no real title available?)
- Handbook on Scheduling
- Solving the open shop scheduling problem
- New applications of the Muntz and Coffman algorithm
- Two-machine flow shops with limited machine availability
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Single machine batch scheduling with resource dependent setup and processing times
- On-line scheduling of parallel jobs with runtime restrictions
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Scheduling and constraint propagation
- A half-product based approximation scheme for agreeably weighted completion time variance
- Single machine group scheduling with resource dependent setup and processing times
- Connected searching of weighted trees
- Fast LP models and algorithms for identical jobs on uniform parallel machines
- Models and complexity of multibin packing problems
- Job scheduling methods for reducing waiting time variance
- An approach to predictive-reactive scheduling of parallel machines subject to disruptions
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
This page was built for publication: Scheduling computer and manufacturing processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4380372)
