scientific article; zbMATH DE number 3799380
From MaRDI portal
zbMath0506.90036MaRDI QIDQ4744042
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On some geometric methods in scheduling theory: A survey, Some positive news on the proportionate open shop problem, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Flexible open shop scheduling problem to minimize makespan, A study on several combination problems of classic shop scheduling and shortest path, Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival, Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms, The Open Shop Scheduling Problem, Optimal results and numerical simulations for flow shop scheduling problems, A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints, Open-shop dense schedules: properties and worst-case performance ratio, Reroute sequence planning in telecommunication networks and compact vector summation., Four decades of research on the open-shop scheduling problem to minimize the makespan, Dense open-shop schedules with release times, How good is a dense shop schedule?, Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem, A polynomial-time open-shop problem with an arbitrary number of machines, Three-machine open shop with a bottleneck machine revisited, Polynomial time approximation algorithms for proportionate open‐shop scheduling, Two-stage open shop scheduling with a bottleneck machine, Worst-case analysis of heuristics for open shops with parallel machines, A linear time approximation scheme for makespan minimization in an open shop with release dates
