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

DOI10.1007/S10479-012-1099-0MaRDI QIDQ744634zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

parallel machinesmulti-agent schedulingPareto optimum

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 871899 (Why is no real title available?)
• A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
• A multiple-criterion model for machine scheduling
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
• A note on scheduling equal-length jobs to maximize throughput
• A note on scheduling multiprocessor tasks with identical processing times.
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A note on the scheduling with two families of jobs
• Bicriterion scheduling of identical processing time jobs by uniform processors
• Bound sets for biobjective combinatorial optimization problems
• Competitive two-agent scheduling and its applications
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
• Scheduling Problems with Two Competing Agents
• Scheduling equal-length jobs on identical parallel machines
• Scheduling identical jobs on uniform parallel machines
• Scheduling interfering job sets on parallel machines
• Scheduling jobs with equal processing times and time windows on identical parallel machines
• Scheduling two agents on uniform parallel machines with~makespan and cost functions
• Single machine scheduling with interfering job sets

Cited in

(27)

• 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
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
• Two-agent single-machine scheduling with release dates to minimize the makespan
• scientific article; zbMATH DE number 7109369 (Why is no real title available?)
• Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
• 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
• Two-agent scheduling to minimize the maximum cost with position-dependent jobs
• Two-agent scheduling in a two-machine open shop
• Bicriteria multi-machine scheduling with equal processing times subject to release dates
• An approximation algorithm for multi-agent scheduling on two uniform parallel machines
• Scheduling two agents on uniform parallel machines with~makespan and cost functions
• A survey of due-date related single-machine with two-agent scheduling problem
• Single machine scheduling with two competing agents and equal job processing times
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
• Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines
• Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
• Scheduling with two competing agents to minimize total weighted earliness
• Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
• Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
• Two-agent vehicle scheduling problem on a line-shaped network
• A two-agent single-machine scheduling problem to minimize the total cost with release dates
• Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
• Bicriteria scheduling of equal length jobs on uniform parallel machines

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)