Optimal and heuristic solutions for a scheduling problem arising in a foundry

DOI10.1016/j.cor.2004.03.007zbMath1116.90354OpenAlexW2094878578MaRDI QIDQ1772868

Sigrid Lise Nonås, Kai A. Olsen

Publication date: 21 April 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.03.007

zbMATH Keywords

Production schedulingOrder acceptance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (2)

Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm ⋮ An improved decision support model for scheduling production in an engineer-to-order manufacturer

Cites Work

• Unnamed Item
• Unnamed Item
• Cutting stock problems and solution procedures
• A parameter set design procedure for the simulated annealing algorithm under the computational time constraint
• A decomposition algorithm for the single machine total tardiness problem
• Mathematical Methods of Organizing and Planning Production
• Minimizing Total Tardiness on One Machine is NP-Hard
• A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
• The Complexity of Flowshop and Jobshop Scheduling
• Scheduling research in multiple resource constrained job shops: a review and critique
• Information and scheduling in a dual resource constrained job shop
• The Total Tardiness Problem: Review and Extensions

This page was built for publication: Optimal and heuristic solutions for a scheduling problem arising in a foundry