Scheduling two agents on uniform parallel machines with~makespan and cost functions
From MaRDI portal
Publication:2434250
DOI10.1007/s10951-010-0201-1zbMath1280.90042OpenAlexW2048216313MaRDI QIDQ2434250
Donatas Elvikis, Horst W. Hamacher, Vincent T'kindt
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0201-1
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (16)
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Two-agent single-machine scheduling with a rate-modifying activity ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Faster algorithms for bicriteria scheduling of identical jobs on uniform machines ⋮ Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ Bicriteria scheduling of equal length jobs on uniform parallel machines ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines
Cites Work
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- A note on the scheduling with two families of jobs
- A note on scheduling equal-length jobs to maximize throughput
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- Scheduling interfering job sets on parallel machines
- Bicriterion scheduling of identical processing time jobs by uniform processors
- A note on scheduling multiprocessor tasks with identical processing times.
- Scheduling equal-length jobs on identical parallel machines
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling identical jobs on uniform parallel machines
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Multicriteria Optimization
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Scheduling two agents on uniform parallel machines with~makespan and cost functions
