A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem

Information Sciences

Volumn 179, Issue 17, 2009, Pages 2997-3017

  Xu, Jiuping ^a   Zhou, Xiaoyang ^a  

^a SICHUAN UNIVERSITY   (China)

Author keywords

Birandom simulation based genetic algorithm; Birandom variable; Flow shop scheduling problem; Multi objective expected value decision making model

Indexed keywords

BIRANDOM SIMULATION-BASED GENETIC ALGORITHM; BIRANDOM VARIABLE; CONSTRAINT FUNCTIONS; DECISION MAKING MODELS; DETERMINISTIC MODELS; EXPECTED VALUE MODEL; EXPECTED VALUE OPERATORS; EXPECTED VALUES; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; GOAL MODELS; MULTI OBJECTIVE; MULTI-OBJECTIVE EXPECTED VALUE DECISION-MAKING MODEL; MULTIOBJECTIVE DECISION; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; UNCERTAIN MODELS;

CHANNEL CAPACITY; FLOW SIMULATION; GENETIC ALGORITHMS; MACHINE SHOP PRACTICE; MULTIOBJECTIVE OPTIMIZATION; SIMULATORS;

DECISION MAKING;

EID: 67549098078     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.04.009     Document Type: Article

References (46)

1. Edwin Cheng T.C., Wu C.-C., and Lee W.-C. Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Information Sciences 178 (2008) 2476-2487
2. Burnetas A.N., and Katahakis M.N. On sequencing two types of tasks on a single processer under incomplete information. Probability in the Engineering and Information Sciences 7 (1993) 85-119
3. Rieder U., and Weishaupt J. Customer scheduling with incomplete information. Probability in the Engineering and Information Sciences 9 (1995) 269-284
4. Allouche M.A., and Aouni B. Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions. European Journal of Operational Research 192 (2009) 460-467
5. Bulfin R.L., and Hallah M. Minimizing the weighted number of tardy jobs on a two-machine flow shop. Computer and Operations Research 30 (2003) 1887-1900
6. Bhatia G. Optimality and mixed saddle point criteria in multi-objective optimization. Journal of Mathematical Analysis and Applications 342 (2008) 135-145
7. Choi B., Yoon S., and Chung S. Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research 176 (2007) 964-974
8. De P., Ghosh J., and Wells C. Heuristic estimation of the efficient frontier for a Bicriteria scheduling problem. Decision Sciences 23 (1992) 596-608
9. Fonseca C., and Fleming P. An overview of evolutionary algorithms in multi-objective optimization. Evolutionary Computation 3 (1995) 1-16
10. Fogel D.B. Evolution Computation: Toward a New Philosophy of Machine Intelligence (1995), IEEE Press, Piscataway
11. Gupta J.N.D., and Stafford E.F. Flow shop scheduling research after five decades. European Journal of Operational Research 169 (2006) 699-711
12. Grabowski J., and Pempera J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computer and Operations Research 32 (2005) 2197-2212
13. Runge N., and Sourd F. A new model for the preemptive earliness Ctardiness scheduling problem. Computers and Operations Research 36 (2009) 2242-2249
14. Gen M., and Cheng R. Genetic Algorithms and Engineering Design (1997), Wiley, New York
15. Gen M., and Cheng R. Genetic Algorithms and Engineering Optimization (2000), Wiley, New York
16. Gangadhran R., and Rajendran C. A simulated annealing heuristic for scheduling in a flow shop with Bicriteria. Computers and Industrial Engineering 27 (1994) 473-476
17. Hwang C., and Yoon K. Multiple Attribute Decision Making: Methods and Applications (1981), Springer-Verlag, Berlin
18. Holland H. Adaption in Natural and Artificial Systems (1975), University of Michigan, Ann Arbor
19. Hong T., and Wang T. Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains. Information Sciences 129 (2000) 227-237
20. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
21. Kall P., and Wallanc S.W. Stochastic Programming (1997), Springer-Verlag, New York
22. Kondakci S.K., Azizoglu M., and Köksalan M. Bicriteria scheduling for minimizing flow time and maximum tardiness. Naval Research Logistics 43 (1996) 929-936
23. Liu B. Theory and Practice of Uncertain Programming (2002), Physics-Verlag, Heidelberg
24. Liu B. Uncertain Theory: An Introduction to its Axiomatic Foundations (2004), Springer-Verlag, Berlin
25. Pawlak Z. Rough sets. International Journal of Information and Computer Science 11 (1982) 341-356
26. Zadeh L.A. Fuzzy sets. Information and control 8 (1965) 338-353
27. Li J., Xu J., and Gen M. A class of multi-objective linear programming model with fuzzy random coefficients. Mathematical and Computer Modelling 44 (2006) 1097-1113
28. Tavakkoli-Moghaddam R., Rahimi-Vahed A., and Mirzaei A.H. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Information Sciences 177 (2007) 5072-5090
29. Lemple R., and Moran S. The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Computer Networks 33 (2000) 387-401
30. Murata T., Ishibuchi H., and Tanaka H. Multi-objective genetic algorithm and its applications to flow shop scheduling. Computer and Industrial Engineering 30 (1996) 957-968
31. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs (1994), Springer, New York
32. Pan J.C.H., Chen J.S., and Chao C.M. Minimizing tardiness in a two-machine flow-shop. Computer and Operations Research 29 (2002) 869-885
33. Peng J., and Liu B. Birandom variables and birandom programming. Computers and Industrial Engineering 53 (2007) 433-453
34. V. Pareto, Manuale di Economica Polittica, Societa Editrice Libraia, Milan, Italy, 1906.
35. Reisman A., Kumar A., and Motwani J. Flow shop scheduling/sequencing research: a statistical review of the literature, 1952-1994. IEEE Transactions on Engineering Management 44 (1997) 316-329
36. Shaukat A.B. Branch and bound algorithm for the flow shop with multiple processors. European Journal of Operational Research 51 (1991) 88-99
37. Wittrock R. An adaptable scheduling algorithm for flexible flow lines. Operations Research 36 (1998) 445-453
38. Stadler W. A survey of multicriteria optimization or the vector maximization problem: I. 1776-1960. Journal of Optimization Theory and Applications 69 (1979) 1-52
39. W. Stadler, A comprehensive bibliography on multicriteria decision making and related areas, Technical report, University of California-Berkeley, 1981.
40. Wang J., Ng C., Cheng T., and Liu L. Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Applied Mathematics and Computation 180 (2006) 185-193
41. Xu J., and Liu Y. Multi-objective decision making model under fuzzy random environment and its application to inventory problems. Information Sciences 178 (2008) 2899-2914
42. Zhou G., Min H., and Gen M. The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach. Computers and Industrial Engineering 43 (2002) 251-261
43. Loukil T., Teghem J., and Tuyttens D. Solving multiobjective production scheduling problems using metaheuristics. European Journal of Operations Research 161 (2005) 42-61
44. Heller J. Some numerical experiments for an M × J flow shop and its decision theoretical aspects. Operations Research 8 (1960) 178-184
45. Carlier J. Ordonnancements a contraintes disjonctives. R.A.I.R.O., Recherche Operationelle/Operations Research 12 (1978) 333-351
46. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 (1995) 5-13