On multi-product lot-sizing and scheduling with multi-machine technologies
From MaRDI portal
Publication:2806947
DOI10.1007/978-3-319-28697-6_42zbMATH Open1342.90058OpenAlexW2472028730MaRDI QIDQ2806947FDOQ2806947
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
Recommendations
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cites Work
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Hamilton Paths in Grid Graphs
- Scheduling multiprocessor tasks -- An overview
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
Cited In (4)
- Simultaneous Product-Mix Planning, Lot Sizing and Scheduling at Bottleneck Facilities
- 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)
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)