Single machine scheduling with step-deteriorating processing times (Q5952512): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling starting time dependent tasks with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time dependent machine makespan problem is strongly NP-complete / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs to minimize makespan / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(00)00284-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967121062 / rank
 
Normal rank

Latest revision as of 11:20, 30 July 2024

scientific article; zbMATH DE number 1690249
Language Label Description Also known as
English
Single machine scheduling with step-deteriorating processing times
scientific article; zbMATH DE number 1690249

    Statements