A three-dimensional matching model for perishable production scheduling
From MaRDI portal
Recommendations
- Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline
- Batch machine production with perishability time windows and limited batch size
- The two-level economic lot sizing problem with perishable items
- Production scheduling and vehicle routing with time windows for perishable food products
- Optimal two- and three-stage production schedules with set-up time included
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Perishable Inventory Theory: A Review
- Sequencing with Earliness and Tardiness Penalties: A Review
Cited in
(19)- scientific article; zbMATH DE number 7092020 (Why is no real title available?)
- scientific article; zbMATH DE number 7092387 (Why is no real title available?)
- Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem
- Optimal transport to cold chain in perishable hand-picked agriculture
- A heuristic method for solving integer-valued decompositional multiindex problems
- Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline
- Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem
- Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
- A two‐step optimization model for the distribution of perishable products
- Operational research models applied to the fresh fruit supply chain
- Supply chain batching problem with identical orders and lifespan
- Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
- Production scheduling and vehicle routing with time windows for perishable food products
- Hybrid particle swarm optimization for pure integer linear solid transportation problem
- Multidimensional assignment problem for multipartite entity resolution
- Job-shop scheduling with blocking and no-wait constraints
- Alternative graph formulation for solving complex factory-scheduling problems
This page was built for publication: A three-dimensional matching model for perishable production scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283066)
