scientific article

zbMath0668.90045MaRDI QIDQ3821925

Slowinski, Roman, Wojciech Cellary, Jan Weglarz, Jacek Błażewicz

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational complexity distributed systems parallel machines performance evaluation job-shop scheduling deterministic scheduling renewable resources computer systems additional constrained resources Multicriteria problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) 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) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of software (68N99)

Related Items (43)

On the complexity of preemptive openshop scheduling problems ⋮ DSS for multiobjective project scheduling ⋮ Computing redundant resources for the resource constrained project scheduling problem ⋮ A preemptive open shop scheduling problem with one resource ⋮ On the two-phase method for preemptive scheduling ⋮ Preassignment requirements in chromatic scheduling ⋮ A variant of the permutation flow shop model with variable processing times ⋮ On relocation problems with multiple identical working crews ⋮ Real-time scheduling of an automated manufacturing center ⋮ Maximizing system lifetime in wireless sensor networks ⋮ Restrictions and preassignments in preemptive open shop scheduling ⋮ UET-scheduling with chain-type precedence constraints ⋮ Faster and simpler approximation algorithms for mixed packing and covering problems ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ On linear lower bounds for the resource constrained project scheduling problem. ⋮ Approximate strong separation with application in fractional graph coloring and preemptive scheduling. ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ Tight complexity analysis of the relocation problem with arbitrary release dates ⋮ Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. ⋮ Flow shop scheduling problem with conflict graphs ⋮ Scheduling problems for parallel dedicated machines under multiple resource constraints. ⋮ Restricted assignment scheduling with resource constraints ⋮ Almost nonpreemptive schedules ⋮ New complexity results for shop scheduling problems with agreement graphs ⋮ Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ The cyclic compact open-shop scheduling problem ⋮ Resource-constrained flowshop scheduling with separate resource recycling operations ⋮ Multiprocessor scheduling under precedence constraints: polyhedral results ⋮ Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems ⋮ Algorithms for minimizing maximum lateness with unit length tasks and resource constraints ⋮ The multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ Exploiting process plan flexibility in production scheduling: A multi-objective approach ⋮ Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems ⋮ Extensions of coloring models for scheduling purposes ⋮ Heuristics for multimode scheduling problems with dedicated resources ⋮ Scheduling Multilayer Divisible Computations ⋮ Two-machine open shop problem with agreement graph ⋮ The complexity of scheduling jobs in repetitive manufacturing systems ⋮ Open shops with jobs overlap ⋮ Mathematical programming formulations for machine scheduling: A survey ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods ⋮ Open shop scheduling problems with conflict graphs

Cites Work

This page was built for publication: