One-machine rescheduling heuristics with efficiency and stability as criteria (Q1201849): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Search Method to Locate Negative Cycles in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / 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: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem and Heuristic Space Search Strategies for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank

Latest revision as of 13:13, 17 May 2024

scientific article
Language Label Description Also known as
English
One-machine rescheduling heuristics with efficiency and stability as criteria
scientific article

    Statements

    One-machine rescheduling heuristics with efficiency and stability as criteria (English)
    0 references
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    heuristics
    0 references
    rescheduling a machine
    0 references
    unforeseen disruption
    0 references
    makespan
    0 references

    Identifiers