Multiagent Scheduling
From MaRDI portal
Publication:5402189
DOI10.1007/978-3-642-41880-8zbMath1286.90002OpenAlexW4236796530MaRDI QIDQ5402189
Stanisław Gawiejnowicz, Jean-Charles Billaut, Ameur Soukhal, Dario Pacciarelli, Alessandro Agnetis
Publication date: 6 March 2014
Full work available at URL: https://doi.org/10.1007/978-3-642-41880-8
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
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 ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Dynamic scheduling with uncertain job types ⋮ Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives ⋮ Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation ⋮ Multitasking scheduling problems with two competitive agents ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ An alternative approach for proving the NP-hardness of optimization problems ⋮ Two-agent scheduling in a flowshop ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Bicriteria scheduling for due date assignment with total weighted tardiness ⋮ Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria ⋮ Scheduling on parallel processors with varying processing times ⋮ Competitive project scheduling on two unbounded parallel batch machines ⋮ Unary NP-hardness of minimizing the number of tardy jobs with deadlines ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Efficiency and equity in the multi organization scheduling problem ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Two-agent parallel-machine scheduling with rejection ⋮ Hierarchical optimization on an unbounded parallel-batching machine ⋮ Precedence constrained parallel-machine scheduling of position-dependent jobs ⋮ Two-agent scheduling of time-dependent jobs ⋮ Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Two-agent single-machine scheduling with a rate-modifying activity ⋮ An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Collective schedules: axioms and algorithms ⋮ A note on a two-agent scheduling problem related to the total weighted late work ⋮ Minmax scheduling problems with common due-date and completion time penalty ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ 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 ⋮ Single machine scheduling with a generalized job-dependent cumulative effect ⋮ Multi-project scheduling problem under shared multi-skill resource constraints ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects ⋮ New results for an open time-dependent scheduling problem ⋮ Scheduling jobs with a V-shaped time-dependent processing time ⋮ Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times ⋮ Price of fairness in two-agent single-machine scheduling problems ⋮ A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection ⋮ A just-in-time scheduling problem with two competing agents ⋮ Improved algorithms for two-agent scheduling on an unbounded serial-batching machine ⋮ Competitive multi-agent scheduling with an iterative selection rule ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan ⋮ Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs ⋮ Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks ⋮ A note on competing-agent Pareto-scheduling ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ Complexities of some problems on multi-agent scheduling on a single machine ⋮ Two-agent scheduling on a single machine with release dates ⋮ Single machine batch scheduling with two non-disjoint agents and splitable jobs ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ Complexity of scheduling with proportional deterioration and release dates ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Bicriteria scheduling of equal length jobs on uniform parallel machines ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines ⋮ Shared processor scheduling ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads ⋮ Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect ⋮ A two-machine no-wait flow shop problem with two competing agents ⋮ An uncertain parallel machine problem with deterioration and learning effect ⋮ A unified analysis for scheduling problems with variable processing times ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost ⋮ The price of fairness for a two-agent scheduling game minimizing total completion time ⋮ Two-agent scheduling problems with the general position-dependent processing time
This page was built for publication: Multiagent Scheduling
