Maximizing weighted number of just-in-time jobs on unrelated parallel machines

Journal of Scheduling

Volumn 8, Issue 5, 2005, Pages 453-460

  Sung, Shao Chin ^a   Vlach, Milan ^b,c  

^a AOYAMA GAKUIN UNIVERSITY   (Japan)

^b The Kyoto College of Graduate Studies for Informatics   (Japan)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Just in time jobs; NP hardness; Polynomial time algorithm; Unrelated parallel machines

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING;

JUST-IN-TIME JOBS; NP-HARDNESS; UNRELATED PARALLEL MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 23944511158     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-005-2863-7     Document Type: Review

References (6)

1. Č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.
2. Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
3. 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).
4. 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).
5. Lann, A. and G. Mosheiov, "Single machine scheduling to minimize the number of early and tardy jobs," Computers & Operations Research 23, 765-781 (1996).
6. 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.