Parallel machine scheduling problems considering regular measures of performance and machine cost

Journal of the Operational Research Society

Volumn 61, Issue 5, 2010, Pages 849-857

  Ruiz Torres, A J ^a   Lopez F J ^b   Wojciechowski, P J ^c   Ho, J C ^d  

^a UNIVERSITY OF PUERTO RICO RIO PIEDRAS   (Puerto Rico)

^b MIDDLE GEORGIA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF TEXAS AT EL PASO   (United States)

^d Columbus State University   (United States)

Author keywords

Machine utilization; Multi objective criteria; Parallel machines; Pareto Solutions; Scheduling

Indexed keywords

COST ACCOUNTING; MACHINE COMPONENTS; PARETO PRINCIPLE; SCHEDULING;

INDEPENDENT COMPONENTS; MACHINE UTILIZATION; MEASURE OF PERFORMANCE; MEASURES OF PERFORMANCE; MULTI OBJECTIVE; PARALLEL MACHINE; PARALLEL MACHINE-SCHEDULING PROBLEMS; PARETO SOLUTION;

COST BENEFIT ANALYSIS;

EID: 77950563969     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.38     Document Type: Article

References (24)

1. Azizoglu M and Kirca O (1998). Tardiness minimization on parallel machines. Int J Prod Econ 55: 163-168.
2. Baker KR (1974). Introduction to Sequencing and Scheduling. Wiley: New York, NY.
3. Cao D, Chen M and Wan G (2005). Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Comput Opns Res 32: 1995-2012.
4. Coffman EG, Garey MR and Johnson DS (1978). An application of bin-packing to multi-processor scheduling. SIAM J Comput 7: 1-17.
5. Conway RW, Maxwell WL and Miller LW (1976). Theory of Scheduling. Addison-Wesley: Reading, MA.
6. Dosa G and He Y (2004). Better online algorithms for scheduling with machine cost. SIAM J Comput 33: 1035-1051.
7. Dosa G and He Y (2006). Scheduling with machine cost and rejection. J Comb Optim 12: 337-350.
8. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman: San Francisco, CA.
9. Gharbi A and Haouari M (2007). An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Comput Opns Res 34: 868-883.
10. Gupta JND and Ho JC (2001). Minimizing makespan subject to minimum flowtime on two identical parallel machines. Comput Opns Res 28: 705-717.
11. Gupta JND and Ruiz-Torres AJ (2001). A LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod Plan Control J 12(1): 28-36.
12. Gupta JND and Ruiz-Torres AJ (2005). Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs. Eur J Opl Res 167: 679-695.
13. Gupta JND, Ruiz-Torres AJ and Webster S (2003). Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time. J Opl Res Soc 54: 1263-1274.
14. Ho JC and Chang YL (1991). Heuristics for minimizing mean tardiness for m parallel machines. Nav Res Log 38: 367-381.
15. Ho JC and Chang YL (1995). Minimizing the number of tardy jobs for m parallel machines. European J Opl Res 84: 343-355.
16. Imreh C (2007). Online scheduling with general machine cost functions. Discrete Appl Math (in press, doi:10.1016/j.dam.2007. 10.014).
17. Jiang YW and He Z (2005). Preemptive online algorithms for scheduling with machine cost. Acta Inform 41: 315-340.
18. Lee CY and Massey JD (1988). Multiprocessor scheduling: Combining LPT and MULTIFIT. Discrete Appl Math 20: 233-242.
19. Lee YH, Jeong CS and Moon C (2002). Advanced planning and scheduling with outsourcing in manufacturing supply chain. Comput Ind Eng 43: 351-374.
20. Liao CJ, Chen CM and Lin CH (2007). Minimizing makespan for two parallel machines with job limit on each availability interval. J Opl Res Soc 58: 938-947.
21. M'Hallah R and Bulfin RL (2005). Minimizing the weighted number of tardy jobs on parallel processors. Eur J Opl Res 160: 471-484.
22. Mokotoff E (2001). Parallel machine scheduling problems: A survey. Asia Pac J Opl Res 18: 193-242.
23. Nagy-György J and Imreh C (2007). On-line scheduling with machine cost and rejection. Discrete Appl Math 155: 2546-2554.
24. Sarin SC, Ahn S and Bishop AB (1988). An improved branching scheme for the branch and bound procedure of scheduling n jobs on m machines to minimize total weighted flow time. Int J Prod Res 26: 1183-1191