Author:
Emmons Hamilton,Vairaktarakis George
Reference59 articles.
1. Akkan, C. and S. Karabati (2004) The two-machine Flowshop Total Completion Time Problem: Improved Lower Bounds and a Branch-and-Bound Algorithm, European Journal of Operational Research, 159, 420–429.
2. Ahmadi, R.H. and U. Bagchi (1990) Improved Lower Bounds for Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flow Shop, European Journal of Operational Research, 44, 331–336.
3. Al-Anzi, F. and A. Allahverdi (2001) The Relationship Between Three-tiered Client-server Internet Database Connectivity and Two-Machine Flowshop, International Journal of Parallel and Distributed Systems and Networks, 4, 94–101.
4. Allahverdi, A. (2000) Minimizing Mean Flowtime in a Two-Machine Flowshop with Sequence-Independent Setup Times, Computers and Operations Research, 27, 111–127.
5. Allahverdi, A. and F. Al-Anzi (2002) Using Two-Machine Flowshop with Maximum Lateness Objective to Model Multimedia Data Objects Scheduling Problem for WWW Applications, Computers and Operations Research, 29, 971–994.