Improved approaches to the exact solution of the machine covering problem

Journal of Scheduling

Volumn 20, Issue 2, 2017, Pages 147-164

  Walter, Rico ^a   Wirth, Martin ^b   Lawrinenko, Alexander ^c  

^a FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Branch and bound; Dominance criteria; Identical parallel machines; Machine covering

Indexed keywords

ALGORITHMS; BENCHMARKING; BUSINESS MACHINES; STRUCTURAL OPTIMIZATION;

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL STUDIES; DOMINANCE CRITERIA; IDENTICAL PARALLEL MACHINES; LOWER AND UPPER BOUNDS; MACHINE COVERING; MINIMUM MACHINE COMPLETION; SOLUTION REPRESENTATION;

BRANCH AND BOUND METHOD;

EID: 84964269856     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-016-0477-x     Document Type: Article

References (27)

1. Ahuja, R. K., & Orlin, J. B. (2001). Inverse optimization. Operations Research, 49, 771–783.
2. Alvim, A. C. F., Ribeiro, C. C., Glover, F., & Aloise, D. J. (2004). A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10, 205–229.
3. Azar, Y., & Epstein, L. (1998). On-line machine covering. Journal of Scheduling, 1, 67–77.
4. Brucker, P., & Shakhlevich, N. V. (2009). Inverse scheduling with maximum lateness objective. Journal of Scheduling, 12, 475–488.
5. Brucker, P., & Shakhlevich, N. V. (2011). Inverse scheduling: Two-machine flow-shop problem. Journal of Scheduling, 14, 239–256.
6. Cai, S.-Y. (2007). Semi-online machine covering. Asia-Pacific Journal of Operational Research, 24, 373–382.
7. Csirik, J., Kellerer, H., & Woeginger, G. (1992). The exact LPT-bound for maximizing the minimum completion time. Operations Research Letters, 11, 281–287.
8. Dell’Amico, M., & Martello, S. (1995). Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing, 7, 191–200.
9. Deuermeyer, B. L., Friesen, D. K., & Langston, M. A. (1982). Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM Journal on Algebraic and Discrete Methods, 3, 190–196.
10. Ebenlendr, T., Noga, J., Sgall, J., & Woeginger, G. (2006). A note on semi-online machine covering. In T. Erlebach & G. Persiano (Eds.), Approximation and online algorithms. Lecture Notes in Computer Science (Vol. 3879, pp. 110–118). Berlin: Springer.
11. Epstein, L., Levin, A., & van Stee, R. (2011). Max-min online allocations with a reordering buffer. SIAM Journal on Discrete Mathematics, 25, 1230–1250.
12. França, P. M., Gendreau, M., Laporte, G., & Müller, F. M. (1994). A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Computers & Operations Research, 21, 205–210.
13. Frangioni, A., Necciari, E., & Scutellà, M. G. (2004). A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. Journal of Combinatorial Optimization, 8, 195–220.
14. Friesen, D. K., & Deuermeyer, B. L. (1981). Analysis of greedy solutions for a replacement part sequencing problem. Mathematics of Operations Research, 6, 74–87.
15. Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 416–429.
16. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.
17. Haouari, M., & Jemmali, M. (2008). Maximizing the minimum completion time on parallel machines. 4OR: A Quarterly Journal of Operations Research, 6, 375–392.
18. He, Y., & Tan, Z. Y. (2002). Ordinal on-line scheduling for maximizing the minimum machine completion time. Journal of Combinatorial Optimization, 6, 199–206.
19. Heuberger, C. (2004). Inverse combinatorial optimization: A survey on problems, methods, and results. Journal of Combinatorial Optimization, 8, 329–361.
20. Koulamas, C. (2005). Inverse scheduling with controllable job parameters. International Journal of Services and Operations Management, 1, 35–43.
21. Labbé, M., Laporte, G., & Martello, S. (1995). An exact algorithm for the dual bin packing problem. Operations Research Letters, 17, 9–18.
22. Luo, R.-Z., & Sun, S.-J. (2005). Semi on-line scheduling problem for maximizing the minimum machine completion time on m identical machines. Journal of Shanghai University, 9, 99–102.
23. Peeters, M., & Degraeve, Z. (2006). Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem. European Journal of Operational Research, 170, 416–439.
24. Tan, Z., & Wu, Y. (2007). Optimal semi-online algorithms for machine covering. Theoretical Computer Science, 372, 69–80.
25. Walter, R. (2013). Comparing the minimum completion times of two longest-first scheduling-heuristics. Central European Journal of Operations Research, 21, 125–139.
26. Walter, R., & Lawrinenko, A. (2014). Effective solution space limitation for the identical parallel machine scheduling problem. Working Paper. http://s.fhg.de/WrkngPprRW.
27. Woeginger, G. J. (1997). A polynomial-time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters, 20, 149–154.