Concurrent open shop scheduling to minimize the weighted number of tardy jobs

Journal of Scheduling

Volumn 6, Issue 4, 2003, Pages 405-412

  Ng, C T ^a   Cheng, T C E ^a   Yuan, J J ^a,b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b ZHENGZHOU UNIVERSITY   (China)

Author keywords

Concurrent open shop; Due date; In approximability; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHM; CONCURRENT OPEN SHOP; OPERATION PROCESSING TIME;

SCHEDULING;

EID: 3543100349     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024284828374     Document Type: Article

References (6)

1. Cheng, T. C. E. and G. Wang, "Customer order scheduling on multiple facilities," Working Paper No. 11/98-9, Faculty of Business and Information Systems, The Hong Kong Polytechnic University, Hong Kong, 1999.
2. Feige, U., "A threshold of ln n for approximating set cover," J. ACM, 45, 634-652 (1998).
3. Garey, M. R., D. S. Johnson, and L. Stockmeyer, "Some simplified NP-complete graph problem," Theor. Comput. Sci., 1, 237-267 (1976).
4. Garey, M. R., and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-CompIeteness, Freeman, San Francisco, 1979.
5. Papadimitriou, C. H., Computational Complexity, Addison-Wesley, NY, 1994.
6. Raz, R. and S. Safra, "A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP," Proc. 29th ACM Symp. Theory Comput., ACM, 1997, pp. 475-484.