Customer order scheduling to minimize the number of late jobs

European Journal of Operational Research

Volumn 183, Issue 2, 2007, Pages 944-948

  Lin, B M T ^a   Kononov, A V ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Approximability; Approximation algorithm; Multicover problem; Number of late jobs; Order scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; PROBLEM SOLVING;

DEDICATED MACHINE; MULTICOVER PROBLEM; ORDER SCHEDULING;

SCHEDULING;

EID: 34249978133     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.10.021     Document Type: Article

References (11)

1. Ahmadi R.H., and Bagchi U. Scheduling of multi-job customer orders in multi-machine environments (1990), ORSA/TIMS, Philadelphia
2. Ahmadi, R.H., Bagchi, U., 1997. Coordinated scheduling of customer orders, Updated Working Paper, Anderson School at UCLA.
3. Cheng T.C.E., Wang Q., and Yuan J. Customer order scheduling on multiple facilities. Private Communication (2006)
4. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freedman, San Francisco, CA
5. Hall N.G., and Hochbaum D.S. A fast approximation algorithm for the multicovering problem. Discrete Applied Mathematics 15 (1986) 35-40
6. Hochbaum, D.S., 1997. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Dorit Hochbaum (Ed.), Chapter 3 in Approximation Algorithms for NP-hard Problems, PWS Publishing Company, University of California, Berkeley, USA.
7. Lee C.Y., Cheng T.C.E., and Lin B.M.T. Minimizing the makespan in three-machine assembly type flow shop problem. Management Science 39 (1993) 616-625
8. Leung J.Y.-T., Li H., and Pinedo M. Scheduling orders for multiple product types with due date related objectives. European Journal of Operational Research 168 2 (2006) 370-389
9. Ng C.T., Cheng T.C.E., and Yuan J.J. Concurrent open shop scheduling to minimize the weighted number of tardy jobs. Journal of Scheduling 6 (2003) 405-412
10. Roemer T.A. A note on the complexity of the concurrent open shop problem. Journal of Scheduling 9 4 (2006) 389-396
11. Wagneur E., and Sriskandarajah C. Open shops with jobs overlap. European Journal of Operational Research 71 (1993) 366-378