On-line supply chain scheduling problems with preemption
From MaRDI portal
(Redirected from Publication:872299)
Recommendations
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
- Semi-online two-level supply chain scheduling problems
- scientific article; zbMATH DE number 2134083
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
- Online integrated production-distribution scheduling problems without preemption
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Integrated Scheduling of Production and Distribution Operations
- Machine scheduling with transportation considerations
- Network flows. Theory, algorithms, and applications.
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- Supply Chain Scheduling: Batching and Delivery
Cited in
(18)- No-wait on-line supply chain scheduling problems with transfer time
- Online integrated production-distribution scheduling problems without preemption
- Supply chain management with online customer selection
- On-line integrated production-distribution scheduling problems with capacitated deliveries
- Joint replenishment meets scheduling
- Semi-online two-level supply chain scheduling problems
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
- Coordination of production and transportation in supply chain scheduling
- Preemptive scheduling in a two-stage supply chain to minimize the makespan
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
- Integrated scheduling of production and delivery on a single machine with availability constraint
- scientific article; zbMATH DE number 2134083 (Why is no real title available?)
- scientific article; zbMATH DE number 5371399 (Why is no real title available?)
- Integrated scheduling of production and distribution with release dates and capacitated deliveries
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
This page was built for publication: On-line supply chain scheduling problems with preemption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872299)