On some geometric methods in scheduling theory: A survey

DOI10.1016/0166-218X(94)90036-1MaRDI QIDQ1337673zbMATH OpenFDO

Authors Sergey Sevastyanov

Publication date 3 April 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsNP-hardjob shopsclosed walkflow shopspolynomial running time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• The geometry of scheduling
• scientific article; zbMATH DE number 4108474
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• A survey of methods for the solution of problems of scheduling theory
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling
• scientific article; zbMATH DE number 3961323
• scientific article; zbMATH DE number 876684
• Geometric representation for semi on-line scheduling on uniform processors
• scientific article; zbMATH DE number 858989

Cites work

• scientific article; zbMATH DE number 3643014 (Why is no real title available?)
• scientific article; zbMATH DE number 3648725 (Why is no real title available?)
• scientific article; zbMATH DE number 3841604 (Why is no real title available?)
• scientific article; zbMATH DE number 3896632 (Why is no real title available?)
• scientific article; zbMATH DE number 3941251 (Why is no real title available?)
• scientific article; zbMATH DE number 3989090 (Why is no real title available?)
• scientific article; zbMATH DE number 4108474 (Why is no real title available?)
• scientific article; zbMATH DE number 3708084 (Why is no real title available?)
• scientific article; zbMATH DE number 3711748 (Why is no real title available?)
• scientific article; zbMATH DE number 3748435 (Why is no real title available?)
• scientific article; zbMATH DE number 3788364 (Why is no real title available?)
• scientific article; zbMATH DE number 22820 (Why is no real title available?)
• scientific article; zbMATH DE number 41713 (Why is no real title available?)
• scientific article; zbMATH DE number 3562776 (Why is no real title available?)
• scientific article; zbMATH DE number 3799380 (Why is no real title available?)
• scientific article; zbMATH DE number 4186507 (Why is no real title available?)
• scientific article; zbMATH DE number 3078696 (Why is no real title available?)
• A Non-Numerical Approach to Production Scheduling Problems
• A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
• An Algorithm for the Open-Shop Problem
• An approximate algorithm for the three-machine problem
• Bounding algorithm for the routing problem with arbitrary paths and alternative servers
• Minimization of the production line work cycle
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Scheduling a three-machine job shop
• The Steinitz constant of the plane.
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• ``Integer-making theorems

Cited in

(27)

• Maximum inequalities for rearrangements of summands and assignments of signs
• Rearrangements of series
• Complexity, bounds and dynamic programming algorithms for single track train scheduling
• Grouping techniques for scheduling problems: simpler and faster
• Performance guarantees for flowshop heuristics to minimize makespan
• scientific article; zbMATH DE number 1462947 (Why is no real title available?)
• Reroute sequence planning in telecommunication networks and compact vector summation.
• Concurrent flowshop scheduling to minimize makespan.
• The flow shop problem with no-idle constraints: a review and approximation
• scientific article; zbMATH DE number 4108474 (Why is no real title available?)
• A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines
• A Meeting Scheduling Problem Respecting Time and Space
• Approximation and online algorithms for multidimensional bin packing: a survey
• Scheduling of a single crane in batch annealing process
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• A linear time approximation algorithm for permutation flow shop scheduling
• The open shop scheduling problem
• Vector summation within minimal angle
• Dynamic of error diffusion on several polytopes
• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
• Scheduling jobshops with some identical or similar jobs
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
• Flexible flow shop scheduling with uniform parallel machines
• A fluid approach to large volume job shop scheduling
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
• A hybrid genetic algorithm for the open shop scheduling problem

This page was built for publication: On some geometric methods in scheduling theory: A survey

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