scientific article; zbMATH DE number 4197717

MaRDI QIDQ5202818zbMATH OpenFDO

Authors Stan Van Hoesel, Leo Kroon, Marc Salomon, Luk N. Van Wassenhove, Roelof Kuik

Publication date 1990

zbMATH Keywords

discrete lot-sizingholding costsminimum total costmultiple machinesproduction planningset-up costsset-up timessingle-stage manufacturing process

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Integer programming (90C10) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Applications of mathematical programming (90C90)

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”
• scientific article; zbMATH DE number 903952
• 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

(19)

• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
• The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
• A linear description of the discrete lot-sizing and scheduling problem
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
• A note on ``The general lotsizing and scheduling problem
• Simultaneous lotsizing and scheduling problems: a classification and review of models
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
• Discrete lotsizing and scheduling by batch sequencing
• Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
• Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
• A note on linear programming and the single machine lot size scheduling problem
• A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• scientific article; zbMATH DE number 1786130 (Why is no real title available?)
• scientific article; zbMATH DE number 903952 (Why is no real title available?)
• Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs
• The discrete lot-sizing and scheduling problem
• On discrete lot-sizing and scheduling on identical parallel machines

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)