A review of scheduling research involving setup considerations

Allahverdi, Ali; Gupta, Jatinder N. D.; Aldowaisan, Tariq

doi:10.1016/s0305-0483(98)00042-5

Cited by 737 publications

(324 citation statements)

References 153 publications

Supporting

Mentioning

290

Contrasting

Unclassified

Order By: Relevance

“…Dudek et al (1992); MacCarthy and Liu (1993), and also McKay et al (2002) have criticised scheduling research in general and the flowshop scheduling literature in particular regarding this gap. Similar conclusions can be found in literature reviews (see Graves, 1981;Allahverdi et al, 1999;Linn and Zhang, 1999;Vignier et al, 1999;Ruiz and Vázquez Rodríguez, 2010;Ribas et al, 2010) on different scheduling environments. Reisman et al (1997) conducted a statistical review on flowshop sequencing/scheduling research between years 1952-1994.…”

Section: Motivation For This Phd Thesissupporting

confidence: 75%

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

Urlings¹

View full text Add to dashboard Cite

Es ist nicht genug zu wissen, man muss auch anwenden.Es ist nicht genug zu wollen, man muss auch tun.Knowing is not enough, we must apply.Willing is not enough, we must do.Johann Wolfgang von Goethe, Wilhelm Meisters Wanderjahre, 1821. I ABSTRACT HEURISTICS AND METAHEURISTICS FOR HEAVILY CONSTRAINED HYBRID FLOWSHOP PROBLEMSDue to the current trends in business as the necessity to have a large catalogue of products, orders that increase in frequency but not in size, globalisation and a market that is increasingly competitive, the production sector faces an ever harder economical environment. All this raises the need for production scheduling with maximum efficiency and effectiveness.The first scientific publications on production scheduling appeared more than half a century ago. However, many authors have recognised a gap between the literature and the industrial problems. Most of the research concentrates on optimisation problems that are actually a very simplified version of reality. This allows for the use of sophisticated approaches and guarantees in many cases that optimal solutions are obtained. Yet, the exclusion of real-world restrictions harms the applicability of those methods. What the industry needs are systems for optimised production scheduling that adjust exactly to the conditions in the production plant and that generates good solutions in very little time. This is exactly the objective in this thesis, that is, to treat more realistic scheduling problems and to help closing the gap between the literature and practice.The considered scheduling problem is called the hybrid flowshop problem, which consists in a set of jobs that flow through a number of production stages. At each of the stages, one of the machines that belong to the stage is visited. III IVA series of restriction is considered that include the possibility to skip stages, non-eligible machines, precedence constraints, positive and negative time lags and sequence dependent setup times. In the literature, such a large number of restrictions has not been considered simultaneously before. Briefly, in this thesis a very realistic production scheduling problem is studied.Various optimisation methods are presented for the described scheduling problem. A mixed integer programming model is proposed, in order to obtain optimal solutions for limited cases and in order to analyse the complexity of each of the problem restrictions. In continuation, seven constructive heuristics are presented with the purpose of obtaining fast solutions to the problem in more general cases. Advanced metaheuristic methods are studied in detail, starting with five genetic algorithms that allow studying the effect of the solution representation. Three local search based algorithms are proposed, which is very novel if the elevated complexity of the problem is taken into account. In addition, novel methods are presented that shift the solution representation during the search process in order to acquire near-optimal solutions. The obtained results endorse the use of thes...

show abstract

Section: Motivation For This Phd Thesissupporting

confidence: 75%

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

Urlings¹

View full text Add to dashboard Cite

show abstract

“…Em Maes e Wassenhove (1988) e Trigeiro et al (1989) são tratados apenas problemas de dimensionamento de lotes. Enquanto que em Lawler et al (1993), Allahverdi et al (1999) e Potts e Kovalyov (2000) são encontrados modelos de programação. No entanto, conforme Drexl e Kimms (1997) e Karimi et al (2003), a tendência mais recente é combinar o problema de dimensionamento de lotes às decisões de programação da produção (lot-sizing and scheduling problems ou lot-scheduling).…”

Section: Modelagemunclassified

Otimização no dimensionamento e seqüenciamento de lotes de produção: estudo de caso numa fábrica de rações

Toso

Morábito

2005

Gest. Prod.

View full text Add to dashboard Cite

Resumo Neste trabalho, é proposta uma abordagem para otimizar o problema integrado de dimensionamento e seqüencia-mento de lotes de produção em uma empresa do setor de nutrição animal. Tal problema consiste em decidir quanto IntroduçãoApesar de estar sofrendo com a globalização dos mercados e com a conjuntura econômica e política nacional, a indústria brasileira de nutrição animal tem crescido nos últimos anos, por exemplo, em 2002 cresceu 7,17%, com um faturamento de mais de US$ 7 bilhões (SINDI-RAÇÕES, 2003; ANFAL, 2003). A presença de grandes grupos nacionais e multinacionais tem acirrado a competitividade, forçando as empresas a uma busca contínua por melhores desempenhos operacionais. Neste contexto, a área de Planejamento e Controle da Produção (PCP) exerce um papel importante.Num escopo de curto a médio prazo, a tomada de decisões no PCP envolve questões como o dimensionamento, seqüenciamento e programação de lotes de produção. Estas questões são especialmente complicadas para esta indústria devido a algumas peculiaridades, como a alta sazonalidade dos produtos e os tempos de preparação (setup) do processo produtivo dependentes da seqüên-cia. De forma geral, o problema de dimensionamento de lotes (lot sizing) consiste em determinar o que e quanto produzir, ajustando a capacidade produtiva às variações de demanda. Para tanto, dispõe de duas alternativas viáveis: aumento da capacidade (por exemplo, com a utilização de horas extras) e antecipação da produção nos períodos de folga (utilização de estoques). O problema de seqüenciamento e de programação de lotes (sequencing and scheduling) consiste em determinar em que ordem produzir os lotes de forma a minimizar os tempos de preparação, que diminuem a capacidade produtiva (Johnson e

show abstract

“…This problem is denoted as Flow Shop Dependent Group Scheduling (FSDGS). Literature of the last decades extensively dealt with both FSGS and FSDGS problems as confirmed by the following three reviews performed by Allahverdi et al (1999), Cheng et al (2000) and Zhu and Wilhelm (2006), respectively. Hendizadeh et al (2008) and Salmasi and Logedran (2008) proposed a metaheuristic algorithm based on tabu search.…”

Section: Literature Reviewmentioning

confidence: 99%

Heterogeneous workers with learning ability assignment in a cellular manufacturing system

Fichera¹,

Costa²,

Cappadonna³

2017

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper deals with Flow-shop Sequence-Dependent Group Scheduling and worker assignment problem. Flow-shop allows the process of a set of families of products applying the group technology concept to reduce setup costs, lead times, and work-in-process inventory costs. The worker assignment problem deals with assigning workers to workstations considering their different abilities and learning effect. The proposed model in this paper considers different objectives. The decision problems in this cellular manufacturing system are the jobs scheduling within of own group, the group scheduling and the workers assignment to the machines. The aim of this paper is to consider a more realistic profile of heterogeneous workers introducing the learning effect in the joint group scheduling and workers assignment problem. A mathematical model and an evolutionary procedure has been developed to solve this problem. A benchmark of test cases having different numbers of machines, groups, jobs, worker skills and learning index, has been taken into account to compare the efficiency of the proposed algorithm with two well known procedures.

show abstract

A review of scheduling research involving setup considerations

Cited by 737 publications

References 153 publications

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

Otimização no dimensionamento e seqüenciamento de lotes de produção: estudo de caso numa fábrica de rações

Heterogeneous workers with learning ability assignment in a cellular manufacturing system

Contact Info

Product

Resources

About