Two-agent single batch machine scheduling with a fixed capacity distribution
From MaRDI portal
Cites work
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- Approximation schemes for two-agent scheduling on parallel machines
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
- Scheduling Problems with Two Competing Agents
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Supply Chain Scheduling: Batching and Delivery
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
This page was built for publication: Two-agent single batch machine scheduling with a fixed capacity distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234239)
