On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
نویسندگان
چکیده
منابع مشابه
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
We consider the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs and times and propose to solve it as a mixed-integer program using a commercial solver. Our approach is based on the extension of an existing tight formulation for the case without changeover times. Computational results con rm the bene ts of the proposed solution procedure.
متن کاملMIP models and exact methods for the Discrete Lot-sizing and Scheduling Problem with sequence-dependent changeover costs and times
Lot-sizing is one of the many issues arising in the context of production planning. Its main objective is to determine the timing and level of production so as to reach the best possible trade-off between minimizing setup and inventory holding costs and satisfying customer demand. When a limited production capacity and a deterministic time-varying demand rate are assumed, lot-sizing leads to th...
متن کاملLot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities
This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only e$cient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and e$ciently. The size of solvable case...
متن کاملLot sizing and scheduling with sequence-dependent setup costs and times and e$cient rescheduling opportunities
This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only e$cient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and e$ciently. The size of solvable case...
متن کاملLot Sizing and Scheduling with Sequence Dependent Setup Costs and times and Eecient Rescheduling Opportunities
1 Summary: This paper deals with lot sizing and scheduling for a single-stage production system where setup costs and times are sequence dependent. A large bucket mixed integer programming (MIP) model is formulated which considers only eecient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and eeciently. Furthermore, it will become cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2009
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.10.001