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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.camwa.2006.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081974353 / 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 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:51, 29 June 2024

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

    Statements

    Single-machine scheduling problems with start-time dependent processing time (English)
    0 references
    0 references
    0 references
    27 January 2009
    0 references
    0 references
    single-machine
    0 references
    scheduling
    0 references
    time dependent
    0 references
    makespan
    0 references
    completion time
    0 references
    0 references