Two-machine flow shop total tardiness scheduling problem with deteriorating jobs (Q1930748): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Machine Scheduling With Linear Deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard cases in scheduling deteriorating jobs on dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5047629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling problems with deteriorating jobs under dominating machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time in a two-machine flow shop with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine total completion time scheduling with a time-dependent deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine quadratic penalty function scheduling with deteriorating jobs and group technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine due-window assignment problem with learning effect and deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications / 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: Minimizing tardiness in a two-machine flow-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops / rank
 
Normal rank

Latest revision as of 02:50, 6 July 2024

scientific article
Language Label Description Also known as
English
Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
scientific article

    Statements

    Two-machine flow shop total tardiness scheduling problem with deteriorating jobs (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2013
    0 references
    0 references
    flow shop
    0 references
    scheduling
    0 references
    deteriorating job
    0 references
    branch and bound algorithm
    0 references
    heuristic algorithm
    0 references
    0 references
    0 references
    0 references