Approximation algorithms for UET scheduling problems with exact delays

Operations Research Letters

Volumn 35, Issue 4, 2007, Pages 533-540

  Ageev, Alexander A ^a   Baburin, Alexei E ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Approximation algorithm; Exact delay; Flow shop; Makespan; Scheduling problem

Indexed keywords

APPROXIMATION ALGORITHMS; OPERATIONS RESEARCH; PROBLEM SOLVING;

EXACT DELAY; FLOW SHOP; MAKESPAN; OBJECTIVE FUNCTION; PROCESSING TIMES;

SCHEDULING;

EID: 34248532006     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2006.09.006     Document Type: Article

References (8)

1. Elshafei M., Sherali H.D., and Smith J.C. Radar pulse interleaving for multi-target tracking. Naval Res. Logist. 51 (2004) 79-94
2. Farina A., and Neri P. Multitarget interleaved tracking for phased array radar. IEEE Proc. Part F: Comm. Radar Signal Process. 127 4 (1980) 312-318
3. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5 (1979) 287-326
4. A. Izquierdo-Fuente, J.R. Casar-Corredera, Optimal radar pulse scheduling using neural networks, in: IEEE International Conference on Neural Networks, vol. 7 1994, pp. 4588-4591.
5. Orman A.J., and Potts C.N. On the complexity of coupled-task scheduling. Discrete Appl. Math. 72 (1997) 141-154
6. Sherali H.D., and Smith J.C. Interleaving two-phased jobs on a single machine. Discrete Optim. 2 (2005) 348-361
7. W. Yu, The two-machine shop problem with delays and the one-machine total tardiness problem, Ph.D. Thesis, Technische Universiteit Eindhoven, 1996.
8. Yu W., Hoogeveen H., and Lenstra J.K. Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. J. Sched. 7 5 (2004) 333-348