Single machine batch scheduling with two competing agents to minimize total flowtime
From MaRDI portal
Publication:420859
DOI10.1016/j.ejor.2011.06.037zbMath1238.90069OpenAlexW1973777183MaRDI QIDQ420859
Publication date: 23 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.037
Related Items (30)
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 ⋮ Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ Two-agent scheduling in a flowshop ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ A note on batch scheduling on a two-machine flowshop with machine-dependent processing times ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing ⋮ Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ Two-agent scheduling on a single machine with release dates ⋮ A Batch Scheduling Problem with Two Agents ⋮ Scheduling to minimize the maximum total completion time per machine ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times
Cites Work
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Batching in single operation manufacturing systems
- One-pass batching algorithms for the one-machine problem
- A polynomial algorithm for a one machine batching problem
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- A survey of scheduling problems with setup times or costs
- A single machine batch scheduling problem with bounded batch size
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Minimizing flow-time on a single machine with integer batch sizes
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Scheduling Problems with Two Competing Agents
This page was built for publication: Single machine batch scheduling with two competing agents to minimize total flowtime
