Single machine scheduling with two competing agents and equal job processing times (Q319290): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972249265 / 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: 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: Complexity of single machine scheduling subject to nonnegative inventory constraints / 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 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: Multicriteria optimization / 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: Two-agent scheduling on uniform parallel machines with min-max criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved FPTAS for Restricted Shortest Path. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on multi-constrained optimal path computation: exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path 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: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time / 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: Competitive Two-Agent Scheduling and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple efficient approximation scheme for the restricted shortest path problem / 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: Real-time scheduling with a budget / 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: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time / 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: 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

Latest revision as of 16:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Single machine scheduling with two competing agents and equal job processing times
scientific article

    Statements

    Single machine scheduling with two competing agents and equal job processing times (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    0 references
    single machine scheduling
    0 references
    two competing agents
    0 references
    equal processing times
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references