Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method

European Journal of Operational Research

Volumn 88, Issue 2, 1996, Pages 336-344

  Adamopoulos, G I ^a   Pappis, C P ^a  

^a UNIVERSITY OF PIRAEUS   (Greece)

Author keywords

Due date; Scheduling; Slack time; Weighted lateness

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; SCHEDULING;

DUE DATE; PENALTIES; SLACK TIME; WEIGHTED LATENESS;

JOB ANALYSIS;

EID: 0029736011     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00191-X     Document Type: Article

References (21)

1. Adamopoulos, G.I., and Pappis, C.P., "The CON due date determination method with processing time-dependent lateness penalties", International Journal of Production Economics 40 (1995) 29-36.
2. Bagchi, U., Sullivan, R., and Chang, Y., "Minimizing mean squared deviation of completion times about a common due date", Naval Research Logistics Quarterly 33 (1987) 894-906.
3. Baker, K.R., and Scudder, G.D., "On the assignment of optimal due dates", Journal of the Operational Research Society 40 (1989) 93-95.
4. Baker, K.R., and Scudder, G.D., "Sequencing with earliness and tardiness penalties: A review", Operations Research 38 (1990) 22-36.
5. Bector, C.R., Gupta, Y.P., and Gupta, M.C., "Determination of an optimal common due date and optimal sequence in a single machine job shop", International Journal of Production Research 26 (1988) 613-628.
6. Cheng, T.C.E, "A duality approach to optimal due-date determination", Engineering Optimization 9 (1985) 127-130.
7. Cheng, T.C.E, "A heuristic for common due-date assignment and job scheduling on parallel machines", Journal of the Operational Research Society 40/12 (1989) 1129-1135.
8. Cheng, T.C.E, "Optimal constant due-date determination and sequencing of n jobs on a single machine", International Journal of Production Economics 22 (1991) 259-261.
9. Cheng, T.C.E, "Optimal due-date determination and sequencing of n jobs on a single machine", Journal of the Operational Research Society 35 (1984) 433-437.
10. Cheng, T.C.E, and Gupta, M.C., "Survey of scheduling research involving due date determination decisions", European Journal of Operational Research 38 (1989) 156-166.
11. De, P., Ghosh, J.B., and Wells, C.E., "On the multiple-machine extension to a common due-date assignment and scheduling problem", Journal of the Operational Research Society 42/5 (1991) 419-422.
12. Emmons, H., "Scheduling to a common due date on parallel common processors", Naval Research Logistics Quarterly 34 (1987) 803-810.
13. Gupta, Y.P., Bector, C.R., and Gupta, M.C., "Optimal schedule on a single machine using various due date determination methods", Computers in Industry 15 (1990) 245-254.
14. Kanet, J., "Minimizing variation of flow time in single machine systems", Management Science 27 (1981) 1453-1459.
15. Karacapilidis, N.I., and Pappis, C.P., "Optimal algorithms for a class of single machine weighted lateness scheduling problems using due date determination methods", Internal Report DD-2 (1993).
16. Karacapilidis, N.I., and Pappis, C.P., "Optimal due date determination and sequencing of n jobs on a single machine using the SLK method", Computers in Industry 21 (1993) 335-339.
17. Panwalkar, S.S., Smith, M.L., and Seidmann, A., "Common due date assignment to minimize total penalty for the one machine scheduling problem", Operations Research 30/2 (1982) 391-399.
18. Raghavachari, M., "A V-shape property of optimal schedule of jobs about a common due date", European Journal of Operational Research 23 (1986) 401-402.
19. Sarin, S.C., Erel, E., and Steiner, G., "Sequencing jobs on a single machine with a common due date and stochastic processing times", European Journal of Operational Research 51 (1991) 188-198.
20. Sen, T., and Gupta, S.K., "A state-of-art survey of static scheduling research involving due dates", OMEGA 12/1 (1984) 63-76.
21. Vani, V., and Raghavachari, M., "Deterministic and random single machine scheduling with variance minimization", Operations Research 35 (1987) 111-120.