scientific article; zbMATH DE number 903952

MaRDI QIDQ4885531zbMATH OpenFDO

Authors Cleola van Eijl

Publication date 15 July 1996

zbMATH Keywords

polyhedral combinatoricsschedulingsingle machinevalid inequalitiestotal completion timebranch-and-cut algorithmsetup costfacet-defining inequalitiesdelivery man problemdiscrete lot-sizingtime-window constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• The discrete lot-sizing and scheduling problem
• scientific article; zbMATH DE number 4197717
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• A polyhedral approach to a production planning problem
• The multi-item capacitated lot-sizing problem with setup times and shortage costs

Cited in

(13)

• Discrete multi-module capacitated lot-sizing problems with multiple items
• scientific article; zbMATH DE number 4197717 (Why is no real title available?)
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• The flow shop scheduling polyhedron with setup times
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
• Integrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problems
• A study of the lot-sizing polytope
• Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
• Lot-sizing polyhedra with a cardinality constraint
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Single item lot sizing problems
• A polynomial time algorithm for convex cost lot-sizing problems

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 Q4885531)