One dimensional cutting stock problem in just-in-time environment

In this article we outline a procedure for solving a one-dimensional cutting stock problem when production must be synchronized with shipment. Just-In-Time (JIT) requirements include shipping dates, number and type of loading spots, and loading duration for each shipment. The procedure incorporates a special version of the revised simplex that explores only those vertices that are feasible under JIT requirements. A built-in combinatorial module makes an appropriate pattern selection and ordering. The fielded MAJIQTRIM optimization package employs this procedure and effectively solves real world problems at several paper mills with limited warehouse space and strict customer demands.