A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains
DOI10.1080/03155986.2018.1533773OpenAlexW2913469868MaRDI QIDQ5884367FDOQ5884367
Publication date: 20 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2018.1533773
Recommendations
- A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
- A heuristic algorithm for a supply chain's production-distribution planning
- scientific article; zbMATH DE number 2050766
- A hybrid method for large-scale short-term scheduling of make-and-pack production processes
- scientific article; zbMATH DE number 1795725
- A new constructive heuristic for the flowshop scheduling problem
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- A hybrid heuristic for an inventory routing problem
- An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems
- A new heuristic and an exact approach for a production planning problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- The integrated production and transportation scheduling problem for a product with a short lifespan
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Integrated Scheduling of Production and Distribution Operations
- The production routing problem: a review of formulations and solution algorithms
- Integrated production and distribution scheduling with lifespan constraints
- A reactive GRASP and path relinking for a combined production-distribution problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- An investigation of lead-time effects in manufacturing/remanufacturing systems under simple PUSH and PULL control strategies
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- A zero-inventory production and distribution problem with a fixed customer sequence
This page was built for publication: A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5884367)