Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
From MaRDI portal
Publication:4835387
DOI10.1287/moor.20.1.90zbMath0834.90074OpenAlexW2081422334MaRDI QIDQ4835387
Publication date: 14 June 1995
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.20.1.90
Deterministic scheduling theory in operations research (90B35) Programming in abstract spaces (90C48)
Related Items
On some geometric methods in scheduling theory: A survey, Some positive news on the proportionate open shop problem, The three-machine proportionate open shop and mixed shop minimum makespan problems, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Open shop scheduling with maximal machines, The Open Shop Scheduling Problem, Approximating a two-machine flow shop scheduling under discrete scenario uncertainty, Unnamed Item, Concurrent flowshop scheduling to minimize makespan., Four decades of research on the open-shop scheduling problem to minimize the makespan, An improved NEH heuristic to minimize makespan in permutation flow shops, A note on scheduling flowshops with flexible stage ordering, The three-stage assembly flowshop scheduling problem, Parameterized complexity of machine scheduling: 15 open problems, Open block scheduling in optical communication networks, The flow shop problem with no-idle constraints: a review and approximation, An empirical analysis of the optimality rate of flow shop heuristics, Heuristics for the two-stage job shop scheduling problem with a bottleneck machine, A new constructive heuristic for the flowshop scheduling problem, Flexible flow shop scheduling with uniform parallel machines, Performance guarantees for flowshop heuristics to minimize makespan, Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage
