The flow shop problem with no-idle constraints: A review and approximation-Reference-Cited by-同舟云学术

The flow shop problem with no-idle constraints: A review and approximation

Published:2009-07 Issue:2 Volume:196 Page:450-456
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Goncharov Yaroslav,Sevastyanov Sergey

Publisher

Elsevier BV

Subject

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

Reference24 articles.

1. Flow-shop/no-idle or no-wait scheduling to minimize the sum of completion times;Adiri;Naval Research Logistics Quarterly,1982

2. Makespan minimization in the conveyer problem (in Russian);Babushkin;Avtomatika i telemekhanika,1975

3. P. Baptiste, K.H. Lee, A branch and bound algorithm for the F|no-idle|Cmax, in: Proceedings of the International Conference on Industrial Engineering and Production Management, vol. 1, 1997, pp. 429–438.

4. The complexity of flowshop and jobshop scheduling;Garey;Mathematics of Operations Research,1976

5. Sequencing a one statevariable machine: A solvable case of the traveling salesman problem;Gilmore;Operations Research,1964

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

1. A branch-and-bound approach to the no-idle flowshop scheduling problem;Discrete Applied Mathematics;2024-04

2. No idle flow shop scheduling models with separated set-up times and concept of job weightage to optimize rental cost of machines;Journal of Project Management;2024

3. Minimizing the maximum tardiness for a permutation flow shop problem under the constraint of sequence independent setup time;RAIRO - Operations Research;2024-01

4. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time;Journal of Project Management;2024

5. Two Stage No Idle Flow Shop Scheduling To Minimize Rental Cost Including Transportation Time;2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT);2023-07-06