Single machine batch scheduling with two non-disjoint agents and splitable jobs
From MaRDI portal
Publication:2023129
DOI10.1007/S10878-020-00626-9zbMath1466.90032OpenAlexW3091008115MaRDI QIDQ2023129
Publication date: 3 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00626-9
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Lot scheduling on a single machine
- Batch scheduling of identical jobs on parallel identical machines
- Batching in single operation manufacturing systems
- Scheduling a batching machine
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- A note on a single-machine lot scheduling problem with indivisible orders
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Mixed batch scheduling on identical machines
- Unbounded parallel-batching scheduling with two competitive agents
- A multiple-criterion model for machine scheduling
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Multicriteria scheduling
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Scheduling Problems with Two Competing Agents
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Multiagent Scheduling
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Single machine batch scheduling with two non-disjoint agents and splitable jobs
