On some geometric methods in scheduling theory: A survey (Q1337673): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q1337672 / rank | |||
Property / author | |||
Property / author: Sergey Sevast'janov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Non-Numerical Approach to Production Scheduling Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling a three-machine job shop / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4135202 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimization of the production line work cycle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Steinitz constant of the plane. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5751506 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4744042 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ``Integer-making'' theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3751359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An approximate algorithm for the three-machine problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048552 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithm for the Open-Shop Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5817584 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3206965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3899809 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3902823 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3965901 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3932314 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3312008 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3675864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3713848 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounding algorithm for the routing problem with arbitrary paths and alternative servers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3832311 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3980665 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994687 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:21, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On some geometric methods in scheduling theory: A survey |
scientific article |
Statements
On some geometric methods in scheduling theory: A survey (English)
0 references
3 April 1995
0 references
closed walk
0 references
approximation algorithms
0 references
polynomial running time
0 references
flow shops
0 references
job shops
0 references
NP-hard
0 references
0 references
0 references