Scheduling time-dependent jobs under mixed deterioration (Q963924): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.amc.2010.01.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071839775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / 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: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling tasks with time-dependent execution times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling problems with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling of step deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent time-dependent scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate problems in time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine parallel-batch scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling problems with deteriorating jobs under disruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximability of scheduling resumable proportionally deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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: Technical Note—Minimizing a Function of Permutations of <i>n</i> Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / 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: Minimizing the total weighted completion time of deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum lateness under linear deterioration / rank
 
Normal rank

Latest revision as of 17:14, 2 July 2024

scientific article
Language Label Description Also known as
English
Scheduling time-dependent jobs under mixed deterioration
scientific article

    Statements

    Scheduling time-dependent jobs under mixed deterioration (English)
    0 references
    14 April 2010
    0 references
    0 references
    single machine
    0 references
    polynomial-time algorithms
    0 references
    \(\mathcal{NP}\)-hard problems
    0 references
    0 references
    0 references
    0 references
    0 references