Single-machine scheduling problems with start-time dependent processing time (Q2519639): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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 Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions / 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: Minimizing the makespan in a single machine scheduling problem with a time-based learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution / rank
 
Normal rank

Latest revision as of 23:51, 28 June 2024

scientific article
Language Label Description Also known as
English
Single-machine scheduling problems with start-time dependent processing time
scientific article

    Statements

    Identifiers