On some geometric methods in scheduling theory: A survey

DOI10.1016/0166-218X(94)90036-1zbMATH Open0809.90082MaRDI QIDQ1337673FDOQ1337673

Authors: Sergey Sevastyanov 

Publication date: 3 April 1995

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

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

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)

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• Title not available (Why is that?)
• Open Shop Scheduling to Minimize Finish Time
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• Title not available (Why is that?)
• A Non-Numerical Approach to Production Scheduling Problems
• ``Integer-making theorems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Steinitz constant of the plane.
• An Algorithm for the Open-Shop Problem
• Bounding algorithm for the routing problem with arbitrary paths and alternative servers
• A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
• Title not available (Why is that?)
• Title not available (Why is that?)
• An approximate algorithm for the three-machine problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimization of the production line work cycle
• Scheduling a three-machine job shop
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (27)

• Rearrangements of series
• Complexity, bounds and dynamic programming algorithms for single track train scheduling
• Grouping techniques for scheduling problems: simpler and faster
• Title not available (Why is that?)
• Performance guarantees for flowshop heuristics to minimize makespan
• 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
• Title not available (Why is that?)
• A Meeting Scheduling Problem Respecting Time and Space
• A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines
• 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
• Flexible flow shop scheduling with uniform parallel machines
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
• 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
• Maximum inequalities for rearrangements of summands and assignments of signs

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)