Author:
Rakrouki Mohamed Ali,Kooli Anis,Chalghoumi Sabrine,Ladhari Talel
Publisher
Springer Science and Business Media LLC
Subject
Management of Technology and Innovation,Computational Theory and Mathematics,Management Science and Operations Research,Statistics, Probability and Uncertainty,Strategy and Management,Modeling and Simulation,Numerical Analysis
Reference28 articles.
1. Akkan C, Karabati S (2004) The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm. Eur J Oper Res 159(2):420–429
2. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
3. Bansal SP (1977) Minimizing the sum of completion times of n jobs over m machines in a flow shop. Am Inst Ind Eng Trans 9(3):306–311
4. Chalghoumi S, Mehdi M, Ladhari T (2013) A new lower bound for minimising the total completion time in a two-machine flow shop under release dates. In: IEEE international conference on modeling, simulation and applied optimization, Hammamet, April 28–30, 2013, pp 1–4
5. Chung CS, Flynn J, Kirca O (2002) A branch-and-bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. Int J Prod Econ 79(3):185–196
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献