A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666): 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.1007/s11590-010-0202-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016335388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / 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: Approximability of two-machine no-wait flowshop scheduling with availability constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs subject to job or machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs with an availability constraint on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / 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: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for two-machine no-wait flowshop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance / rank
 
Normal rank

Latest revision as of 21:25, 3 July 2024

scientific article
Language Label Description Also known as
English
A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
scientific article

    Statements

    A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (English)
    0 references
    14 March 2011
    0 references
    0 references
    makespan
    0 references
    0 references
    0 references
    0 references
    0 references