Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 19:35, 30 December 2024

scientific article; zbMATH DE number 7712131

Language	Label	Description	Also known as
English	Competitive two-agent scheduling with release dates and preemption on a single machine	scientific article; zbMATH DE number 7712131

Statements

scholarly article

0 references

Competitive two-agent scheduling with release dates and preemption on a single machine (English)

0 references

0 references

0 references

Journal of Scheduling

0 references

publication date

13 July 2023

0 references

zbMATH Keywords

scheduling

0 references

single-machine

0 references

two-agent

0 references

release date

0 references

preemption

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/s10951-023-00779-5

0 references

Multiagent Scheduling

0 references

Price of fairness in two-agent single-machine scheduling problems

0 references

Scheduling Problems with Two Competing Agents

0 references

Multi-agent single machine scheduling

0 references

A multiple-criterion model for machine scheduling

0 references

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

0 references

Scheduling equal-length jobs on identical parallel machines

0 references

Preemptive scheduling of equal-length jobs to maximize weighted throughput.

0 references

0 references

Hard Real-Time Computing Systems

0 references

The one-machine sequencing problem

0 references

Pareto-scheduling of two competing agents with their own equal processing times

0 references

The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs

0 references

Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

0 references

Multi-agent scheduling on a single machine with max-form criteria

0 references

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times

0 references

Minimizing Total Tardiness on One Machine is NP-Hard

0 references

Scheduling two agents on uniform parallel machines with~makespan and cost functions

0 references

Two-agent scheduling on uniform parallel machines with min-max criteria

0 references

A note on competing-agent Pareto-scheduling

0 references

Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness

0 references

Online real-time preemptive scheduling of jobs with deadlines on multiple machines

0 references

Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work

0 references

Multicriteria scheduling

0 references

Some simple scheduling algorithms

0 references

Single-machine multi-agent scheduling problems with a global objective function

0 references

Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications

0 references

Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity

0 references

Parallel machine problems with equal processing times: a survey

0 references

0 references

A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

0 references

Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property

0 references

A Functional Equation and its Application to Resource Allocation and Sequencing Problems

0 references

0 references

Competitive Two-Agent Scheduling and Its Applications

0 references

Two‐agent scheduling on a single sequential and compatible batching machine

0 references

Single-machine scheduling with multi-agents to minimize total weighted late work

0 references

An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

0 references

A note on the complexity of the problem of two-agent scheduling on a single machine

0 references

Single machine scheduling with two competing agents and equal job processing times

0 references

A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems

0 references

Preemptive scheduling with two minimax criteria

0 references

An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

0 references

Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs

0 references

A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints

0 references

Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost

0 references

Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria

0 references

Due date-related scheduling with two agents. Models and algorithms

0 references

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness

0 references

Scheduling with release dates and preemption to minimize multiple max-form objective functions

0 references

A note on a two-agent scheduling problem related to the total weighted late work

0 references

Bicriteria scheduling of equal length jobs on uniform parallel machines

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10951-023-00779-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6116025

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6116025&oldid=39709065"