DOI10.1287/opre.38.3.456zbMath0707.90047OpenAlexW2121012222MaRDI QIDQ3489777
Rita Vachani, Thomas L. Magnanti
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.3.456
Simultaneous lotsizing and scheduling problems: a classification and review of models,
On practical resource allocation for production planning and scheduling with period overlapping setups,
A linear description of the discrete lot-sizing and scheduling problem,
The discrete lot-sizing and scheduling problem with sequence-dependent setup costs,
CMIT, capacitated multi-level implosion tool,
Optimal single machine scheduling of products with components and changeover cost,
A Lagrangean decomposition solution to a single line multiproduct scheduling problem,
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches,
A cutting plane approach to capacitated lot-sizing with start-up costs,
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs,
Lot-size scheduling of two types of jobs on identical machines,
Classical cuts for mixed-integer programming and branch-and-cut,
Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company,
Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows,
Lot sizing and scheduling -- survey and extensions,
MIP modelling of changeovers in production planning and scheduling problems,
Production and inter-facility transportation scheduling for a process industry,
Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem,
Generalized spanning trees,
A polynomial algorithm for lot-size scheduling of two type tasks.,
Machine scheduling models in environmentally focused chemical manufacturing,
A technique for speeding up the solution of the Lagrangean dual,
The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming,
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems,
Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
