Scheduling the replenishment of just-in-time supermarkets in assembly plants

DOI10.1007/S00291-016-0455-XzbMath1371.90022OpenAlexW2473357595MaRDI QIDQ2362251

Simon Emde

Publication date: 6 July 2017

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-016-0455-x

zbMATH Keywords

just-in-timemixed-model assembly linesdynamic lot-sizingproduction logisticssupermarket

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (4)

A sustainable inventory model to study the mixing and bottling plant of single item for cost minimization ⋮ Cross-docking based factory logistics unitisation process: an approximate dynamic programming approach ⋮ Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations ⋮ Loading tow trains ergonomically for just-in-time part supply

Cites Work

• Unnamed Item
• Unnamed Item
• Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities
• Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines
• Capacitated lot sizing problems with inventory bounds
• Part logistics in the automotive industry: decision problems, literature review and research agenda
• Sequencing mixed-model assembly lines to minimize part inventory cost
• Finding a feasible course schedule using Tabu search
• Lot sizing and scheduling -- survey and extensions
• Forward-reserve allocation in a warehouse with unit-load replenishments
• A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines
• The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
• Consignment stock inventory model in an integrated supply chain
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Solving the forward-reserve allocation problem in warehouse order picking systems
• Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities
• An Efficient Algorithm for Multi-Item Scheduling

This page was built for publication: Scheduling the replenishment of just-in-time supermarkets in assembly plants