Some positive news on the proportionate open shop problem

DOI10.33048/SEMI.2019.16.023zbMath1414.90169OpenAlexW3015953147MaRDI QIDQ2633607

Sergey Sevast'janov

Publication date: 9 May 2019

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

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

zbMATH Keywords

schedulingdynamic programmingopen shopmakespan minimizationproportionatepower of preemptionpolynomial time heuristic

Mathematics Subject Classification ID

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

Related Items (6)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• Scheduling ordered open shops
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• Nonstrict vector summation in multi-operation scheduling
• Makespan minimization in open shops: A polynomial time approximation scheme
• Open shop scheduling with maximal machines
• 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
• When difference in machine loads leads to efficient scheduling in open shops
• Open Shop Scheduling to Minimize Finish Time
• An Algorithm for the Open-Shop Problem
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• Polynomial time approximation algorithms for proportionate open‐shop scheduling
• Linear time approximation scheme for the multiprocessor open shop problem

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