Two-agent scheduling on uniform parallel machines with min-max criteria
From MaRDI portal
Publication:744634
DOI10.1007/S10479-012-1099-0zbMATH Open1296.90043OpenAlexW2084819354MaRDI QIDQ744634FDOQ744634
Donatas Elvikis, Vincent T'kindt
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1099-0
Recommendations
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- scientific article; zbMATH DE number 7109369
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- A multiple-criterion model for machine scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- A note on the scheduling with two families of jobs
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- Bound sets for biobjective combinatorial optimization problems
- Scheduling equal-length jobs on identical parallel machines
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Scheduling identical jobs on uniform parallel machines
- Scheduling interfering job sets on parallel machines
- Single machine scheduling with interfering job sets
- 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
- Bicriterion scheduling of identical processing time jobs by uniform processors
- A note on scheduling multiprocessor tasks with identical processing times.
- Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
- Title not available (Why is that?)
Cited In (25)
- Two-agent scheduling to minimize the maximum cost with position-dependent jobs
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Bicriteria multi-machine scheduling with equal processing times subject to release dates
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- A survey of due-date related single-machine with two-agent scheduling problem
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines
- Scheduling with two competing agents to minimize total weighted earliness
- Pareto-scheduling of two competing agents with their own equal processing times
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Two-agent scheduling in a two-machine open shop
- Title not available (Why is that?)
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- Two-agent vehicle scheduling problem on a line-shaped network
- Two-agent single-machine scheduling with release dates to minimize the makespan
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
This page was built for publication: Two-agent scheduling on uniform parallel machines with min-max criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744634)
