The permutation flow shop with buffers: A tabu search approach-Reference-Cited by-同舟云学术

The permutation flow shop with buffers: A tabu search approach

Published:1999-07 Issue:1 Volume:116 Page:205-219
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Nowicki Eugeniusz

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference14 articles.

1. A survey of machine scheduling problems with blocking and no-wait in process;Hall;Oper. Res.,1996

2. Flowshop sequencing problems with limited buffer storage;Leistein;International Journal of Production Research,1990

3. C. Smutnicki, Block approach for flow shop scheduling with storage constraints (Polish), Zeszyty Naukowe Politechniki Śla̧skiej, Ser. Automatyka 84 (1986) 223–233

4. C. Smutnicki, A two-machine flow shop scheduling problem with buffers, Technical Report PRE 19/97, Technical University of Wrocław

5. On two-machine scheduling with release and due dates to minimize maximum lateness;Grabowski;Opsearch,1980

Cited by 82 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deadlock control and hybrid social spider scheduling algorithm for two-stage assembly permutation flowshop with limited buffers;Expert Systems with Applications;2024-07

2. Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey;Sustainability;2023-08-29

3. Cyclic flow-shop scheduling with no-wait constraints and missing operations;European Journal of Operational Research;2022-10

4. Iterative beam search algorithms for the permutation flowshop;European Journal of Operational Research;2021-11

5. Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation;European Journal of Operational Research;2021-10