A due date assignment algorithm for multiproduct manufacturing facilities

DOI10.1016/0377-2217(93)90332-HzbMath0776.90031OpenAlexW2067171905MaRDI QIDQ1261379

Hanan Luss, Moshe B. Rosenwein

Publication date: 28 November 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90332-h

zbMATH Keywords

Lagrangean relaxationheuristiccomplex manufacturing facilitydue date assignment algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Real-time due-date promising by build-to-order environments ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms

Cites Work

• Unnamed Item
• Survey of scheduling research involving due date determination decisions
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Simulation Study of Predictable Due-Dates
• Validation of subgradient optimization

This page was built for publication: A due date assignment algorithm for multiproduct manufacturing facilities