A bicriteria flowshop scheduling with a learning effect

Applied Mathematical Modelling

Volumn 32, Issue 9, 2008, Pages 1719-1733

  Eren, Tamer ^a   Güner, Ertan ^b  

^a KIRIKKALE UNIVERSITY   (Turkey)

^b GAZI UNIVERSITY   (Turkey)

Author keywords

Bicriteria scheduling; Completion time; Flowshop scheduling; Heuristic methods; Integer programming model; Learning effect; Makespan

Indexed keywords

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; TABU SEARCH; WORK SIMPLIFICATION;

BICRITERIA SCHEDULING; COMPLETION TIME; FLOWSHOP SCHEDULING; LEARNING EFFECT;

SCHEDULING;

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; SCHEDULING; TABU SEARCH; WORK SIMPLIFICATION;

EID: 43949118118     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2007.06.009     Document Type: Article

References (87)

1. Biskup D. Single machine scheduling with learning considerations. Eur. J. Oper. Res. 115 (1999) 173-178
2. Wright T.P. Factors affecting the cost of airplanes. J. Aeronaut. Sci. 3 (1936) 122-128
3. Mosheiov G. Scheduling problems with learning effect. Eur. J. Oper. Res. 132 (2001) 687-693
4. Mosheiov G. Parallel machine scheduling with learning effect. J. Oper. Res. Soc. 52 (2001) 1165-1169
5. Mosheiov G., and Sidney J.B. Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147 (2003) 665-670
6. Lee W.-C., Wu C.-C., and Sung H.-J. A bi-criterion single-machine scheduling problem with learning considerations. Acta Informat. 40 (2004) 303-315
7. T. Eren, E. Güner, A bicriteria scheduling with a learning effect: total completion time and total tardiness, Infor., accepted for publication.
8. Eren T., and Güner E. Minimizing total tardiness in a scheduling problem with a learning effect. Appl. Math. Model. 31 7 (2007) 1351-1361
9. Cheng T.C.E., and Wang G. Single machine scheduling with learning effect considerations. Ann. Oper. Res. 98 (2000) 273-290
10. Lee W.-C. A note on deteriorating jobs and learning in single-machine scheduling problems. Int. J. Bus. Econ. 3 (2004) 83-89
11. Biskup D., and Simons D. Common due date scheduling with autonomous and induced learning. Eur. J. Oper. Res. 159 (2004) 606-616
12. Mosheiov G., and Sidney J.B. Note on scheduling with general learning curves to minimize the number of tardy jobs. J. Oper. Res. Soc. 56 (2005) 110-112
13. Eren T., and Güner E. Flowshop scheduling with general job-dependent learning effect. K.H.O. J. Def. Sci. 2 (2003) 1-11 (in Turkish)
14. Lee W.C., and Wu C.C. Minimizing total completion time in a two-machine flowshop with a learning effect. Int. J. Prod. Econ. 88 (2004) 85-93
15. Eren T., and Güner E. Minimizing mean flow time in a flowshop scheduling with learning effect. J. Fac. Eng. Architect. Gazi Univ. 19 (2004) 119-124 (in Turkish)
16. Johnson S.M. Optimal two-and three-stage production schedules with setup times included. Nav. Res. Log. Quart. 1 (1954) 61-68
17. Kohler W.H., and Steiglitz K. Kohler, exact, approximate and guaranteed accuracy algorithms for the flowshop scheduling problem n / 2 / F / over(F, -). J. Assoc. Comput. Mach. 22 (1975) 106-114
18. Gonzalez T., and Sahni S. Flowshop and jobshop schedules: complexity and approximations. Oper. Res. 26 1 (1978) 36-52
19. Ignall E., and Schrage L. Application of the branch-and-bound technique to some flowshop scheduling problems. Oper. Res. 13 (1965) 400-412
20. Bansal S.P. Minimizing the sum of completion times of n jobs over m machines in a flowshop - a branch and bound approach. AIIE Trans. 9 (1977) 306-311
21. Ahmadi R., and Bagchi U. Improved lower bounds for minimizing the sum of flowtimes of n jobs over m machines in a flow shop. Eur. J. Oper. Res. 44 (1990) 331-336
22. Van de Velde S.L. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangean relaxation. Ann. Oper. Res. 26 (1990) 257-268
23. Karabati{dotless} S., and Kouvelis P. The permutation flow shop problem with sum-of-completion times performance criterion. Nav. Res. Log. 40 (1993) 843-862
24. Della Croce F., Narayan V., and Tadei R. The two-machine total completion time flow shop problem. Eur. J. Oper. Res. 90 (1996) 227-237
25. i scheduling problems. Int. J. Prod. Econ. 44 3 (1996) 225-237
26. Della Croce F., Ghirardi M., and Tadei R. An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. Eur. J. Oper. Res. 139 (2002) 293-301
27. Chung C.S., Flynn J., and Ki{dotless}rca O. A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. Int. J. Prod. Econ. 79 3 (2002) 185-196
28. Akkan C., and Karabati{dotless} S. The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm. Eur. J. Oper. Res. 159 2 (2004) 420-429
29. Campbell G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n-job, m-machine sequencing problem. Manage. Sci. 16 (1970) B630-B637
30. Gupta J.N.D. Heuristic algorithms for multistage flowshop scheduling problem. AIIE Trans. 4 (1972) 11-18
31. Gelders L.F., and Sambandam N. Four simple heuristics for scheduling a flow-shop. Int. J. Prod. Res. 16 (1978) 221-231
32. Miyazaki S., Nishiyama N., and Hashimoto F. An adjacent pairwise approach to the mean flowtime scheduling problem. J. Oper. Res. Soc. Jpn. 21 (1978) 287-299
33. Miyazaki S., and Nishiyama N. Analysis for minimizing weighted mean flow-time in flow-shop scheduling. J. Oper. Res. Soc. Jpn. 23 (1980) 118-132
34. Widmer M., and Hertz A. A new heuristic method for the flowshop sequencing problem. Eur. J. Oper. Res. 41 (1989) 186-193
35. Ho J., and Chang Y. A new heuristic for the n job, m machine flow-shop problem. Eur. J. Oper. Res. 52 (1991) 194-202
36. Rajendran C., and Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flowshop. Eur. J. Oper. Res. 61 (1991) 318-325
37. Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. Int. J. Prod. Econ. 29 (1993) 65-73
38. Vempati V.S., Chen C.L., and Bullington S.F. An effective heuristic for flow-shop problems with total flow time as criterion. Comput. Ind. Eng. 25 (1993) 219-222
39. Ho J.C. Flowshop sequencing with mean flow time objective. Eur. J. Oper. Res. 81 (1995) 571-578
40. i scheduling problems. Eur. J. Oper. Res. 96 (1997) 636-644
41. Rajendran C., and Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. Eur. J. Oper. Res. 103 (1997) 129-138
42. Woo D.S., and Yim H.S. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Comput. Oper. Res. 25 (1998) 175-182
43. Allahverdi A., and Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. Int. J. Prod. Econ. 7 (2002) 71-83
44. Framinan J.M., Leisten R., and Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop. Int. J. Prod. Res. 41 (2003) 121-148
45. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur. J. Oper. Res. 155 2 (2004) 426-438
46. Iyer S.K., and Saxena B. Improved genetic algorithm for the permutation flowshop scheduling problem. Comput. Oper. Res. 31 4 (2004) 593-606
47. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Comput. Oper. Res. 32 5 (2004) 1237-1254
48. Eren T., and Guner E. A literature survey for multicriteria scheduling problems on single and parallel machines. J. Fac. Eng. Architect. Gazi Univ. 17 4 (2002) 37-70 (in Turkish)
49. Eren T., and Guner E. A literature survey for multicriteria flowshop scheduling problems. J. Eng. Sci. Pamukkale Univ. Eng. Coll. 10 1 (2004) 19-30 (in Turkish)
50. Selen W.J., and Hott D.D. A mixed-integer goal-programming formulation of the standard flow-shop scheduling problem. J. Oper. Res. Soc. 37 12 (1986) 1121-1128
51. Wilson J.M. Alternative formulations of a flow-shop scheduling problem. J. Oper. Res. Soc. 40 4 (1989) 395-399
52. Rajendran C. Two-stage flow shop scheduling problem with bicriteria. J. Oper. Res. Soc. 43 (1992) 871-884
53. Gangadharan R., and Rajendran C. A simulated annealing heuristic for scheduling in a flowshop with bicriteria. Comp. Ind. Eng. 27 1-4 (1994) 473-476
54. Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. Int. J. Prod. Res. 32 11 (1994) 2541-2558
55. Rajendran C. Heuristic for scheduling in flowshop with multiple objectives. Eur. J. Oper. Res. 82 (1995) 540-555
56. Nagar A., Heragu S.S., and Haddock J. A branch-and-bound approach for a two-machine flowshop scheduling problem. J. Oper. Res. Soc. 46 (1995) 721-734
57. Neppalli V.R., Chen C.L., and Gupta J.N.D. Genetic algorithms for the two-stage bicriteria flowshop problem. Eur. J. Oper. Res. 95 (1996) 356-373
58. Şerifoǧlu F.S., and Ulusoy G. A bicriteria two-machine permutation flowshop problem. Eur. J. Oper. Res. 107 (1998) 414-430
59. Lee C.E., and Chou F.D. A two-machine flowshop scheduling heuristic with bicriteria objective. Int. J. Ind. Eng. 5 2 (1998) 128-139
60. Sayi{dotless}n S., and Karabati{dotless} S. A bicriteria approach to the two-machine flow shop scheduling problem. Eur. J. Oper. Res. 113 (1999) 435-449
61. Gupta J.N.D., Palanimuthu N., and Chen C.L. Designing and tabu search algorithm for the two-stage flow shop problem with secondary criterion. Prod. Plan. Contr. 10 3 (1999) 251-265
62. max flowshop scheduling problem. Comput. Oper. Res. 26 (1999) 1293-1310
63. Chou F.D., and Lee C.E. Two-machine flowshop scheduling with bicriteria problem. Comput. Ind. Eng. 36 (1999) 549-564
64. Gupta J.N.D., Neppalli V.R., and Werner F. Minimizing total flow time in a two-machine flowshop problem with minimum makespan. Int. J. Prod. Econ. 69 (2001) 323-338
65. T'Kindt V., Gupta J.N.D., and Billaut J.C. A branch-and-bound algorithm to solve a two-machine bicriteria flowshop scheduling problem, operational research peripatetic post-graduate programme (ORP3). Euro, Paris (France) (2001) 149-167
66. T'kindt V., Monmarche N., Tercinet F., and Laügt D. An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur. J. Oper. Res. 142 (2002) 250-257
67. Gupta J.N.D., Hennig K., and Werner F. Local search heuristic for two-stage flow shop problems with secondary criterion. Comput. Oper. Res. 29 (2002) 123-149
68. Allahverdi A., and Aldowaisan T. No-wait flowshop with bicriteria of makespan and total completion time. J. Oper. Res. Soc. 53 (2002) 1004-1015
69. Allahverdi A. The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. Eur. J. Oper. Res. 147 2 (2003) 373-396
70. Framinan J.M., Leisten R., and Ruiz-Usano R. Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization. Eur. J. Oper. Res. 141 (2002) 559-569
71. T'kindt V., Gupta J.N.D., and Billaut J.C. Two-machine flowshop scheduling with a secondary criterion. Comput. Oper. Res. 30 4 (2003) 505-526
72. Yeh W.C., and Allahverdi A. A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan and total flowtime. Int. Trans. Oper. Res. 11 3 (2004) 323-339
73. Daniels R.L., and Chambers R.J. Multiobjective flow-shop scheduling. Nav. Res. Log. 37 (1990) 981-995
74. Murata T., Ishibuchi H., and Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling. Comput. Ind. Eng. 30 4 (1996) 957-968
75. Ishibuchi H., and Murata T. A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Syst. Man Cyb. - Part C: Appl. Rev. 28 3 (1998) 392-403
76. Allahverdi A., and Mittenthal J. Dual criteria scheduling on a two-machine flowshop subject to random breakdowns. Int. Trans. Oper. Res. 5 4 (1998) 317-324
77. Chakravarthy K., and Rajendran C. A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization. Prod. Plan. Contr. 10 7 (1999) 707-714
78. Chang P.C., Hsieh J.C., and Lin S.G. The development of gradual priority weighing approach for the multi-objective flowshop scheduling problem. Int. J. Prod. Econ. 79 3 (2002) 171-183
79. Allahverdi A. A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Comput. Oper. Res. 31 2 (2004) 157-180
80. Allahverdi A., and Aldowaisan T. No-wait flowshops with bicriteria of makespan and maximum lateness. Eur. J. Oper. Res. 152 1 (2004) 132-147
81. Allahverdi A. The tricriteria two-machine flowshop scheduling problem. Int. Trans. Oper. Res. 8 4 (2001) 403-425
82. T. Eren, E. Güner, The tricriteria flowshop scheduling problem, Int. J. Advanced Manuf. Technol., in press, doi:10.1007/s00170-007-0931-1.
83. Eren T. A multicriteria flowshop scheduling problem with setup times. J. Mater. Process. Technol. 186 1-3 (2007) 60-65
84. T. Eren, The solution approaches for multicriteria flowshop scheduling problems, Gazi University Institute of Science and Technology, Ph.D. Thesis, Ankara, Turkey, 2004.
85. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11 (1983) 91-95
86. Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 5 (1986) 533-549
87. Lindo Systems, Inc., Hyper LINDO/PC Release 6.01, Chicago, USA, 1997.