Constructive and composite heuristic solutions to the P//∑Ci scheduling problem

Bansal, 1977, Minimizing the sum of completion times of n-jobs over M-machines in a flowshop – a branch and bound approach, AIIE Transactions, 9, 306, 10.1080/05695557708975160 Boese, 1994, A new adaptive multi-start technique for combinatorial global optimizations, Operations Research Letters, 16, 101, 10.1016/0167-6377(94)90065-5 Gelders, 1978, Four simple heuristics for scheduling a flow-shop, International Journal of Production Research, 16, 221, 10.1080/00207547808930015 Graham, 1979, Optimisation and approximation in deterministic sequencing and scheduling: A survey, Annals of Operations Research, 29, 646 Gupta, 1972, Heuristic algorithms for multistage flowshop scheduling problem, AIIE Transactions, 4, 11, 10.1080/05695557208974823 Ho, 1995, Flowshop sequencing with mean flow time objective, European Journal of Operational Research, 81, 571, 10.1016/0377-2217(93)E0353-Y Ho, 1991, A new heuristic for the n-job, M-machine flow-shop problem, European Journal of Operational Research, 52, 194, 10.1016/0377-2217(91)90080-F Ignall, 1965, Application of the branch and bound technique to some flowshop scheduling problem, Operations Research, 13, 400, 10.1287/opre.13.3.400 Johnson, 1954, Optimal two-and three-stage production schedules with set-up times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110 Lenstra, 1977, Complexity of machine scheduling problems, Annals of Discrete Mathematics, 1, 343, 10.1016/S0167-5060(08)70743-X MacCarthy, 1993, Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling, International Journal of Production Research, 31, 59, 10.1080/00207549308956713 Miyazaki, 1978, An adjacent pairwise approach to the mean flowtime scheduling problem, Journal of Operations Research Society of Japan, 21, 287, 10.15807/jorsj.21.287 Miyazaki, 1980, Analysis for minimizing weighted mean flow-time in flow-shop scheduling, Journal of the Operations Research Society of Japan, 23, 118, 10.15807/jorsj.23.118 Rajendran, 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, International Journal of Production Economics, 29, 65, 10.1016/0925-5273(93)90024-F Rajendran, 1991, A flowshop scheduling algorithm to minimize total flowtime, Journal of the Operations Research Society of Japan, 34, 28, 10.15807/jorsj.34.28 Rajendran, 1992, An efficient heuristic approach to the scheduling of jobs in a flowshop, European Journal of Operational Research, 61, 318, 10.1016/0377-2217(92)90361-C Rajendran, 1997, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, European Journal of Operational Research, 103, 129, 10.1016/S0377-2217(96)00273-1 Reeves, 1999, Landscapes, operators and heuristic search, Annals of Operations Research, 86, 473, 10.1023/A:1018983524911 Reeves, 1998, Genetic algorithms, path relinking and the flowshop sequencing problem, Evolutionary Computation, 6, 45, 10.1162/evco.1998.6.1.45 Smutnicki, 1998, Some results of the worst-case analysis for flowshop scheduling, European Journal of Operational Research, 109, 66, 10.1016/S0377-2217(97)00139-2 Stafford, 1988, On the development of a mixed integer linear programming model for the flowshop sequencing problem, Journal of Operational Research Society, 39, 1163, 10.1057/jors.1988.193 Szwarc, 1983, The flowshop problem with mean completion time criterion, AIIE Transactions, 15, 172 Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M Wang, 1997, Heuristic approaches for n/m/F/∑Ci scheduling problems, European Journal of Operational Research, 96, 636, 10.1016/0377-2217(95)00347-9 Woo, 1998, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Computers and Operations Research, 25, 175, 10.1016/S0305-0548(97)00050-6 Yamada, T., Reeves, C.R., 1998. Solving the Csum permutation flowshop scheduling problem by genetic local search. Proceedings of 1998 IEEE International Conference on Evolutionary Computation, pp. 230–234