Skip to main content
SpringerLink
Log in

Scheduling problems in master-slave model

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider scheduling problems in the master slave model, which was introduced by Sahni in 1996. The goal is to minimize the makespan and the total completion time. It has been shown that the problem of minimizing makespan is NP-hard. Sahni and Vairaktarakis developed some approximation algorithms to generate schedules whose makespan is at most constant times the optimal. In this paper, we show that the problem of minimizing total completion time is NP-hard in the strong sense. Then we develop algorithms to generate schedules whose total completion time and makespan are both bounded by some constants times their optimal values.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Allaoui, H., & Artiba, A. (2006). Scheduling two-stage hybrid flow shop with availability constraints. Computers and Operations Research, 33(5), 1399–1419.

    Article  Google Scholar 

  • Buten, R. E., & Shen, V. Y. (1973). A scheduling model for computer systems with two classes of processors. In Proceedings of 1973 sagamore computer conference on parallel processing (pp. 130–138).

  • Chakrabarti, S., Phillips, C., Schulz, A., Shmoys, D. B., Stein, C., & Wein, J. (1996). Improved scheduling algorithms for minsum criteria. In Proceedings of the 23rd international colloquium on automata, languages and programming (pp. 646–657).

  • Chekuri, C., Motwani, R., Natarajan, B., & Stein, C. (2001). Approximation techniques for average completion time scheduling. SIAM Journal on Computing, 31(1), 146–166.

    Article  Google Scholar 

  • Cheng, T. C. E., & Sin, C. C. S. (1990). State-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 271–290.

    Article  Google Scholar 

  • Goemans, M. X. (1997). Improved approximation algorithms for scheduling with release dates. In Proceedings of the eighth ACM-SIAM symposium on discrete algorithms (pp. 591–598).

  • Guinet, A. G. P., & Solomon, M. M. (1996). Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion-time. International Journal of Production Research, 34, 1643–1654.

    Article  Google Scholar 

  • Gupta, J. N. D., & Tunc, E. A. (1994). Scheduling a 2-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research, 77, 415–428.

    Article  Google Scholar 

  • Hall, L. A., Schulz, A. S., Shmoys, D. B., & Wein, J. (1997). Scheduling to minimize average completion time: Offline and online algorithms. Mathematics of Operations Research, 22, 513–544.

    Google Scholar 

  • Kern, W., & Nawijn, W. (1991). Scheduling multi-operation jobs with time lags on a single machine. In U. Faigle & C. Hoede (Eds.). Proceedings 2nd twente workshop on graphs and combinatorial optimization, Enschede.

  • Langston, M. A. (1987). Interstage transportation planning in the deterministic flow-shop environment. Operations Research, 35(4), 556–564.

    Google Scholar 

  • Lee, C.-Y., & Vairaktarakis, G. L. (1994). Minimizing makespan in hybrid flowshops. Operations Research Letters, 16, 149–158.

    Article  Google Scholar 

  • Leung, J. Y.-T., & Zhao, H. (2005). Minimizing mean flowtime and makespan on master-slave systems. Journal of Parallel and Distributed Computing, 65, 843–856.

    Article  Google Scholar 

  • Leung, J. Y.-T., & Zha, H. (2006). Minimizing sum of completion times and makespan in master-slave systems. IEEE Transactions on Computers, 55, 985–999.

    Article  Google Scholar 

  • Phillips, C., Stein, C., & Wein, J. (1998). Minimizing average completion time in the presence of release dates. Mathematical Programming, 82, 199–223.

    Google Scholar 

  • Sahni, S. (1996). Scheduling master-slave multiprocessor systems. IEEE Transactions on Computers, 45(10), 1195–1199.

    Article  Google Scholar 

  • Sahni, S., & Vairaktarakis, G. (1996). The master-slave paradigm in parallel computer and industrial settings. Journal of Global Optimization, 9, 357–377.

    Article  Google Scholar 

  • Sahni, S., & Vairaktarakis, G. (2004). The master-slave scheduling model. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models, and performance analysis. Boca Raton: CRC Press.

    Google Scholar 

  • Schrage, L. (1968). A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16, 687–690.

    Google Scholar 

  • Schulz, A. S., & Skutella, M. (1997). Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria. In Proceedings of the fifth annual European symposium on algorithms (pp. 416 429).

  • Smith, D. (1976). A new proof of the optimality of the shortest remaining processing time discipline. Operations Research, 26(1), 197–199.

    Article  Google Scholar 

  • Sriskandarajah, C., & Sethi, S. P. (1989). Scheduling algorithms for flexible flowshops: worst and average case performance. European Journal of Operational Research, 43, 143–160.

    Article  Google Scholar 

  • Vairaktarakis, G. (1997). Analysis of algorithms for master-slave system. IIE Transactions, 29(11), 939–949.

    Google Scholar 

  • Yu, W., Hoogeveen, H., & Lenstra, J. K. (2004). Minimizing makespan in a two-machine flowshop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7(5), 333–348.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, 07102, USA

    Joseph Y.-T. Leung

  2. Department of Mathematics, Computer Science, and Statistics, Purdue University Calumet, 2200 169th Street, Hammond, IN, 46323-2094, USA

    Hairong Zhao

Authors
  1. Joseph Y.-T. Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hairong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joseph Y.-T. Leung.

Additional information

Research supported in part by the National Science Foundation through grant DMI-0300156.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leung, J.YT., Zhao, H. Scheduling problems in master-slave model. Ann Oper Res 159, 215–231 (2008). https://doi.org/10.1007/s10479-007-0271-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0271-4

Keywords

Search

Navigation