Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
From MaRDI portal
Publication:1706684
DOI10.1007/s40305-017-0171-5zbMath1384.90050OpenAlexW2621083812MaRDI QIDQ1706684
Publication date: 28 March 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-017-0171-5
Related Items (2)
Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode ⋮ Vehicle scheduling problems with two agents on a line
Cites Work
- Single machine scheduling with two competing agents and equal job processing times
- Machine scheduling with deliveries to multiple customer locations
- Two-agent scheduling on uniform parallel machines with min-max criteria
- The coordination of scheduling and batch deliveries
- Batch delivery scheduling with batch delivery cost on a single machine
- Single machine flow-time scheduling with a single breakdown
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Logistics scheduling with batching and transportation
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Integrated Scheduling of Production and Distribution Operations
- Scheduling Problems with Two Competing Agents
- Machine scheduling with transportation considerations
This page was built for publication: Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
