On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
From MaRDI portal
(Redirected from Publication:319441)
Recommendations
- On-line algorithms for minimizing makespan and maximum delivery time on a single serial batch machine
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- On-line scheduling with delivery time on a single batch machine
- scientific article; zbMATH DE number 2134083
- scientific article; zbMATH DE number 5371399
- A best on-line algorithm for single machine scheduling with small delivery times
- On-line supply chain scheduling problems with preemption
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- An optimal online algorithm for single machine scheduling with bounded delivery times
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- A class of joint production and transportation planning problems under different delivery policies
- A new approach to tactical and strategic planning in production-distribution networks
- Coordination of production and interstage batch delivery with outsourced distribution
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Integrated Scheduling of Production and Distribution Operations
- Integrated machine scheduling and vehicle routing with time windows
- On-line integrated production-distribution scheduling problems with capacitated deliveries
- On-line supply chain scheduling problems with preemption
- Robust supply chain network design with service level against disruptions and demand uncertainties: a real-life case
- Scheduling on identical machines: How good is LPT in an on-line setting?
- Scheduling with deadlines and loss functions
- Semi-online two-level supply chain scheduling problems
- Single machine scheduling with release dates and job delivery to minimize the makespan
- Supply Chain Scheduling: Batching and Delivery
Cited in
(11)- Integrated production and multiple trips vehicle routing with time windows and uncertain travel times
- A review on integrated scheduling and outbound vehicle routing problems
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
- On-line supply chain scheduling problems with preemption
- Order assignment and scheduling under processing and distribution time uncertainty
- Semi-online two-level supply chain scheduling problems
- An appointment scheduling framework to balance the production of blood units from donation
- Prescribed-time consensus of time-varying open multi-agent systems with delays on time scales
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
- Preemptive scheduling in a two-stage supply chain to minimize the makespan
- scientific article; zbMATH DE number 5371399 (Why is no real title available?)
This page was built for publication: On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319441)
