Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677): 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.1007/s10951-022-00723-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4220678367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A permutation flow-shop scheduling problem with convex models of operation processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Management in Machine Scheduling Problems: A Survey / 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: Machine scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Independent Tasks with Deadlines on Semi-identical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:42, 29 July 2024

scientific article
Language Label Description Also known as
English
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
scientific article

    Statements

    Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (English)
    0 references
    0 references
    0 references
    27 May 2022
    0 references
    scheduling
    0 references
    convex resource consumption functions
    0 references
    machine unavailability period
    0 references
    computational complexity
    0 references
    inapproximability
    0 references

    Identifiers