On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

Grabowski, J.; Skubalska, Ewa; Smutnicki, Czesław

doi:10.2307/2581775

Cited by 4 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For minimizing maximum lateness in a permutation flow shop, branch and bound algorithms are proposed for problem F211Lmax by Townsend [527], for problem F21 Tjl Lmax by Grabowski [220], and for problem FI Tjl Lmax by Grabowski, Skubalska & Smutnicki [224], where the two latter algorithms are based on the block approach. Tadei, Gupta, Dela Croce & Cortesi [519] develop branch and bound algorithms for problem F21Tj1Gmax, which are also applicable to the reverse problem F211Lmax.…”

Section: Enumerative Algorithmsmentioning

confidence: 99%

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Chen

Potts

Woeginger

1998

Handbook of Combinatorial Optimization

188

145

View full text Add to dashboard Cite

Section: Enumerative Algorithmsmentioning

confidence: 99%

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Chen

Potts

Woeginger

1998

Handbook of Combinatorial Optimization

188

145

View full text Add to dashboard Cite

“…Two-machine and flowshop scheduling problems with time restrictions, however, are relatively less developed. Reference [26] is one of the first examples that developed solution algorithms to solve the two-machine scheduling with time constraints. Addressing the same problem, [27] proposed a branch and bound algorithm that yields better solutions compared to the earlier study.…”

Section: Introductionmentioning

confidence: 99%

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times

et al. 2020

View full text Add to dashboard Cite

Production management of perishable goods is highly complex and requires well-informed decisions in corresponding stages. In such production environments, scheduling problems with time constraints are of high relevance to ensure the timely flow of the work-in-process material and goods. This study introduces the no-wait flowshop scheduling problem with release times (NWFSP-RT) to help advance decision support systems in the food production industry. For this purpose, an original mixed-integer linear programming (MILP) formulation is proposed for minimizing the makespan. Since Beam Search (BS) algorithm has been successfully applied to solve various scheduling problems, a BS algorithm, and an improved variant, the local search-based Beam Search (BSLS) algorithms are developed to solve the NWFSP-RT problem. Extensive numerical analysis is conducted to analyze the performance of the algorithms in solving this highly intractable extension of the scheduling problems. We showed that BSLS effectively avoids early convergence and local optimality while dismissing non-promising search directions within a partial enumeration solution approach. The statistical analysis confirmed that the improved BS algorithm performs better in terms of solution quality. Applications of the developed heuristic are worthwhile research topics to pursue in solving other complex optimization problems. INDEX TERMS Flowshop scheduling, no-wait, release time, Beam Search.

show abstract

“…Isto é possível porque uma máquina cujos tempos de processamento de todas as tarefas são zero pode representar o espaço de armazenamento de uma tarefa (McCORMICK et al, 1989). Com o desenvolvimento da manufatura just-in-time e dos sistemas de controle kanban que mantêm um estoque limitado dentro do sistema, o problema de seqüenciamento com buffer limitado assume grande importância (LEISTEN, 1990;HALL & SRISKANDARAJAH, 1996).…”

Section: Introductionunclassified

“…O desempenho deste algoritmo superou o proposto por TAILLARD. Recentemente, NOWICKI & SMUTNICKI (1996) propuseram uma heurística baseada em busca tabu que utiliza a idéia de blocos de tarefas sugerida por GRABOWSKI et al (1983). Testes computacionais relatados pelos autores mostraram que o método proposto possui um desempenho melhor, em termos de qualidade e tempo, que outros métodos conhecidos da literatura.…”

Section: Introductionunclassified

See 1 more Smart Citation

Minimização do tempo total de atraso no problema de flowshop com buffer zero através de busca tabu

Armentano

Ronconi

2000

Gest. Prod.

View full text Add to dashboard Cite

Trabalhos na área de programação de tarefas mostram que atender a data de entrega dos consumidores é uma preocupação crítica na maioria dos sistemas de manufatura. Enquanto existe considerável pesquisa para minimizar o makespan para o problema de flowshop sem restrição de estoque intermediário, poucos trabalhos abordam o critério do atraso total no ambiente flowshop com buffer zero entre as máquinas. Problemas de seqüenciamento com buffer zero ocorrem em processos de manufatura em série que não possuem espaço para armazenamento intermediário. Neste artigo, pesquisa-se a aplicação de busca tabu para explorar o espaço de soluções deste problema. Estratégias adicionais são avaliadas. Testes computacionais são apresentados e comparações com uma adaptação do algoritmo NEH e com um algoritmo Branch-and-Bound são realizadas.

show abstract

On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

Cited by 4 publications

References 0 publications

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times

Minimização do tempo total de atraso no problema de flowshop com buffer zero através de busca tabu

Contact Info

Product

Resources

About