Single-machine multi-agent scheduling problems with a global objective function
From MaRDI portal
Publication:2434286
DOI10.1007/S10951-011-0252-YzbMATH Open1280.90074OpenAlexW2006820870MaRDI QIDQ2434286FDOQ2434286
Authors: Nguyen Huynh Tuong, J.-C. Billaut, A. 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
Recommendations
- Solving multi-agent scheduling problems on parallel machines with a global objective function
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Complexities of some problems on multi-agent scheduling on a single machine
- Multi-agent single machine scheduling problem with transportation constraints
- Single-machine scheduling with multi-agents to minimize total weighted late work
- An agent-based approach for scheduling multiple machines
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Scheduling Problems with Two Competing Agents
- 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
- One-machine rescheduling heuristics with efficiency and stability as criteria
- Multicriteria scheduling
- 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
- Scheduling interfering job sets on parallel machines
- Single-machine multi-agent scheduling problems with a global objective function
- Rescheduling for New Orders
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Title not available (Why is that?)
- Complexity of two dual criteria scheduling problems
Cited In (23)
- Solving multi-agent scheduling problems on parallel machines with a global objective function
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Multi-agent single machine scheduling problem with transportation constraints
- A subset-sum type formulation of a two-agent single-machine scheduling problem
- Competitive multi-agent scheduling with an iterative selection rule
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- Scheduling two agent task chains with a central selection mechanism
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- An ordered flow shop with two agents
- Complexities of four problems on two-agent scheduling
- Multiagent scheduling. Models and algorithms
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Multi-agent single machine scheduling
- A two-agent single-machine scheduling problem with late work criteria
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- Title not available (Why is that?)
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Single-machine multi-agent scheduling problems with a global objective function
This page was built for publication: Single-machine multi-agent scheduling problems with a global objective function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434286)
