SchedulingNproducts on a single facility with allowed backordering

DOI10.1080/00207548508904711zbMath0566.90045OpenAlexW2003682191MaRDI QIDQ3682220

Bajis Dodin

Publication date: 1985

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548508904711

zbMATH Keywords

single machinelower boundfinite planning horizonbranch and bound algorithmproduction scheduleComputational experienceminimal backorder costsminimal inventory

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05)

Cites Work

• Technical Note—A Production-Scheduling Problem with Batch Processing
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions

This page was built for publication: SchedulingNproducts on a single facility with allowed backordering