scientific article; zbMATH DE number 808800

MaRDI QIDQ4852849zbMATH OpenFDO

Authors Sergey Sevastyanov

Publication date 17 March 1996

zbMATH Keywords

dominance conditionopen shoppolynomially solvable

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Publication:4888938
• Open shop scheduling with maximal machines
• Stochastic Algorithms: Foundations and Applications
• Open-shop scheduling problems with dominated machines
• A polynomial-time open-shop problem with an arbitrary number of machines

Cited in

(31)

• Openshop and flowshop scheduling to minimize sum of completion times
• Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
• Open shops with jobs overlap
• Open shop scheduling with maximal machines
• Open shop cyclic scheduling
• Reversible-shop scheduling
• When difference in machine loads leads to efficient scheduling in open shops
• Analysis of multi-stage open shop processing systems
• A polynomially solvable case of the two-stage open shop problem for three machines
• Time buffers in the open shop problem
• Characteristics of machine order matrix of open shop scheduling problems
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• Analysis of multi-stage open shop processing systems
• Nonstrict summation of vectors on the plane and its application to scheduling problems
• A selecting method of reasonable non-dominated schedules on open shop
• scientific article; zbMATH DE number 3984949 (Why is no real title available?)
• Open-shop scheduling problems with dominated machines
• Bounds and initial solutions for frame ineration in machine scheduling
• scientific article; zbMATH DE number 33165 (Why is no real title available?)
• Open shop scheduling with delays
• Nonpreemptive open shop with restricted processing times
• Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops
• scientific article; zbMATH DE number 1092175 (Why is no real title available?)
• Openshop scheduling under linear resources constraints
• scientific article; zbMATH DE number 6843804 (Why is no real title available?)
• Dual criteria preemptive open-shop problems with minimum makespan
• scientific article; zbMATH DE number 919274 (Why is no real title available?)
• Automata, Languages and Programming
• Approximation and Online Algorithms
• Stochastic Algorithms: Foundations and Applications
• Linear time approximation scheme for the multiprocessor open shop problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852849)