A dynamic job shop scheduling framework: a backward approach (Q4394248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / 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: Optimal due-date assignment in a job shop† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative Formulation of the Job Shop Problem with Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due Date Assignment for Production Systems / rank
 
Normal rank

Latest revision as of 12:54, 28 May 2024

scientific article; zbMATH DE number 1162716
Language Label Description Also known as
English
A dynamic job shop scheduling framework: a backward approach
scientific article; zbMATH DE number 1162716

    Statements

    A dynamic job shop scheduling framework: a backward approach (English)
    0 references
    11 June 1998
    0 references
    0 references
    dynamic scheduling
    0 references
    due-date assignment
    0 references
    job release times
    0 references
    backward scheduling
    0 references
    rolling time window approach
    0 references
    0 references