scientific article; zbMATH DE number 4197717

zbMATH Open0725.90036MaRDI QIDQ5202818FDOQ5202818

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

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

production planningdiscrete lot-sizingminimum total costset-up timesmultiple machinesset-up costsholding costssingle-stage manufacturing process

Mathematics Subject Classification ID

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)

Cited In (14)

• 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
• Title not available (Why is that?)
• 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
• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
• Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
• Title not available (Why is that?)

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)