Material allocation in MRP with tardiness penalties

DOI10.1007/BF00121683zbMath0866.90073MaRDI QIDQ2564888

Ramakrishnan S. Nambimadom, Uday S. Karmarkar

Publication date: 20 July 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

Lagrangean relaxationlower boundNP-hardheuristicmaterials requirements planningmixed integer linear formulation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

New heuristics for total tardiness minimization in a flexible flowshop ⋮ Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging

Cites Work

• Unnamed Item
• Unnamed Item
• Resource allocation among competing activities: A lexicographic minimax approach
• A Dynamic Programming Approach to Sequencing Problems
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• A Max-Min Allocation Problem: Its Solutions and Applications
• Hierarchical Production Planning: A Two-Stage System

This page was built for publication: Material allocation in MRP with tardiness penalties