Online integrated production-distribution scheduling problems without preemption
From MaRDI portal
Publication:281801
DOI10.1007/s10878-015-9841-6zbMath1343.90002OpenAlexW2031950822MaRDI QIDQ281801
Xin Feng, Yongxi Cheng, Feifeng Zheng, Yin-Feng Xu
Publication date: 11 May 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9841-6
competitive analysisonline algorithmintegrated production-distribution problemssupply chain scheduling
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
Integrated production and outbound distribution scheduling problems with job release dates and deadlines, Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- Integrated scheduling of production and delivery on a single machine with availability constraint
- On-line supply chain scheduling problems with preemption
- On-line integrated production-distribution scheduling problems with capacitated deliveries
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- Batching and delivery in semi-online distribution systems
- A class of on-line scheduling algorithms to minimize total completion time
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
- Semi-online two-level supply chain scheduling problems
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Integrated Scheduling of Production and Distribution Operations
- Supply Chain Scheduling: Batching and Delivery
- Optimal on-line algorithms for single-machine scheduling
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine