Minmax earliness-tardiness costs with unit processing time jobs

European Journal of Operational Research

Volumn 130, Issue 3, 2001, Pages 638-652

  Mosheiov, Gur ^a   Shadmon, Michal ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL METHODS; COSTS; ERROR ANALYSIS; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; PROCESS ENGINEERING; SCHEDULING;

DETERMINISTIC SCHEDULING; MINMAX EARLINESS-TARDINESS COSTS;

PRODUCTION CONTROL;

EID: 0034826057     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00432-4     Document Type: Article

References (19)

1. Baker, K., Scudder, G., 1990. Sequencing with earliness and tardiness penalties: A review. Operations Research 38, 22-36.
2. Cheng, T.C.E., Chen, Z.L., 1994. Parallel-machine scheduling problems with earliness and tardiness penalties. Journal of Operational Research Society 45, 685-695.
3. De, P., Ghosh, J.B., Wells, C.E., 1994. Due-date assignment and early/tardy scheduling on identical parallel machines. Naval Research Logistics 41, 17-32.
4. Dyer, M.E., 1984. Linear time algorithms for two- and three-variable linear programs. SIAM Journal of Computing 13, 31-45.
5. Emmons, H., 1987. Scheduling to a common due-date on parallel uniform processors. Naval Research Logistics 34, 803-810.
6. Federgruen, A., Mosheiov, G., 1996. Heuristics for multi-machine scheduling problems with earliness and tardiness costs. Management Science 42, 1544-1555.
7. Federgruen, A., Mosheiov, G., 1997. Heuristics for multi-machine minmax scheduling problems with general earliness and tardiness costs. Naval Research Logistics 44, 287-299.
8. Garey, M.R., Tarjan, R.E., Wilfong, G.T., 1988. One processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13, 330-348.
9. Hall, N., 1986. Single- and multi-processor models for minimizing completion time variance. Naval Research Logistics 33, 49-54.
10. Hall, N., Kubiak, W., Sethi, S., 1991. Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Operations Research 39, 847-856.
11. Hall, N., Posner, M., 1991. Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Operations Research 39, 836-846.
12. Hardy, G.H., Littlewood, J.E., Polya, G., 1967. Inequalities. Cambridge University Press, London.
13. Hsu, W.L., 1984. Approximation algorithms for the assembly line crew scheduling problem. Mathematics of Operations Research 9, 376-383.
14. Kubiak, W., Lou, S., Sethi, S., 1990. Equivalence of mean flow time problems and mean absolute deviation problems. Operations Research Letters 9, 371-374.
15. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D., 1993. Sequencing and scheduling: Algorithms and complexity. In: Graves, S.S., Rinnooy Kan, A.H.G., Zipkin, P. (Eds.), Handbooks in Operations Research and Management Science, vol. 4. North-Holland, New York, pp. 445-522.
16. Li, C.-L., Chen, Z.L., Cheng, T.C.E., 1993. A note on one processor scheduling with asymmetry earliness and tardiness penalties. Operations Research Letters 13, 45-48.
17. Li, C.-L., Cheng, T.C.E., 1994. The parallel machine min-max weighted absolute lateness scheduling problem. Naval Research Logistics 41, 33-46.
18. Mosheiov, G., 1991. Scheduling problems with general earliness and tardiness cost structure: A just in time approach. Ph.D. Dissertation, Columbia University, New York.
19. Sundararaghavan, P., Ahmed, M., 1984. Minimizing the sum of absolute lateness in single-machine and multi-machine scheduling. Naval Research Logistics Quarterly 31, 325-333.