A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times-Reference-Cited by-同舟云学术

A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times

Published:2006-03 Issue:3 Volume:169 Page:767-780
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Allahverdi Ali,Al-Anzi Fawaz S.

Publisher

Elsevier BV

Subject

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

Reference28 articles.

1. Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flowshop;Ahmadi;European Journal of Operational Research,1990

2. The relationship between three-tiered client–server internet database connectivity and two-machine flowshop;Al-Anzi;International Journal of Parallel and Distributed Systems and Networks,2001

3. Two-stage production scheduling with separated setup times and stochastic breakdowns;Allahverdi;Journal of the Operational Research Society,1995

4. Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times;Allahverdi;Computers and Operations Research,2000

5. Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications;Allahverdi;Computers and Operations Research,2002

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

1. Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times;RAIRO - Operations Research;2023-07

2. Fuzzy Artificial Immune System based Generators Preventive Maintenance Scheduling;SoutheastCon 2022;2022-03-26

3. Mathematical modeling and two efficient branch and bound algorithms for job shop scheduling problem followed by an assembly stage;Kybernetes;2021-01-22

4. Smart Make-to-Order Production in a Flow Shop Environment for Industry 4.0;Research Anthology on Cross-Industry Challenges of Industry 4.0;2021

5. An exact dynamic programming algorithm for the precedence-constrained class sequencing problem;Computers & Operations Research;2020-12