A note on “A mixed integer programming model for advanced planning and scheduling (APS)”

In a recent paper, Chen and Ji [Chen, K., Ji, P., 2007. A mixed integer programming model for advanced planning and scheduling (APS). European Journal of Operational Research 181, 515–522] develop a mixed integer programming model for advanced planning and scheduling problem that considers capacity...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 203; číslo 3; s. 784 - 785
Hlavní autori: Örnek, Arslan, Özpeynirci, Selin, Öztürk, Cemalettin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 16.06.2010
Elsevier
Elsevier Sequoia S.A
Edícia:European Journal of Operational Research
Predmet:
Advanced planning and scheduling
Applied sciences
Exact sciences and technology
Integer programming
Mathematical programming
Mixed integer programming
MRP
Operational research and scientific management
Operational research. Management science
Operations management
Production scheduling
Scheduling
Scheduling MRP Advanced planning and scheduling Mixed integer programming
Scheduling, sequencing
Studies
Mixed integer programming
Scheduling
MRP
Advanced planning and scheduling
Material requirements planning
Capacity constraint
Make to stock
Resource management
Modeling
Precedence constraint
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In a recent paper, Chen and Ji [Chen, K., Ji, P., 2007. A mixed integer programming model for advanced planning and scheduling (APS). European Journal of Operational Research 181, 515–522] develop a mixed integer programming model for advanced planning and scheduling problem that considers capacity constraints and precedence relations between the operations. The orders require processing of several operations on eligible machines. The model presented in the above paper works for the case where each operation can be processed on only one machine. However, machine eligibility means that only a subset of machines are capable of processing a job and this subset may include more than one machine. We provide a general model for advanced planning and scheduling problems with machine eligibility. Our model can be used for problems where there are alternative machines that an operation can be assigned to.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2009.09.025