Scheduling with two competing agents to minimize total weighted earliness (Q2399317): 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/s10479-016-2310-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2520890933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent singe-machine scheduling with release times to minimize the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling on uniform parallel machines with min-max criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with two competing agents to minimized weighted earliness-tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine just‐in‐time scheduling problems with two competing agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a two-agent single-machine scheduling problem considering learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling with two competing agents to minimize total flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with two competing agents and equal job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two agents with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties / rank
 
Normal rank

Latest revision as of 06:55, 14 July 2024

scientific article
Language Label Description Also known as
English
Scheduling with two competing agents to minimize total weighted earliness
scientific article

    Statements

    Scheduling with two competing agents to minimize total weighted earliness (English)
    0 references
    0 references
    0 references
    0 references
    22 August 2017
    0 references
    two-agent scheduling
    0 references
    single machine
    0 references
    earliness
    0 references
    dynamic programming
    0 references
    0 references

    Identifiers