scientific article; zbMATH DE number 4197717
From MaRDI portal
Publication:5202818
production planningdiscrete lot-sizingminimum total costset-up timesmultiple machinesset-up costsholding costssingle-stage manufacturing process
Linear programming (90C05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)
Recommendations
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- The discrete lot-sizing and scheduling problem
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
- Publication:4885531
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- A linear description of the discrete lot-sizing and scheduling problem
- Discrete lotsizing and scheduling by batch sequencing
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
Cited in
(15)- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
- On discrete lot-sizing and scheduling on identical parallel machines
- A note on ``The general lotsizing and scheduling problem
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
- Discrete lotsizing and scheduling by batch sequencing
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- The discrete lot-sizing and scheduling problem
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- scientific article; zbMATH DE number 903952 (Why is no real title available?)
- A note on linear programming and the single machine lot size scheduling problem
- Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
- scientific article; zbMATH DE number 1786130 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202818)