Minimizing the number of late jobs on a single machine under due date uncertainty

Journal of Scheduling

Volumn 14, Issue 4, 2011, Pages 351-360

  Aissi, Hassene ^a   Aloulou, Mohamed Ali ^a   Kovalyov, Mikhail Y ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Assignment; Min max approach; Robustness; Scenarios; Scheduling; Single machine; Uncertainty

Indexed keywords

ASSIGNMENT; MIN-MAX; SCENARIOS; SINGLE MACHINES; UNCERTAINTY;

DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 80054935233     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-010-0183-z     Document Type: Article

References (11)

1. Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229-242. (Pubitemid 40000802)
2. Aissi, H., Bazgan, C., & Vanderpooten, D. (2005). Complexity of the min-max and min-max regret assignment problem. Operations Research Letters, 33, 634-640. (Pubitemid 41231024)
3. Aloulou, M. A., & Della-Croce, F. (2008). Complexity of one machine scheduling problems under scenario-based uncertainty. Operations Research Letters, 36, 338-342.
4. Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273-281. (Pubitemid 44374206)
5. Deineko, V., & Woeginger, G. J. (2006). On the robust assignment problem under a fixed number of cost scenarios. Operations Research Letters, 34, 175-179. (Pubitemid 41808605)
6. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
7. Karzanov, A. V. (1987). Maximum matching of given weight in complete and complete bipartite graphs. Cybernetics, 23, 8-13 Translation from Kibernetika, 1, 7-11 (1987) (in Russian).
8. Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications. Dordrecht: Kluwer Academic.
9. Moore, J. M. (1968). A n job, one machine scheduling algorithm for minimizing the number of late jobs. Management Science, 15, 102-109.
10. Mulmuley, K., Vazirani, U. V., & Vazirani, V. V. (1987). Matching is as easy as matrix inversion. Combinatorica, 7, 105-103.
11. Papadimitriou, C. H., & Yannakakis, M. (1982). The complexity of restricted spanning tree problems. Journal of the ACM, 29, 285-309.