Scheduling with bicriteria: Total flowtime and number of tardy jobs

International Journal of Production Economics

Volumn 53, Issue 1, 1997, Pages 91-99

  Köksalan Kondakci, Suna ^a   Bekiroglu, Tuncay ^a  

^a MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Bicriteria; Scheduling; Single machine

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING;

BICRITERIA METHOD; TARDY JOBS;

PRODUCTION CONTROL;

EID: 0031556681     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(97)00099-6     Document Type: Article

References (14)

1. Azizoglu, M., Kondakci, S., Kirca, Ö., 1991. Bicriteria scheduling problem involving total tardiness and total earliness penalties. Int. J. Prod. Econom. 23, 17-24.
2. Chen, C.L., Bulfin, R.L., 1993. Complexity of single machine, multi-criteria scheduling problems. Eur. J. Oper. Res. 70, 115-125.
3. Emmons, H., 1975. One machine sequencing to minimize mean flow time with minimum tardy. Naval Res. Logist. Quart. 22(3), 585-592.
4. Fisher, M.L., 1976. A dual algorithm for the one-machine scheduling problem. Math. Programming 11, 229-251.
5. Heck, H., Roberts, S., 1972. A note on the extension of a result on scheduling with secondary criteria. Naval Res. Logist. Quart. 19(2), 403-405.
6. Kiran, A.S., Unal, A.T., 1991. A single-machine problem with multiple criteria. Naval Res. Logist. 38, 721-727.
7. Kondakci, S., Azizoglu, M., Köksalan, M., 1996. Note: bicriteria scheduling minimizing flowtime and maximum tardiness. Naval Res. Logist. 43, 929-936.
8. Kyparisis, J., Douligeris, C., 1993. Single machine scheduling and selection to minimize total flowtime with minimum number tardy. J. Oper. Res. Soc. 44(8), 835-838.
9. Lee, C.Y., Vairaktarakis, L., 1993. Complexity of single machine hierarchical scheduling: a survey, Complex. Numer. Optim. 19, 269-298.
10. Lin, K.S., 1983. Hybrid algorithm for sequencing with bicriteria. J. Optim. Theory Appl. 39, 105-124.
11. Moore, J.M., 1968. A n-job, one machine sequencing algorithm for minimizing the number of late jobs. Mgmt. Sci. 15(1), 102-109.
12. Nelson, R.T., Sarin, R.K., Daniels, R.L., 1986. Scheduling with multiple performance measures: the one machine case. Mgmt. Sci. 32(4), 464-479.
13. Sen, T., Gupta, S.K., 1983. A branch and bound procedure to solve a bicriterion scheduling problem. IIE Trans. 15, 84-88.
14. Van Wassenhove, L.N., Gelders, F., 1980. Solving a bicriterion scheduling problem. Eur. J. Oper. Res. 4, 42-48.