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

DOI10.1007/s10951-011-0252-yzbMath1280.90074OpenAlexW2006820870MaRDI QIDQ2434286

Jean-Charles Billaut, Nguyen Huynh Tuong, Ameur Soukhal

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-011-0252-y

zbMATH Keywords

complexityschedulingdynamic programmingsingle machinemulti-agent

Mathematics Subject Classification ID

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

Related Items

Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria ⋮ Complexities of four problems on two-agent scheduling ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Single-machine multi-agent scheduling problems with a global objective function ⋮ Unnamed Item ⋮ Competitive multi-agent scheduling with an iterative selection rule ⋮ Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A subset-sum type formulation of a two-agent single-machine scheduling problem ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ An Ordered Flow Shop with Two Agents ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Scheduling two agent task chains with a central selection mechanism

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the scheduling with two families of jobs
• Scheduling interfering job sets on parallel machines
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• A note on the complexity of the problem of two-agent scheduling on a single machine
• Single-machine multi-agent scheduling problems with a global objective function
• A multiple-criterion model for machine scheduling
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multicriteria scheduling
• Complexity of two dual criteria scheduling problems
• Scheduling Problems with Two Competing Agents
• Rescheduling for New Orders
• Scheduling with Multiple Performance Measures: The One-Machine Case
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey