Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zu-Ren Feng / rank
Normal rank
 
Property / author
 
Property / author: Zu-Ren Feng / rank
 
Normal rank
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.1007/s10479-010-0827-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978460437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-machine scheduling with earliness, tardiness and completion time penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / 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: Q3741388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex resource allocation for minimizing the makespan in a single machine with job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted flow time in a single machine with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with a convex resource consumption function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis / rank
 
Normal rank

Latest revision as of 16:29, 4 July 2024

scientific article
Language Label Description Also known as
English
Single machine scheduling with total tardiness criterion and convex controllable processing times
scientific article

    Statements

    Single machine scheduling with total tardiness criterion and convex controllable processing times (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2011
    0 references
    0 references
    single machine
    0 references
    total tardiness criteria
    0 references
    convex resource consumption function
    0 references
    0 references