# Dock-door scheduling, whole-case stock planning and bitmap/font encoding

## Dock Door Appointment Plan

Build a clear dock appointment schedule around door hours and blocked periods. Supply sourceRevision; up to 16 doors with id, openMinute and closeMinute; up to 64 blocked periods with id, doorId, startMinute and endMinute; and up to 64 appointments with id, earliestStartMinute, latestFinishMinute, durationMinutes and allowedDoorIds. Minutes are integers from 0 through 1440 on one supplied timeline. Windows must increase, blockers must fit their door hours and cannot overlap on a door; adjacent intervals are valid. Duration is positive. Empty lists and empty allowedDoorIds are valid. IDs are case-sensitive opaque ASCII labels of 1 to 48 letters, digits, underscores, periods, colons, pipes or hyphens; each collection has its own namespace. Unknown door references and repeated allowed doors reject. Appointments run by earliest latestFinishMinute, then original appointment order. Each receives the earliest integer start that fits its own window, allowed door hours, blockers and earlier assignments; ties use original door order, regardless of allowedDoorIds order. Intervals are half-open, so adjacent appointments and blockers fit. Earlier assignments never move. Unassigned appointments do not stop later work: no-compatible-door means its allowed list is empty, and no-fitting-window means no allowed door has a fitting interval. appointmentPlans preserves input order. doorSchedules reports each chronological assigned schedule, unused windows and exact minute totals. Invalid requests reject before quoting. Shared limits remain 36,000 input bytes, 6,000 nodes, depth 24 and 500,000 output bytes. This declared greedy policy provides a supplied-record plan without a global scheduling optimum, external booking, equipment suitability or physical availability guarantee. The reference explains scheduling concepts and does not certify this policy. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

[Request example](dock-door-appointment-plan.request.example.json) · [Input schema](dock-door-appointment-plan.input.schema.json) · [Result schema](dock-door-appointment-plan.result.schema.json)

## Whole Case Stock Transfer Plan

Plan whole-case stock transfers with clear site balances and visible unmet targets. Supply sourceRevision, itemId, unit, positive caseSizeUnits, up to 32 sites with id, onHandUnits, protectedUnits, targetUnits and capacityUnits, and up to 64 priority-ordered lanes with id, fromSiteId, toSiteId and maxCases. All quantities are whole integers from zero through 1,000,000,000; case size is at least one. Initial stock, protected floor and soft target must each fit capacity. Initial stock below its protected floor is allowed and gives no donor budget. IDs are case-sensitive opaque ASCII labels of 1 to 48 letters, digits, underscores, periods, colons, pipes or hyphens. Site and lane namespaces are separate. Unknown sites, self lanes, duplicate IDs and duplicate directed site pairs reject. At the start, each donor budget is frozen at max(initial on-hand minus protected units, zero). Lanes run once in input priority order, moving the maximum whole cases within the remaining frozen donor budget, projected receiver target gap, capacity gap and lane maximum. Received units never increase donor budget. A donor may finish below its soft target, but the policy never consumes its protected initial stock. An under-floor site is not promised restoration. Targets are not guaranteed; whole-case remainders and all unmet targets remain visible. Earlier transfers are never reversed or optimized. lanePlans and siteBalances preserve their input orders. Reports include cases, units, lane status, projected balances, remaining donor surplus, unmet targets and exact numeric conservation totals. All aggregates are bounded by 32,000,000,000 and remain safe integers. Empty lists are valid. Invalid requests reject before quoting. Shared limits remain 36,000 input bytes, 6,000 nodes, depth 24 and 500,000 output bytes. This declared supplied-record policy makes no global allocation optimum or physical availability guarantee. It does not move external inventory, reserve goods or make purchases. The reference explains flow concepts and does not certify this policy. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

[Request example](whole-case-stock-transfer-plan.request.example.json) · [Input schema](whole-case-stock-transfer-plan.input.schema.json) · [Result schema](whole-case-stock-transfer-plan.result.schema.json)

## XBM LSB Raster Encoder

Encode flat row-major binary pixels as complete canonical X11 XBM unsigned-char source text. Width and height are integers 1–64, with at most 128 pixels and exactly width times height integer bits 0 or 1. The ASCII C identifier is 1–32 characters, starting with a letter or underscore and continuing with letters, digits or underscores. The leftmost pixel is the least significant bit, rows start on byte boundaries and unused bits are zero. Source contains exactly two define lines followed by one static unsigned char array line, with lowercase two-digit hexadecimal literals separated by commas without spaces or a trailing comma, and a final LF. Return source text, name, dimensions, bytes per row, row-byte hex, byte length and lit-pixel count. No hotspots, X10 short arrays, other C constructs, C execution, filesystem access or downloadable file. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

[Request example](xbm-lsb-raster-encoder.request.example.json) · [Input schema](xbm-lsb-raster-encoder.input.schema.json) · [Result schema](xbm-lsb-raster-encoder.result.schema.json)

## PSF2 Bitmap Font Encoder

Encode numeric glyph bitmaps as a complete PSF2 version-zero font in lowercase hexadecimal. Width and height are integers 1–64, with 1–64 glyphs, at most 4096 supplied pixel bits in total and exactly width times height integer bits 0 or 1 per flat row-major glyph. The 32-byte header uses little-endian 32-bit words, magic bytes 72 b5 4a 86, version zero and flags zero. The leftmost pixel is the most significant bit; each row occupies ceil(width/8) bytes and unused row bits are zero. Glyphs retain supplied order and each occupies height times ceil(width/8) bytes. Return complete font hex, byte length, dimensions, glyph count, row and glyph byte sizes, a typed header and per-glyph index, bitmap hex and lit-pixel count. No Unicode table, character mapping, compression, filesystem access or downloadable file. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

[Request example](psf2-bitmap-font-encoder.request.example.json) · [Input schema](psf2-bitmap-font-encoder.input.schema.json) · [Result schema](psf2-bitmap-font-encoder.result.schema.json)

One-time job. See the exact service price before checkout. Save your private JSON result within its 30-day access period.
Requests accept at most 36,000 UTF-8 input bytes. Send only authorized, non-sensitive records.

For a known hosted offer, read current checkout and wallet availability with `GET https://gatewayinformationgroup.com/api/catalog/v1/search?id=PRODUCT_ID`. Then use the input schema and request example above.

Use the existing [agent checkout guide](https://gatewayinformationgroup.com/developers) to prepare a quote, pay and retrieve the private result.