On not-first/not-last conditions in disjunctive scheduling (Q1590039): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BL data set / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / 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: A practical use of Jackson's preemptive schedule 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: Heuristics for large constrained vehicle routing problems / 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: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine / 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: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849545 / rank
 
Normal rank

Latest revision as of 11:19, 3 June 2024

scientific article
Language Label Description Also known as
English
On not-first/not-last conditions in disjunctive scheduling
scientific article

    Statements

    On not-first/not-last conditions in disjunctive scheduling (English)
    0 references
    0 references
    0 references
    19 December 2000
    0 references
    0 references
    constraint propagation
    0 references
    edge-finding
    0 references
    time-bound adjustment
    0 references
    branch and bound
    0 references
    job shop
    0 references
    lower bounds
    0 references