Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problems with minimal and maximal delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for flow-shop and open-shop scheduling problems with transportation delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the job-shop with time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop Problems With Two Machines and Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation flowshop scheduling problems with maximal and minimal time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search with path relinking for the job shop with time lags and setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search heuristics for two-stage flow shop problems with secondary criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple and bicriteria scheduling: A literature survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for the two-stage bicriteria flowshop problem / 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: Two-Stage Flowshop Scheduling Problem with Bicriteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with a secondary criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884350 / rank
 
Normal rank

Latest revision as of 03:54, 17 July 2024

scientific article
Language Label Description Also known as
English
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
scientific article

    Statements

    Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (English)
    0 references
    31 October 2018
    0 references
    scheduling
    0 references
    non-permutation flowshop
    0 references
    time lags
    0 references
    mathematical programming
    0 references
    heuristics
    0 references
    lexicographic optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references