Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ODO project: Toward a unified basis for constraint-directed scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-directed techniques for scheduling alternative activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The job shop scheduling problem: Conventional and new solution techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying constraint satisfaction techniques to job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the set of feasible sequences for n jobs to be carried out on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3489490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing constraint expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: KI-94: Advances in artificial intelligence. 18th German annual conference on artificial intelligence, Saarbrücken, Germany, September 18-23, 1994. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to computing optimal schedules for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank

Revision as of 15:30, 29 May 2024

scientific article
Language Label Description Also known as
English
Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
scientific article

    Statements

    Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (English)
    0 references
    0 references
    0 references
    4 June 2000
    0 references
    scheduling
    0 references
    heuristic search
    0 references
    constraints
    0 references
    problem structure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers