On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
From MaRDI portal
Publication:2434291
DOI10.1007/s10951-011-0260-yzbMath1280.68299MaRDI QIDQ2434291
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-011-0260-y
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
68W27: Online algorithms; streaming algorithms
Related Items
Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms, An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand, A review on integrated scheduling and outbound vehicle routing problems, Minmizing service span with batch-position-based learning effects, Integrated production and outbound distribution scheduling problems with job release dates and deadlines, Online scheduling on a single machine with grouped processing times
Cites Work
- On-line two-machine job shop scheduling with time lags
- Integrated production and distribution scheduling with committed delivery dates
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- 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
- Machine scheduling with job delivery coordination
- Single machine scheduling with release dates and job delivery to minimize the makespan
- On-line algorithms for minimizing makespan on batch processing machines
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- Integrated Scheduling of Production and Distribution Operations
- Supply Chain Scheduling: Batching and Delivery
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Machine scheduling with transportation considerations
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed