Two-agent scheduling of time-dependent jobs (Q2410089): 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/s10878-016-9994-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2344163047 / 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: Multiagent Scheduling / 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 multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent scheduling on a single machine with max-form criteria / 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: Complexity of scheduling tasks with time-dependent execution times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Two-Agent Scheduling and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent single-machine scheduling problems under increasing linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling start time dependent jobs to minimize the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the problem of two-agent scheduling on a single machine / 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: A note on single-machine scheduling with decreasing time-dependent job 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
Property / cites work
 
Property / cites work: A note on the scheduling with two families of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5047629 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:21, 14 July 2024

scientific article
Language Label Description Also known as
English
Two-agent scheduling of time-dependent jobs
scientific article

    Statements

    Two-agent scheduling of time-dependent jobs (English)
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    scheduling
    0 references
    two agents
    0 references
    deteriorating jobs
    0 references
    shortening jobs
    0 references
    total completion time
    0 references
    maximum cost
    0 references
    0 references
    0 references
    0 references

    Identifiers