Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time

Journal of the Operational Research Society

Volumn 54, Issue 12, 2003, Pages 1263-1274

  Gupta, J N D ^c   Ruiz Torres, A J ^a   Webster, S ^b  

^a POLYTECHNIC UNIVERSITY OF PUERTO RICO   (Puerto Rico)

^b SYRACUSE UNIVERSITY   (United States)

^c UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Empirical results; Flow time; Heuristic algorithms; Hierarchical criteria; Lower bounds; Maximum tardiness; Parallel machine scheduling; Tardy jobs

Indexed keywords

ALGORITHMS; CUSTOMER SATISFACTION; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; INVENTORY CONTROL; JOB ANALYSIS; JOB SATISFACTION; OPTIMIZATION; PERFORMANCE; SCHEDULING;

HEURISTIC ALGORITHMS; PARALLEL MACHINE SCHEDULING;

OPERATIONS RESEARCH;

EID: 0346276929     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601638     Document Type: Article

References (15)

1. Chen C and Bulfin RL (1993). Complexity of single machine, multi-criteria scheduling problems. Eur J Opl Res 70: 115-125.
2. Lee C-Y and Vairaktarakis GL (1993). Complexity of single machine hierarchical scheduling: a survey. In: Pardalos PM (ed). Complexity in Numerical Optimization. World Scientific Publishing Company, London, pp 269-298.
3. Nagar A, Haddock J and Heragu S (1995). Multiple and bicriteria scheduling: a literature survey. Eur J Opl Res 81: 88104.
4. T'Kindt V and Billaut J-C (2002). Multicriteria Scheduling: Theory, Models, and Algorithms. Springer-Verlag: Berlin.
5. Rojanasoonthon S, Bard JF and Reddy SD (2003). Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system. J Opl Res Soc 54: 806-821.
6. Gupta JND, Ho JC and Webster S (2000). Bicriteria optimization of makespan and mean flowtime on two identical parallel machines. J Opl Res Soc 51: 1330-1339.
7. Azizoglu M. Koksalan M and Koksalan SK (2003). Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed. J Opl Res Soc 54: 661-664.
8. Cheng TCE and Chen Z-L (1994). Parallel-machine scheduling problems with earliness and tardiness penalties. J Opl Res Soc 45: 685-695.
9. Cheng TCE and Sin CCS (1990). A state of the art review of parallel machine scheduling. Eur J Opl Res 47: 271-292.
10. Chen B, Potts CN and Woeginger GJ (1998). A review of machine scheduling: complexity, algorithms and applications. In: Du D-Z and Du Pardalos PM (eds). Handbook of Combinatorial Optimization. Kluwer, Dordrecht, Netherlands, pp 21-169.
11. Conway RW, Maxwell WL and Miller LW (1976). Theory of Scheduling. Addison-Wesley: Reading, MA.
12. Bruno J, Coffman EG and Sethi R (1974). Scheduling algorithms to minimize mean flow-time. In: Rosenfeld JL (ed). Proceedings of the IFIP Congress, Vol. 74. North-Holland: Amsterdam, pp 504-510.
13. Garey MR and Johnson DS (1975). Complexity results for multiprocessor scheduling under resource constraints. SIAM J Comput 4: 397-411.
14. Brucker P (1995). Scheduling Algorithms. Springer-Verlag: Berlin.
15. Ho JC and Chang YL (1995). Minimizing the number of tardy jobs for m parallel machines. Eur J Opl Res 84: 343-355.