Minimizing customer order lead-time in a two-stage assembly supply chain
From MaRDI portal
Publication:940914
DOI10.1007/s10479-007-0289-7zbMath1152.90426OpenAlexW2147121220MaRDI QIDQ940914
James D. Blocher, Dilip Chhajed
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0289-7
Related Items
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ An agent-based negotiation model on price and delivery date in a fashion supply chain ⋮ Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms ⋮ The implication of time-based payment contract in the decentralized assembly system ⋮ Coordinating supply chains with stochastic demand by crashing lead times
Cites Work
- A branch and bound algorithm for the two-stage assembly scheduling problem
- Single machine hierarchical scheduling with customer orders and multiple job classes
- The Complexity of Flowshop and Jobshop Scheduling
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- The customer order lead-time problem on parallel machines