Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Interval scheduling on identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-coloring of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines / 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: Two-agent scheduling with position-based deteriorating jobs and learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the weighted number of just-in-time jobs in flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling in a flowshop / 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: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs / 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: Fixed interval scheduling: models, applications, computational complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize the number of early and tardy 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: Just-in-time scheduling with controllable processing times on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded parallel-batching scheduling with two competitive agents / 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: Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times / 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: 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: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The just-in-time scheduling problem in a flow-shop scheduling system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time in a proportionate flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing weighted number of just-in-time jobs on unrelated parallel machines / 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: Minimizing weighted number of early and tardy jobs with a common due window involving location penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent single-machine scheduling with assignable due dates / 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 08:13, 14 July 2024

scientific article
Language Label Description Also known as
English
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
scientific article

    Statements

    Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 August 2017
    0 references
    0 references
    two-agent scheduling
    0 references
    flowshop
    0 references
    bicriterion analysis
    0 references
    two-dimensional FPTAS
    0 references
    0 references