Just-in-time two-dimensional bin packing

•We combine bin packing and just-in-time batch scheduling into a new problem.•We minimize total weighted earliness tardiness in a combined packing scheduling problem.•Our constraint program addresses the packing and scheduling aspects simultaneously.•Our branch-and-check approaches solve the problem under few heuristic assumptions.•Performance comparison of constraint versus mixed-integer programming master problems.