Two-agent scheduling with agent specific batches on an unbounded serial batching machine
From MaRDI portal
Publication:892842
DOI10.1007/S10951-014-0410-0zbMATH Open1328.90055OpenAlexW2061170370MaRDI QIDQ892842FDOQ892842
Authors: M. Y. Kovalyov, A. Oulamara, A. 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
Recommendations
- Two-agent scheduling on an unbounded serial batching machine
- Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
- scientific article; zbMATH DE number 7109369
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Scheduling with batching: A review
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- A multiple-criterion model for machine scheduling
- Multi-agent single machine scheduling
- Multicriteria scheduling problems: a survey
- Competitive two-agent scheduling and its applications
- Scheduling Problems with Two Competing Agents
- Single machine batch scheduling with two competing agents to minimize total flowtime
- A note on the scheduling with two families of jobs
- Unbounded parallel-batching scheduling with two competitive agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Scheduling Groups of Jobs on a Single Machine
- The complexity of one-machine batching problems
- Multicriteria scheduling
- Batching decisions for assembly production systems
- Batch sizing and job sequencing on a single machine
- Scheduling interfering job sets on parallel machines
- Single-machine multi-agent scheduling problems with a global objective function
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Rescheduling for New Orders
- Title not available (Why is that?)
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Scheduling batches with sequential job processing for two-machine flow and open shops
- Flowshop scheduling problem with a batching machine and task compatibilities
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
Cited In (23)
- 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 on a bounded series-batch machine to minimize makespan and maximum cost
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- Scheduling two job families on a single machine with two competitive agents
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
- A batch scheduling problem with two agents
- Two-agent scheduling on an unbounded serial batching machine
- Multitasking scheduling problems with two competitive agents
- Two-agent scheduling on a single sequential and compatible batching machine
- Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
- Two-agent single-machine scheduling with cumulative deterioration
- Two‐agent scheduling with linear resource‐dependent processing times
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption
- Mixed batch scheduling on identical machines
- Two-agent integrated scheduling of production and distribution operations with fixed departure times
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Two-agent single-machine scheduling with release dates to minimize the makespan
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Single-machine scheduling with multi-agents to minimize total weighted late work
This page was built for publication: Two-agent scheduling with agent specific batches on an unbounded serial batching machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892842)
