Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6570940 / rank
 
Normal rank
Property / zbMATH Keywords
 
single machine scheduling
Property / zbMATH Keywords: single machine scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
two competing agents
Property / zbMATH Keywords: two competing agents / rank
 
Normal rank
Property / zbMATH Keywords
 
arbitrary release dates
Property / zbMATH Keywords: arbitrary release dates / rank
 
Normal rank
Property / zbMATH Keywords
 
unit processing times
Property / zbMATH Keywords: unit processing times / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\mathcal{NP}\)-hard
Property / zbMATH Keywords: \(\mathcal{NP}\)-hard / rank
 
Normal rank
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-015-2054-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2225647301 / 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: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling with Unit Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates on a single machine to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit processing time jobs on a single machine with multiple criteria / 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: Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs / 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 two agents on uniform parallel machines with~makespan and cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit-time tasks with integer release times and deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Agent Scheduling on an Unbounded Serial Batching Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine problems with equal processing times: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of unit-length independent tasks with execution constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times subject to machine eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single-machine scheduling problem with two-agent and deteriorating jobs / 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: Scheduling unit-length jobs with machine eligibility restrictions / 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: Open-shop batch scheduling with identical jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs / 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: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``Scheduling unit-time tasks with integer release times and deadlines'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the scheduling with two families of jobs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:23, 11 July 2024

scientific article
Language Label Description Also known as
English
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
scientific article

    Statements

    Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (English)
    0 references
    0 references
    0 references
    20 April 2016
    0 references
    single machine scheduling
    0 references
    two competing agents
    0 references
    arbitrary release dates
    0 references
    unit processing times
    0 references
    \(\mathcal{NP}\)-hard
    0 references
    0 references
    0 references

    Identifiers