On-line supply chain scheduling problems with preemption

DOI10.1016/J.EJOR.2006.06.004zbMATH Open1121.90051OpenAlexW2050028837MaRDI QIDQ872299FDOQ872299

Zhihui Xue, Igor Averbakh

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.004

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

zbMATH Keywords

combinatorial optimizationcompetitive analysisschedulingsupply chainon-line algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Machine scheduling with transportation considerations
• Integrated Scheduling of Production and Distribution Operations
• Restarts can help in the on-line minimization of the maximum delivery time on a single machine
• Supply Chain Scheduling: Batching and Delivery
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

Cited In (17)

• No-wait on-line supply chain scheduling problems with transfer time
• Online integrated production-distribution scheduling problems without preemption
• Integrated scheduling on a batch machine to minimize production, inventory and distribution costs
• Integrated scheduling of production and delivery on a single machine with availability constraint
• Integrated production and outbound distribution scheduling problems with job release dates and deadlines
• Coordination of production and transportation in supply chain scheduling
• On-line integrated production-distribution scheduling problems with capacitated deliveries
• Integrated scheduling of production and distribution with release dates and capacitated deliveries
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
• 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
• Joint replenishment meets scheduling

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)