Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.04.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045611123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpreemptive flowshop scheduling with machine dominance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with dominant machines / 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: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shops with a dominant machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results in flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-wait or no-idle permutation flowshop scheduling with dominating machines / rank
 
Normal rank

Latest revision as of 12:24, 25 June 2024

scientific article
Language Label Description Also known as
English
Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
scientific article

    Statements

    Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    scheduling
    0 references
    flow shop
    0 references
    discounted total weighed completion time
    0 references
    polynomial time algorithm
    0 references
    0 references