Modeling of period overlapping setup times

Suerie, Christopher

doi:10.1016/j.ejor.2005.03.033

Cited by 40 publications

(39 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Moreover, setup cross overs are not allowed, having to start and finish in the same period. Suerie (2006) proposes a model that correctly handles setup cross overs, but only for small-bucket problems. A set of variables are introduced in relation to the standard model, keeping track of how much time each setup operation is performed in each period, the cumulative time a setup operation has been performed in any given period since the last time it started, and the availability of the machine at the beginning of every period (the machine is available for production if the entire setup operation has finished).…”

Section: Literature Reviewmentioning

confidence: 99%

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Menezes

Clark

Almada-Lobo

2010

J Sched

View full text Add to dashboard Cite

We recommend you cite the published version. The publisher's URL is: http://dx.doi.org/10.1007/s10951-010-0197-6 Refereed: YesThe original publication is available at www.springerlink.com Disclaimer UWE has obtained warranties from all depositors as to their title in the material deposited and as to their right to deposit such material. UWE makes no representation or warranties of commercial utility, title, or fitness for a particular purpose or any other warranty, express or implied in respect of any material deposited.UWE makes no representation that the use of the materials will not infringe any patent, copyright, trademark or other property or proprietary rights. UWE accepts no liability for any infringement of intellectual property rights in any material deposited but will remove such material from public view pending investigation in the event of an allegation of any such infringement. AbstractIn production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period -in other words, at least one sub tour exists in the production sequence of that period. By allowing setup crossovers, flexibility is increased and better solutions can be found. In tight capacity conditions, or whenever setup times are significant, setup crossovers are needed to assure feasibility. We present the first linear mixed integer programming extension for the capacitated lotsizing and scheduling problem incorporating all the necessary features of sequence sub tours and setup crossovers. This formulation is more efficient than other well known lotsizing and scheduling models.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Menezes

Clark

Almada-Lobo

2010

J Sched

View full text Add to dashboard Cite

show abstract

“…A fim de utilizar a capacidade disponível de maneira mais eficiente pode-se incluir a preparação crossover : [6]; [5]; [4]; [1]; [2].…”

unclassified

Heurísticas Relax-and-Fix e Fix-and-Optimize para o problema de dimensionamento de lotes com preparações carryover e crossover

Araújo¹,

Neyra²,

Fiorotto³

2018

Proceeding Series of the Brazilian Society of Computational and Applied Mathematics

View full text Add to dashboard Cite

José do Rio Preto, SP, BrasilResumo. Os problemas de dimensionamento de lotes consistem em determinar a quantidade de itens que devem ser produzidos em todos os períodos de um horizonte de planejamento. Em geral, são considerados custos de produção, preparação de máquina e de manutenção de estoque. Neste trabalho estuda-se uma extensão do problema de dimensionamento de lotes com restrição de capacidade que considera tempos de preparação, preparação carryover e crossover, em que se tem umaúnica máquina,único estágio, multi-itens e big-bucket (CLSP-SCC). Para a resolução do problemaé proposta uma heurística híbrida que combina as heurísticas Relax-and-Fix e Fix-and-Optimize (RF-FO), em que a heurística Relax-andFixé usada para obter uma solução inicial e a heurística Fix-and-Optimize melhora essa solução. Por fim, apresentam-se os resultados computacionais comparando os resultados da heurística com os do pacote computacional CPLEX. Palavras-chave. Problemas de Dimensionamento de Lotes com Restrição de Capacidade, PreparaçãoCarryover, Preparação Crossover, Heurística Relax-and-Fix, Heurística Fix-andOptimize IntroduçãoNeste trabalho, considera-se o Problema de Dimensionamento de Lotes com Restrição de Capacidade (Capacitated Lot-Sizing Problem-CLSP) em que se tem umaúnica máquina, unico-estágio, multi-itens, big bucket e tempos e custos de preparação, onde os tempos de preparação são menores do que a capacidade por período.Na formulação clássica deste problema (proposta em [8]), a preparação para o primeiro tipo de item produzido em um período começa no início deste período. Neste trabalho, estuda-se uma extensão deste problema de dimensionamento de lotes que inclui as possibilidades de preparações carryover e crossover. Observa-se que considerar esta extensão pode resultar em soluções mais eficientes em comparação com a formulação clássica.

show abstract

“…Setup carry-over enables us to skip duplicate setups when an item is produced on a machine over a number of time periods in † : Corresponding Author successions. Suerie (2006) extended the PLSP (Drexl and Hasse, 1996) by considering setup overlapping over two successive time periods. Setup may begin at a time period and may end at the next time period when setup overlapping is allowed.…”

Section: Introductionmentioning

confidence: 99%

Heuristic Approach for Lot Sizing and Scheduling Problem with State Dependent Setup Time

Han¹

2011

Industrial Engineering and Management Systems

View full text Add to dashboard Cite

Abstract. In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over, setup overlapping, state dependent setup time as well as demand splitting are considered. For this LSSP, we develop a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we develop an efficient heuristic algorithm by combining a decomposition scheme with a local search procedure. Test results show that the developed heuristic algorithm finds a good quality (in practice, even better) feasible solution using far less computation time compared with the CPLEX, a competitive MIP solver.

show abstract

Modeling of period overlapping setup times

Cited by 40 publications

References 9 publications

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Heurísticas Relax-and-Fix e Fix-and-Optimize para o problema de dimensionamento de lotes com preparações carryover e crossover

Heuristic Approach for Lot Sizing and Scheduling Problem with State Dependent Setup Time

Contact Info

Product

Resources

About