A variant of the permutation flow shop model with variable processing times (Q1363747): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q309057
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Gerd Finke / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with nonlinear cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Shop Scheduling with Resource Flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: General flow-shop scheduling with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine permutation flow shop with state-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of a class of DEDS: Flow-shops with state-dependent processing times / rank
 
Normal rank

Latest revision as of 17:11, 27 May 2024

scientific article
Language Label Description Also known as
English
A variant of the permutation flow shop model with variable processing times
scientific article

    Statements

    A variant of the permutation flow shop model with variable processing times (English)
    0 references
    0 references
    0 references
    24 February 1998
    0 references
    makespan minimization
    0 references
    variable processing times
    0 references
    flow shop
    0 references
    infinite buffer capacities
    0 references
    greedy placement algorithm
    0 references

    Identifiers