Scheduling linear deteriorating jobs with rejection on a single machine (Q953419): 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.ejor.2007.11.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059434334 / 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: Minimizing maximum lateness under linear deterioration / 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: Q4875173 / 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: Single machine scheduling with step-deteriorating processing times / 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: Due-date assignment and single machine scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: On-line uniform machine scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753942 / 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 with late start penalties added to processing times in a single facility scheduling problem / 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: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive multiprocessor scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with start time dependent processing times: Some solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252365 / 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: Flow shop scheduling problems with deteriorating jobs under dominating machines / rank
 
Normal rank

Latest revision as of 19:54, 28 June 2024

scientific article
Language Label Description Also known as
English
Scheduling linear deteriorating jobs with rejection on a single machine
scientific article

    Statements

    Scheduling linear deteriorating jobs with rejection on a single machine (English)
    0 references
    0 references
    0 references
    20 November 2008
    0 references
    scheduling
    0 references
    deteriorating jobs
    0 references
    rejection
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers