
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Joseph Y.T. Leung, Hairong Zhao, "Minimizing Sum of Completion Times and Makespan in MasterSlave Systems," IEEE Transactions on Computers, vol. 55, no. 8, pp. 985999, August, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.128, author = {Joseph Y.T. Leung and Hairong Zhao}, title = {Minimizing Sum of Completion Times and Makespan in MasterSlave Systems}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {8}, issn = {00189340}, year = {2006}, pages = {985999}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.128}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Minimizing Sum of Completion Times and Makespan in MasterSlave Systems IS  8 SN  00189340 SP985 EP999 EPD  985999 A1  Joseph Y.T. Leung, A1  Hairong Zhao, PY  2006 KW  Sequence and scheduling KW  approximation algorithms KW  makespan KW  linear programming. VL  55 JA  IEEE Transactions on Computers ER   
[1] M. Dell'Amico, “Shop Problems with Two Machines and Time Lags,” Operations Research, vol. 44, no. 5, pp. 777787, 1996.
[2] R.E. Buten and V.Y. Shen, “A Scheduling Model for Computer Systems with Two Classes of Processors,” Proc. Sagamore Computer Conf. Parallel Processing, pp. 130138, 1973.
[3] C. Chekuri, R. Motwani, B. Natarajan, and C. Stein, “Approximation Techniques for Average Completion Time Scheduling,” SIAM J. Computing, vol. 31, no. 1, pp. 146166, 2001.
[4] S. Chakrabarti, C. Phillips, A. Schulz, D.B. Shmoys, C. Stein, and J. Wein, “Improved Scheduling Algorithms for Minsum Criteria,” Proc. 23rd Int'l Colloquium Automata, Languages and Programming, pp. 646657, 1996.
[5] J. Du and J.YT. Leung, “Minimizing Mean Flow Time in TwoMachine Open Shops and Flow Shops,” J. Algorithms, vol. 14, pp.2444, 1993.
[6] M.X. Goemans, “Improved Approximation Algorithms for Scheduling with Release Dates,” Proc. Eighth ACMSIAM Symp. Discrete Algorithms, pp. 591598, 1997.
[7] J.N. D. Gupta, “TwoStage, Hybrid Flowshop Scheduling Problem,” J. Operational Research Soc., vol. 38, pp. 359364, 1988.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. New York: Freeman, 1979.
[9] T.F. Gonzalez and S. Sahni, “Flowshop and Jobshop Schedules: Complexity and Approximation,” Operations Research, vol. 26, pp.2652, 1978.
[10] L.A. Hall, A.S. Schulz, D.B. Shmoys, and J. Wein, “Scheduling to Minimize Average Completion Time: Offine and Online Algorithms,” Math. Operations Research, vol. 22, pp. 513544, 1997.
[11] J.A. Hoogeveen and T. Kawaguchi, “Minimizing Sum of the Completion Times in a Two Machine Flowshop: Analysis of Special Cases,” Math. Operations Research, vol. 24, no. 4, pp. 887910, 1999.
[12] L.A. Hall, “Approximability of Flow Shop Scheduling,” Math. Programming, vol. 82, pp. 175190, 1998.
[13] S.M. Johnson, “Optimal Two and ThreeStage Production Schedules with Setup Times Included,” Naval Research Logistics Quarterly, vol. 1, pp. 6168, 1954.
[14] W. Kern and W. Nawijn, “Scheduling Multioperation Jobs with Time Lags on a Single Machine,” technical report, Univ. of Twente, 1993.
[15] M.A. Langston, “Interstage Transportation Planning in the Deterministic FlowShop Environment,” Operations Research, vol. 35, no. 4, pp. 556564, 1987.
[16] C.Y. Lee and G.L. Vairaktarakis, “Minimizing Makespan in Hybrid Flowshops,” Operations Research Letters, vol. 16, pp. 149158, 1994.
[17] J.YT. Leung and H. Zhao, “Minimizing Mean Flowtime and Makespan on MasterSlave Systems,” J. Parallel and Distributed Computing, vol. 65, pp. 843856, 2005.
[18] C. Phillips, C. Stein, and J. Wein, “Minimizing Average Completion Time in the Presence of Release Dates,” Math. Programming, vol. 82, pp. 199223, 1998.
[19] M. Queyranne, “Structure of a Simple Scheduing Polyhedron,” Math. Programming, vol. 58, pp. 263285, 1993.
[20] M. Queyranne, personal communication, 1995.
[21] S. Sahni, “Scheduling MasterSlave Multiprocessor Systems,” IEEE Trans. Computers, vol. 45, no. 10, pp. 11951199, Oct. 1996.
[22] A.S. Schulz, “Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LPBased Heuristics and Lower Bounds,” Proc. Fifth Integer Programming and Combinatorial Optimaization (IPCO), pp. 301315, 1996.
[23] L. Schrage, “A Proof of the Optimality of the Shortest Remaining Processing Time Discipline,” Operations Research, vol. 16, pp. 687690, 1968.
[24] D. Smith, “A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline,” Operations Research, vol. 26, no. 1, pp. 197199, 1976.
[25] W. Szwarc, “FlowShop Problems with Time Lags,” Management Science, vol. 29, pp. 447491, 1983.
[26] C. Sriskandarajah and S.P. Sethi, “Scheduling Algorithms for Flexible Flowshops: Worst and Average Case Performance,” European J. Operational Research, vol. 43, pp. 143160, 1989.
[27] A.S. Schulz and M. Skutella, “SchedulingLPs Bear Probabilities: Randomized Approximations for MinSum Criteria,” Proc. Fifth Ann. European Symp. Algorithms, pp. 416429, 1997.
[28] S. Sahni and G. Vairaktarakis, “The MasterSlave Paradigm in Parallel Computer and Industrial Settings,” J. Global Optimization, vol. 9, pp. 357377, 1996.
[29] S. Sahni and G. Vairaktarakis, “The MasterSlave Scheduling Model,” Handbook of Scheduling: Algorithms, Models, and Performance Analysis, 2004.
[30] G. Vairaktarakis, “Analysis of Algorithms for MasterSlave System,” IIE Trans., vol. 29, no. 11, pp. 939949, 1997.
[31] L.A. Wolsey, “Mixed Integer Programming Formulations for Production Planning and Scheduling Problems,” Invited talk at the 12th Int'l Symp. Math. Programming, 1985.
[32] W. Yu, H. Hoogeveen, and J.K. Lenstra, “Minimizing Makespan in a TwoMachine Flowshop with Delays and UnitTime Operations is NPHard,” J. Scheduling, vol. 7, no. 5, pp. 333348, 2004.