Parallel machine problems with equal processing times: A survey

Journal of Scheduling

Volumn 14, Issue 5, 2011, Pages 435-444

  Kravchenko, Svetlana A ^a   Werner, Frank ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Equal processing times; Non preemptive problems; NP hard problems; Parallel machine problem; Polynomial algorithms; Preemptive problems

Indexed keywords

NON-PREEMPTIVE; NP-HARD PROBLEM; PARALLEL MACHINE PROBLEMS; POLYNOMIAL ALGORITHMS; PREEMPTIVE PROBLEMS; PROCESSING TIME;

COMPUTATIONAL COMPLEXITY;

SURVEYS;

EID: 81155134810     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-011-0231-3     Document Type: Conference Paper

References (45)

1. Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2(6), 245-252. (Pubitemid 129633866)
2. Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103, 21-32.
3. Baptiste, P., & Brucker, P. (2004). Scheduling equal processing time jobs: A survey. In Y. T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis (pp. 78-96). Boca Raton: CRC Press.
4. Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. G. (2004a). Ten notes on equal-processing-time scheduling. 4OR, 2, 111-127.
5. Baptiste, P., Chrobak, M., Dürr, C., Jawor,W., & Vakhania, N. (2004b). Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operations Research Letters, 32, 258-264.
6. Baptiste, P., Brucker, P., Chrobak, M., Dürr, C., Kravchenko, S. A., & Sourd, F. (2007). The complexity of mean flow time scheduling problems with release times. Journal of Scheduling, 10, 139-146. (Pubitemid 46325889)
7. Brucker, P., & Knust, S. (2010). Complexity results for scheduling problems. http://www.mathematik.uni-osnabrueck.de/research/ OR/class/.
8. Brucker, P., & Kravchenko, S. A. (2005). Scheduling jobs with release times on parallel machines to minimize total tardiness (Preprint Heft 258). Universität Osnabrück, 13 pp.
9. Brucker, P., & Kravchenko, S. A. (2006). Scheduling equal processing time jobs to minimize the weighted number of late jobs. Journal of Mathematical Modelling and Algorithms, 5(2), 143-165. (Pubitemid 43787432)
10. Brucker, P., & Kravchenko, S. A. (2008). Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling, 11, 229-237.
11. Brucker, P., Garey, M. R., & Johnson, D. S. (1977). Scheduling equallength tasks under tree-like precedence constraints to minimize maximum lateness. Mathematics of Operations Research, 2, 275-284. (Pubitemid 8575870)
12. Chakhlevitch, K., Glass, C. A., & Kellerer, H. (2011). Batch machine production with perishability time windows and limited batch size. European Journal of Operational Research, 210, 39-47.
13. Chrobak, M., Dürr, C., Jawor, W., Kowalik, L, & Kurowski, M. (2006). A note on scheduling equal-length jobs to maximize throughput. Journal of Scheduling, 9, 71-73. (Pubitemid 43063751)
14. Dessouky, M. I., Lageweg, B. J., Lenstra, J. K., & van de Velde, S. L. (1990). Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica, 44, 115-123.
15. Ding, J., Ebenlendr, T., Sgall, J., & Zhang, G. (2007). Onlinescheduling of equal-length jobs on parallel machines. Lecture Notes in Computer Science, 4698, 427-438.
16. Dürr, C. (2010). The scheduling zoo. http://www.lix.polytechnique. fr/ ~durr/query/.
17. Dürr, C., & Hurrand, M. (2006). Finding total unimodularity in optimization problems solved by linear programs. In Proc. of the 14th annual European symposium on algorithms (ESA) (pp. 315-326).
18. Fayolle, G., Gelenbe, E., Labetoulle, J., & Bastin, D. (1974). The stability problem of broadcast packet switching computer networks. Acta Informatica, 4, 49-53.
19. Fujii, M., Kasami, T., & Ninomiya, K. (1969). Optimal sequencing of two equivalent processors. SIAM Journal on Applied Mathematics, 17, 234-248.
20. Garey, M. R., Johnson, D. S., Simons, B. B., & Tarjan, R. E. (1981). Scheduling unit-time tasks with arbitrary release times and deadlines. Journal of Computers, 10, 256-269.
21. Glass, C. A., & Mills, H. R. (2006). Scheduling unit length jobs with parallel nested machine processing set restrictions. Computers & Operations Research, 33, 620-638. (Pubitemid 41101116)
22. Huo, Y., Leung, J. Y.-T., & Wang, X. (2008). Online scheduling of equal-processing-time task systems. Theoretical Computer Science, 401, 85-95.
23. Kravchenko, S. A. (2000). On the complexity of minimizing the number of late jobs in unit time open shop. Discrete Applied Mathematics, 100, 127-132.
24. Kravchenko, S. A., & Werner, F. (2007). On a parallel machine scheduling problem with equal processing times (Preprint 26/07). Otto-von-Guericke-Universität Magdeburg, FMA, 9 pp.
25. Kravchenko, S. A., & Werner, F. (2009a). Minimizing a separable convex function on parallel machines with preemptions (Preprint 22/09). Otto-von-Guericke-Universität Magdeburg, FMA, 20 pp.
26. Kravchenko, S. A., & Werner, F. (2009b). Minimizing the number of machines for scheduling jobs with equal processing times. European Journal of Operational Research, 199, 595-600.
27. Kravchenko, S. A., & Werner, F. (2009c). On a parallel machine scheduling problem with equal processing times. Discrete Applied Mathematics, 157, 848-852.
28. Kravchenko, S. A., & Werner, F. (2009d). Preemptive scheduling on uniform machines to minimize mean flow time. Computers & Operations Research, 36(10), 2816-2821.
29. Labetuolle, J., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1984). Preemptive scheduling of uniform machines subject to release dates. In H. R. Pulleyblank (Ed.), Progress in combinatorial optimization (pp. 245-261). New York: Academic Press.
30. Lawler, E. L. (1982). Recent results in the theory of machine scheduling. In A. Bachem (Ed.), Mathematical programming: the state of the art (pp. 202-234). Berlin: Springer.
31. Lawler, E. L. (1994). Knapsack-like scheduling problems, the Moore- Hodgson algorithm and the 'tower of set' property. Mathematical and Computer Modelling, 20(2), 91-106.
32. Lawler, E. L., & Labetoulle, J. (1978). On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the Association for Computing Machinery, 25(4), 612-619. (Pubitemid 9399485)
33. Lenstra, J. K., & Rinnooy Kan, A. H. G. (1978). Complexity of scheduling under precedence constraints. Operations Research, 26, 22-35.
34. Lenstra, J. K., Rinnooy Kan, A. G. H., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
35. Leung, J. Y.-T., & Young, G. H. (1990). Preemptive scheduling to minimize mean weighted flow time. Information Processing Letters, 34, 47-50.
36. Liu, L. L., Ng, C. T., & Cheng, T. C. E. (2009). Bicriterion scheduling with equal processing times on a batch processing machine. Computers & Operations Research, 36, 110-118.
37. Sevastianov, S. V. (2005). An introduction to multi-parameter complexity analysis of discrete problems. European Journal of Operational Research, 165, 387-397. (Pubitemid 40206369)
38. Simons, B. (1978). A fast algorithm for single processor scheduling. In Proc. IEEE 19th annual symposium on foundations of computer science (FOCS'78) (pp. 246-252).
39. Simons, B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing, 12, 7-9.
40. Simons, B. B., & Sipser, M. (1984). On scheduling unit-length jobs with multiple release time/deadline intervals. Operations Research, 32, 80-88. (Pubitemid 14546334)
41. Simons, B. B., & Warmuth, M. K. (1989). A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing, 18, 690-710.
42. Tian, Z., Ng, C. T., & Cheng, T. C. E. (2006). An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. Journal of Scheduling, 9, 343-364. (Pubitemid 43742240)
43. Ullman, J. D. (1975). NP-complete scheduling problems. Journal of Computer and System Sciences, 10, 384-393.
44. Ullman, J. D. (1976). Complexity of sequencing problems. In J. L. Bruno, E. G. Coffman Jr., R. L. Graham, W. H. Kohler, R. Sethi, K. Steiglitz, & J. D. Ullman (Eds.), Computer and job/shop scheduling theory. New York: Wiley.
45. Vakhania, N. (2003). A better algorithm for sequencing with release and delivery times on identical machines. Journal of Algorithms, 48, 273-293.