On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-012-1290-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981253957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling with Unit Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of optimal schedules in preemptive shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation Guarantees for Job-Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan Minimization in Job Shops: A Linear Time Approximation Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete 4-parametric complexity classification of short shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Permutation Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation vs. non-permutation flow shop schedules / 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: On some geometric methods in scheduling theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonstrict vector summation in multi-operation scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in preemptive two machine job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank

Latest revision as of 02:44, 9 July 2024

scientific article
Language Label Description Also known as
English
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
scientific article

    Statements

    On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2014
    0 references
    job shop
    0 references
    preemption
    0 references
    regular criterion
    0 references
    optimal schedule
    0 references
    greedy algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers