Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs

European Journal of Operational Research

Volumn 195, Issue 1, 2009, Pages 89-97

  Wan, Guohua ^a,b   Yen, Benjamin P C ^c  

^a Shanghai   (China)

^b SHENZHEN UNIVERSITY   (China)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Dual criteria; Earliness; Number of tardy jobs; Scheduling; Single machine

Indexed keywords

ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MACHINERY; PORTALS; SCHEDULING; SCHEDULING ALGORITHMS; SOLUTIONS;

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL EXPERIMENTS; DOMINANCE PROPERTIES; DUAL CRITERIA; EARLINESS; JUST IN TIMES; NUMBER OF TARDY JOBS; OPTIMAL SOLUTIONS; SINGLE MACHINE; SINGLE MACHINE SCHEDULING; SINGLE MACHINE SCHEDULING PROBLEMS; SOLUTION QUALITIES; TIME COMPLEXITIES; WEIGHTED EARLINESSES;

PROBLEM SOLVING;

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

References (23)

1. Azizoglu M., Kondakci S., and Koksalan M. Single machine scheduling with maximum earliness and number tardy. Computers and Industrial Engineering 45 (2003) 257-268
2. Azizoglu M., Koksalan M., and Koksalan S.K. Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed. Journal of the Operational Research Society 54 (2003) 661-664
3. Baker K.R., and Scudder G.D. Sequencing with earliness and tardiness penalties: A review. Operations Research 38 (1990) 22-36
4. Cai X., and Zhou S. Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs. Operations Research 47 (1999) 422-437
5. Chand S., and Schneeberger H. Single machine scheduling to minimize weighted earliness subject to no tardy jobs. European Journal of Operations Research 34 (1988) 221-230
6. Chen C.L., and Bulfin R.L. Complexity of single machine multi-criteria scheduling problems. European Journal of Operations Research 70 (1993) 115-125
7. Chen T., Qi X., and Tu F. Single machine scheduling to minimize weighted earliness subject to maximum tardiness. Computers and Operations Research 24 (1997) 147-152
8. Duffuaa S.O., Raouf A., Ben-Daya M., and Makki M. One machine scheduling to minimize mean tardiness with minimum number tardy. Production Planning and Control 8 (1997) 226-230
9. Guner E., Erol S., and Tani K. One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs. International Journal of Production Economics 55 (1998) 213-219
10. Hino C.M., Ronconi D.P., and Mendes A.B. Minimizing earliness and tardiness penalties in a single-machine problem with a common due date. European Journal of Operational Research 160 (2005) 190-201
11. Karasakal E.K., and Koksalan M. A simulated annealing approach to bicriteria scheduling problems on a single machine. Journal of Heuristics 6 (2000) 311-327
12. Kim Y.D., and Yano C.A. Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Research Logistics 41 (1994) 913-933
13. Koksalan M., and Keha A.B. Using genetic algorithms for single-machine bicriteria scheduling problems. European Journal of Operational Research 145 (2003) 543-556
14. Lee C.Y., and Vairaktarakis G.L. Complexity of single machine hierarchical scheduling. In: Pardalos P.M. (Ed). Complexity in Numerical Optimization (1993), World Scientific, Singapore 269-298
15. Mazzini R., and Armentano V.A. A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research 128 (2001) 129-146
16. Nagar A., Haddock J., and Heragu S. Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research 81 (1995) 88-104
17. Pathumnakul S., and Egbelu P.J. Algorithm for minimizing weighted earliness penalty in single-machine problem. European Journal of Operational Research 161 (2005) 780-796
18. Potts C.N., and van Wassenhove L.N. A branch and bound algorithm for the total weighted tardiness problem. Operations Research 33 (1985) 363-377
19. Sidney J.B. An extension of Moore's due date algorithm. In: Elmaghraby S.E. (Ed). Symposium on the Theory of Scheduling and Its Applications (1973), Springer-Verlag, New York 393-398
20. Sridharan V., and Zhou Z. A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems. European Journal of Operational Research 94 (1996) 292-301
21. Vairaktarakis G.L., and Lee C.Y. The single machine scheduling to minimize total tardiness subject to minimum number of tardy jobs. IIE Transactions 27 (1995) 250-256
22. Wan G., and Yen B.P.C. Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research 142 (2002) 271-281
23. Yen B.P.C., and Wan G. Single machine bicriteria scheduling: A survey. Industrial Engineering: Theory Applications and Practice 10 (2003) 222-231