Örnek, Mustafa ArslanÖzpeynirci, SelinOzturk, Cemalettin2023-06-162023-06-1620100377-2217https://doi.org/10.1016/j.ejor.2009.09.025https://hdl.handle.net/20.500.14365/1186In 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. (C) 2009 Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/closedAccessSchedulingMRPAdvanced planning and schedulingMixed integer programmingEditorial10.1016/j.ejor.2009.09.0252-s2.0-70449520337