Two-agent scheduling with agent specific batches on an unbounded serial batching machine
From MaRDI portal
Publication:892842
DOI10.1007/s10951-014-0410-0zbMath1328.90055OpenAlexW2061170370MaRDI QIDQ892842
Ammar Oulamara, Mikhail Y. Kovalyov, Ameur Soukhal
Publication date: 12 November 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0410-0
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (18)
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 ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multitasking scheduling problems with two competitive agents ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Mixed batch scheduling on identical machines ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Improved algorithms for two-agent scheduling on an unbounded serial-batching machine ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times ⋮ Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
Cites Work
- Unnamed Item
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Batching decisions for assembly production systems
- Batch sizing and job sequencing on a single machine
- A note on the scheduling with two families of jobs
- Flowshop scheduling problem with a batching machine and task compatibilities
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Scheduling interfering job sets on parallel machines
- The complexity of one-machine batching problems
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Scheduling with batching: A review
- Single-machine multi-agent scheduling problems with a global objective function
- Unbounded parallel-batching scheduling with two competitive agents
- A multiple-criterion model for machine scheduling
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multicriteria scheduling
- Multicriteria scheduling problems: a survey
- Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
- Competitive Two-Agent Scheduling and Its Applications
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Scheduling Problems with Two Competing Agents
- Rescheduling for New Orders
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: Two-agent scheduling with agent specific batches on an unbounded serial batching machine
