Binary integer programming formulations for scheduling in market-driven foundries

This paper describes the development and solution of binary integer formulations for production scheduling problems in market-driven foundries. This industrial sector is comprised of small and mid-sized companies with little or no automation, working with diversified production, involving several di...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & industrial engineering Ročník 59; číslo 3; s. 425 - 435
Hlavní autori: Teixeira, Rodolfo Florence, Fernandes, Flavio Cesar Faria, Pereira, Néocles Alves
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Elsevier Ltd 01.10.2010
Pergamon Press Inc
Predmet:
ISSN:0360-8352, 1879-0550
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper describes the development and solution of binary integer formulations for production scheduling problems in market-driven foundries. This industrial sector is comprised of small and mid-sized companies with little or no automation, working with diversified production, involving several different metal alloy specifications in small tailor-made product lots. The characteristics and constraints involved in a typical production environment at these industries challenge the formulation of mathematical programming models that can be computationally solved when considering real applications. However, despite the interest on the part of these industries in counting on effective methods for production scheduling, there are few studies available on the subject. The computational tests prove the robustness and feasibility of proposed models in situations analogous to those found in production scheduling at the analyzed industrial sector.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2010.05.015