SchedulingNproducts on a single facility with allowed backordering

DOI10.1080/00207548508904711MaRDI QIDQ3682220zbMATH OpenOpenAlexFDO

Authors 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

branch and bound algorithmComputational experiencefinite planning horizonlower boundminimal backorder costsminimal inventoryproduction schedulesingle machine

Mathematics Subject Classification ID

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

Recommendations

• Scheduling N Products On A Single Facility With Back-Ordering And Eixed Terminal Inventory
• Single item lot-sizing problems with backlogging on a single machine at a finite production rate
• Optimal production and setup scheduling: A one-machine, two-product system
• scientific article; zbMATH DE number 90002
• Economic scheduling of products with N components on a single machine

Cites work

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

Cited in

(1)

• Scheduling N Products On A Single Facility With Back-Ordering And Eixed Terminal Inventory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3682220)