Unbounded parallel-batching scheduling with two competitive agents
From MaRDI portal
Publication:2434303
DOI10.1007/s10951-011-0253-xzbMath1280.90061OpenAlexW1967173449MaRDI QIDQ2434303
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-0253-x
Related Items (31)
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 ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multitasking scheduling problems with two competitive agents ⋮ Two-agent scheduling in a flowshop ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ Two-agent vehicle scheduling problem on a line-shaped network ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ 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 ⋮ Single machine batch scheduling with two non-disjoint agents and splitable jobs ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
- Unnamed Item
- Bi-criteria scheduling on a single parallel-batch machine
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling a batching machine
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
- Complexity results for single-machine problems with positive finish-start time-lags
- Scheduling with batching: A review
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- A note on the complexity of the problem of two-agent scheduling on a single machine
- 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
- Competitive Two-Agent Scheduling and Its Applications
- The Batch Loading and Scheduling Problem
- Scheduling Problems with Two Competing Agents
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling batches with simultaneous job processing for two-machine shop problems
This page was built for publication: Unbounded parallel-batching scheduling with two competitive agents
