Skip to main content
SpringerLink
Log in

Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We are concerned with problems of scheduling jobs non-preemptively with the objective to maximize the weighted number of jobs that are completed exactly at their due dates. It has been shown that the problems for single machine and identical parallel machines are polynomial time solvable. The purpose of this paper is to establish the complexity status of the problem for unrelated parallel machine, which was left open. First, we present a polynomial time algorithm for solving the problem when the number of machine is fixed. Second, we show that when the number of machine is a part of input, the problem becomes NP-hard in the strong sense.

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

  • Čepek, O. and S. C. Sung, “A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines,” accepted by Computers & Operations Research, 2004.

  • Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.

    Google Scholar 

  • Gavril, F., “Algorithms for minimizing coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph,” SIAM Journal on Computing, 1(2), 180–187 (1972).

    Article  Google Scholar 

  • Hiraishi, K., E. Levner, and M. Vlach, “Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs,” Computers & Operations Research, 29(7), 841–848 (2002).

    Google Scholar 

  • Lann, A. and G. Mosheiov, “Single machine scheduling to minimize the number of early and tardy jobs,” Computers & Operations Research 23, 765–781 (1996).

    Google Scholar 

  • Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, “Sequencing and scheduling, Algorithms and complexity,” in S. C. Graves, A. H. G. Rinnooy Kan and P. H. Zipkin (eds.), Handbooks in Operations Research and Management Science, Vol. 4, Amsterdam, 1993, pp. 455–522.

Download references

Author information

Author notes

  1. Milan Vlach

    Present address: School of Mathematics and Physics, Charles University, Prague, Czech Republic

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, College of Science and Engineering, Aoyama Gakuin University, 5-10-1 Fuchinobe, Sagamihara City, Kanagawa, 229-8551, Japan

    Shao Chin Sung

  2. Kyoto College of Graduate Studies for Informatics, 7 Monzen-cho, Tanaka, Sakyo-ku, Kyoto, 606-8225, Japan

    Milan Vlach

Authors
  1. Shao Chin Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Milan Vlach
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shao Chin Sung.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sung, S.C., Vlach, M. Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. J Sched 8, 453–460 (2005). https://doi.org/10.1007/s10951-005-2863-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-005-2863-7

Keywords

Search

Navigation