Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.07.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034255737 / 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: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425494 / 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: Multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric problem in scheduling theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: V-Shaped Policies for Scheduling Deteriorating Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837425 / 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: Parallel Processing and Applied Mathematics / 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: Scheduling jobs with varying processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with time dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233364 / 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: Complexity analysis of job-shop scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3489778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two machine open shop scheduling problems with bi-criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing a Function of Permutations of <i>n</i> Integers / rank
 
Normal rank

Latest revision as of 16:01, 10 June 2024

scientific article
Language Label Description Also known as
English
Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
scientific article

    Statements

    Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (English)
    0 references
    0 references
    0 references
    29 September 2005
    0 references
    single machine
    0 references
    deteriorating jobs
    0 references
    bicriterion scheduling
    0 references
    Pareto optimality
    0 references
    total completion time
    0 references
    maximum completion time
    0 references

    Identifiers

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