A new heuristic and dominance relations for no-wait flowshops with setups

Aldowaisan, Tariq

doi:10.1016/s0305-0548(99)00136-7

Cited by 59 publications

(30 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Each variable in a country denotes a socio-political characteristic of a country. From this point of view, all the algorithm does is to search for the best country that is the country with the best combination of socio-political characteristics such as culture, language, and economical policy [28].…”

Section: Proposed Algorithm 31 Hybrid Imperialist Competitive Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness

Rahmanidoust¹,

Zheng²,

Rabiee³

2017

IJCA

View full text Add to dashboard Cite

This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to other solution approaches reported on the literature. For this purpose, we draw an analogy between the results obtained from algorithms applied to some random case study. To achieve reliable results, Taguchi approach is used to define robust parameters' values for our proposed algorithm. The superiority and effectiveness of our proposed algorithm is inferred from all the results obtained in various situations.

show abstract

Section: Proposed Algorithm 31 Hybrid Imperialist Competitive Algorithmmentioning

confidence: 99%

“…Machine setup time is an important factor for production scheduling in all flow-type manufacturing environments. Majority of scheduling researches on flow shops consider setup times to be negligible or as a part of the processing times [28]. But, we consider a sequence dependent setup time approach for our mentioned problem.…”

Section: Introductionmentioning

confidence: 99%

Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness

Rahmanidoust¹,

Zheng²,

Rabiee³

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…We simply try each pair of values for x i 1 ,j and x i 2 ,j and see if swapping them improves the refined objective function. For example, suppose i 1 < i 2 4), (2, 1), (2, 3), (2, 4), (3, 1), (3, 4)}.…”

Section: Example 13mentioning

confidence: 99%

Dominance breaking constraints

Chu

Stuckey

2014

Constraints

View full text Add to dashboard Cite

Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symmetry breaking which is relatively well studied, dominance breaking techniques are not very well understood and are not commonly applied. In this paper, we present formal definitions of dominance breaking, and a generic method for identifying and exploiting dominance relations via dominance breaking constraints. We also give a generic proof of the correctness and compatibility of symmetry breaking constraints, conditional symmetry breaking constraints and dominance breaking constraints.

show abstract

“…O setup antecipado pode ser realizado antes da liberação da tarefa, ou seja, antes do término da operação no estágio anterior. Uma importante implicação dos tempos de setup antecipados é que eles podem ser iniciados na máquina ou estágio subsequente enquanto a tarefa ainda está sendo executada (ALDOWAISAN, 2001). E como é comum haver tempo ocioso na segunda máquina em diante, antecipar o setup é uma vantagem para medidas de desempenho regulares, como é caso do makespan e do tempo de fluxo (ALLAHVERDI, 2000 Como já salientado, neste trabalho foram considerados os tempos de setup antecipados e independentes da sequência de execução das tarefas.…”

Section: Tempos De Setupunclassified

Proposição de algoritmo simulated annealing para programação em flow shops paralelos proporcionais com tempos de setup explícitos

Fuchigami

2014

Revista PO: R. Eletr. de Eng. de Produção e Correlatas

View full text Add to dashboard Cite

Resumo: Este trabalho aborda o problema de otimização da duração total da programação (makespan) em dois flow shops paralelos proporcionais com tempos de setup explícitos e independentes da sequência de tarefas. O problema de programação em flow shops paralelos é um caso específico do conhecido flow shop híbrido, caracterizado por sistemas produtivos multiestágio com mais de uma máquina operando em paralelo em cada estágio, e muito frequente em vários tipos de indústrias como química, eletrônica, automotiva, farmacêutica e alimentícia. Este trabalho objetivou propor seis algoritmos Simulated Annealing e seus respectivos esquemas de perturbação, além de um algoritmo para geração da sequência inicial, para solução do problema descrito. Este estudo pode ser classificado como "pesquisa aplicada" quanto à natureza, "pesquisa exploratória" quanto aos objetivos e "pesquisa experimental" quanto aos procedimentos, além da abordagem "quantitativa". Os algoritmos propostos mostraram-se eficazes quanto a solução e eficientes computacionalmente. Os resultados da Análise de Variância (ANOVA) revelaram que não existe diferença significativa entre os esquemas de perturbação em termos do makespan. Sugere-se a utilização do esquema PS4, que faz o deslocamento de uma subsequência de tarefas, por ter fornecido a melhor porcentagem de sucesso. Verificou-se também que é significativa a diferença entre os resultados dos algoritmos para cada valor do fator de proporcionalidade dos tempos de processamento e de setup dos flow shops. Palavras-chave: Programação da produção. Flow shops paralelos. Simulated annealing. Tempos de setup.Abstract: This article addresses the problem of minimizing makespan on two parallel flow shops with proportional processing and setup times. The setup times are separated and sequence-independent. The parallel flow shop scheduling problem is a specific case of well-known hybrid flow shop, characterized by a multistage production system with more than one machine working in parallel at each stage. This situation is very common in various kinds of companies like chemical, electronics, automotive, pharmaceutical and food industries. This work aimed to propose six Simulated Annealing algorithms, their perturbation schemes and an algorithm for initial sequence generation. This study can be classified as "applied research" regarding the nature, "exploratory" about the objectives and "experimental" as to procedures, besides the "quantitative" approach. The proposed algorithms were effective regarding the solution and computationally efficient. Results of Analysis of Variance (ANOVA) revealed no significant difference between the schemes in terms of makespan. It's suggested the use of PS4 scheme, which moves a subsequence of jobs, for providing the best percentage of success. It was also found that there is a significant difference between the results of the algorithms for each value of the proportionality factor of the processing and setup times of flow shops.

show abstract

A new heuristic and dominance relations for no-wait flowshops with setups

Cited by 59 publications

References 17 publications

Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness

Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness

Dominance breaking constraints

Proposição de algoritmo simulated annealing para programação em flow shops paralelos proporcionais com tempos de setup explícitos

Contact Info

Product

Resources

About