A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-007-0044-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2129215899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two parallel machine sequencing problems involving controllable job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling with deadlines and resource dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some comments on sequencing with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling subject to deadlines and resource dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5806966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases / 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: Single machine scheduling with a variable common due date and resource-dependent processing times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine / 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: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling to minimize total completion time and resource consumption costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with controllable release and processing parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in sequencing / rank
 
Normal rank

Latest revision as of 20:01, 28 June 2024

scientific article
Language Label Description Also known as
English
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
scientific article

    Statements

    A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2008
    0 references
    0 references
    bicriteria
    0 references
    single machine scheduling
    0 references
    convex resource allocation
    0 references
    maximal lateness
    0 references
    0 references
    0 references
    0 references