Lot Sizing and Scheduling in Flow Shop with SequenceDependent Setups and Backlogging

Babaei, Mohsen; Mohammadi, Mohammad; Ghomi, S. M. T. Fatemi

doi:10.5120/3658-4957

Cited by 8 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several research studies have dealt with this type of system. Babaei et al (2011) and Babaei et al (2014) presented a multi-level and multi-period capacitated lotsizing and scheduling problem with sequence-dependent setups, backlogging and setup carry over in flow-shop system. Ramezanian et al (2013) developed a mixed integer programming model for lot-sizing and scheduling problem with availability constraints that aims to minimize the production, holding and sequence-dependent setup costs.…”

Section: Developedmentioning

confidence: 99%

Lot-sizing in flow-shop with energy consideration for sustainable manufacturing systems

et al. 2015

View full text Add to dashboard Cite

This paper presents a capacitated lot-sizing problem in flow-shop system with energy consideration. The planning horizon is defined by a set of periods. Each period is characterized by demand, duration, electricity cost and maximum peak power. Both non-linear and linear mixed integer programming are proposed to solve the problem with the objective of minimizing the production costs. The costs are considered as the sum of electrical, holding, setup and power demand costs. Computational experiments are presented and the numerical results are discussed and analyzed to evaluate the efficiency of those methods.

show abstract

Section: Developedmentioning

confidence: 99%

Lot-sizing in flow-shop with energy consideration for sustainable manufacturing systems

et al. 2015

View full text Add to dashboard Cite

show abstract

“…To validate the mentioned models, lower bound and mixed integer programming-based algorithms were developed. Babaei et al (2011) considered both the backlogging and sequence-dependent setups in the capacitated lot sizing and scheduling problem in flow shop environment, they proposed an exact formulation and a lower bound for mentioned problem. Ramezanian et al (2013) perused a multi-product multi-period lotsizing and scheduling problem in capacitated permutation flow shop with sequence-dependent setups.…”

Section: Introductionmentioning

confidence: 99%

A rolling horizon-based heuristic to solve a multi-level general lot sizing and scheduling problem with multiple machines (MLGLSP_MM) in job shop manufacturing system

Mohammadi

Poursabzi²

2014

10.5267/j.uscm

View full text Add to dashboard Cite

This article addresses multi-level lot sizing and scheduling problem in capacitated, dynamic and deterministic cases of a job shop manufacturing system with sequence-dependent setup times and costs assumptions. A new mixed-integer programing (MIP) model with big bucket time approach is provided to the problem formulation. It is well known that the capacitated lot sizing and scheduling problem (CLSP) is NP-hard. The problem of this paper that it is an extent of the CLSP is even more complicated; consequently, it necessitates the use of approximated methods to solve this problem. Hence, two new mixed integer programming-based approaches with rolling horizon framework have been used to solve this model. To evaluate the performance of the proposed model and algorithms, some numerical experiments are conducted. The comparative results indicate the superiority of the second heuristic.

show abstract

“…Regrding the capacitated problems, the first conclusion is that the papers focus more on the flow shops than the job shops. In this regard, one can refer to Maravelias and Sung [7], KarimiNasab and Seyedhoseini [8], Stadtler and Sahling [9], and Babaei et al [10].…”

Section: Introductionmentioning

confidence: 99%

An improved model and a heuristic for capacitated lot sizing and scheduling in job shop problems

2017

Self Cite

View full text Add to dashboard Cite

This paper studies the problem of capacitated lot-sizing and scheduling in job shops with a carryover setup and a general product structure. After analyzing the literature, the shortcomings are easily realized; for example, the available mathematical model is unfortunately not only non-linear but also incorrect. No lower bound and heuristic is developed for the problem. Therefore, we first develop a linear model for the problem on-hand. Then, we adapt an available lower bound in the literature to the problem studied here. Since the problem is NP-hard, a heuristics based on production shifting concept is also proposed. Numerical experiments are used to evaluate the proposed model and algorithm. The proposed heuristic is assessed by comparing it against other algorithms in the literature. The computational results demonstrate that our algorithm has an outstanding performance in solving the problem.

show abstract

Lot Sizing and Scheduling in Flow Shop with SequenceDependent Setups and Backlogging

Cited by 8 publications

References 20 publications

Lot-sizing in flow-shop with energy consideration for sustainable manufacturing systems

Lot-sizing in flow-shop with energy consideration for sustainable manufacturing systems

A rolling horizon-based heuristic to solve a multi-level general lot sizing and scheduling problem with multiple machines (MLGLSP_MM) in job shop manufacturing system

An improved model and a heuristic for capacitated lot sizing and scheduling in job shop problems

Contact Info

Product

Resources

About