On multi-product lot-sizing and scheduling with multi-machine technologies

DOI10.1007/978-3-319-28697-6_42MaRDI QIDQ2806947zbMATHOpenAlexFDO

Authors Anton Valentinovich Eremeev, Julia Viktorovna Kovalenko

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_42

zbMATH Keywords

mixed integer linear programmingmulti-machine technologies

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 6007914
• A continuous-time model for the scheduling problem with machine grouping according to technology
• Lot-size scheduling of a single product on unrelated parallel machines
• Multi-level lotsizing and scheduling by batch sequencing
• Lot-sizing scheduling with batch setup times

Cites work

• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Hamilton Paths in Grid Graphs
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
• Scheduling multiprocessor tasks -- An overview
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors

Cited in

(4)

• A continuous-time model for the scheduling problem with machine grouping according to technology
• A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM WITH CONSIDERATION OF PRODUCT-DEPENDENT TRANSPORTATION
• Multi-level, single-machine lot sizing and scheduling (with initial inventory)
• Simultaneous Product-Mix Planning, Lot Sizing and Scheduling at Bottleneck Facilities

This page was built for publication: On multi-product lot-sizing and scheduling with multi-machine technologies

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