Some positive news on the proportionate open shop problem

DOI10.33048/SEMI.2019.16.023zbMATH Open1414.90169OpenAlexW3015953147MaRDI QIDQ2633607FDOQ2633607

Sergey Sevastyanov

Publication date: 9 May 2019

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2019.16.023

zbMATH Keywords

dynamic programmingschedulingopen shopproportionatemakespan minimizationpower of preemptionpolynomial time heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Open Shop Scheduling to Minimize Finish Time
• Scheduling ordered open shops
• Nonstrict vector summation in multi-operation scheduling
• Makespan minimization in open shops: A polynomial time approximation scheme
• Open shop scheduling with maximal machines
• When difference in machine loads leads to efficient scheduling in open shops
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• Linear time approximation scheme for the multiprocessor open shop problem
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• An Algorithm for the Open-Shop Problem
• Polynomial time approximation algorithms for proportionate open‐shop scheduling
• A polynomial-time open-shop problem with an arbitrary number of machines
• A polynomial algorithm for the three-machine open shop with a bottleneck machine

Cited In (6)

• On the complexity of proportionate open shop and job shop problems
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Exponential tightness for integral-type functionals of centered independent differently distributed random variables
• Approximation algorithms for two-machine proportionate routing open shop on a tree
• A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing

Recommendations

• A note on the complexity of the concurrent open shop problem 👍 👎
• A Position-Based Propagator for the Open-Shop Problem 👍 👎
• Open shops with jobs overlap -- revisited 👍 👎
• A new lower bound for the open-shop problem 👍 👎
• On the set of solutions of the open shop problem 👍 👎
• Stochastic Algorithms: Foundations and Applications 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Some positive news on the proportionate open shop problem

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