The distributed permutation flowshop scheduling problem

Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110

Baker, 1974

Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 5, 287, 10.1016/S0167-5060(08)70356-X

Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117

Framinan, 2004, A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, Journal of the Operational Research Society, 55, 1243, 10.1057/palgrave.jors.2601784

Hejazi, 2005, Flowshop-scheduling problems with makespan criterion: a review, International Journal of Production Research, 43, 2895, 10.1080/0020754050056417

Ruiz, 2005, A comprehensive review and evaluation of permutation flowshop heuristics, European Journal of Operational Research, 165, 479, 10.1016/j.ejor.2004.04.017

Gupta, 2006, Flowshop scheduling research after five decades, European Journal of Operational Research, 169, 699, 10.1016/j.ejor.2005.02.001

Moon, 2002, Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain, Computers & Industrial Engineering, 43, 331, 10.1016/S0360-8352(02)00078-5

Wang, 1997

Kahn, 2004

Hansen, 2001, Variable neighborhood search: principles and applications, European Journal of Operational Research, 130, 449, 10.1016/S0377-2217(00)00100-4

Palmer, 1965, Sequencing jobs through a multi-stage process in the minimum total time: a quick method of obtaining a near optimum, Operational Research Quarterly, 16, 101, 10.1057/jors.1965.8

Campbell, 1970, Heuristic algorithm for N-job, M-machine sequencing problem, Management Science Series B—Application, 16, B630

Nawaz, 1983, A heuristic algorithm for the m machine, n job flowshop sequencing problem, Omega—International Journal of Management Science, 11, 91, 10.1016/0305-0483(83)90088-9

Framinan, 2003, Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem, International Journal of Production Research, 41, 121, 10.1080/00207540210161650

Dong, 2008, An improved NEH-based heuristic for the permutation flowshop problem, Computers & Operations Research, 35, 3962, 10.1016/j.cor.2007.05.005

Rad, 2009, New high performing heuristics for minimizing makespan in permutation flowshops, Omega—International Journal of Management Science, 37, 331, 10.1016/j.omega.2007.02.002

Kalczynski, 2009, An empirical analysis of the optimality rate of flow shop heuristics, European Journal of Operational Research, 198, 93, 10.1016/j.ejor.2008.08.021

Nowicki, 1996, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, 91, 160, 10.1016/0377-2217(95)00037-2

Grabowski, 2004, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Computers & Operations Research, 31, 1891, 10.1016/S0305-0548(03)00145-X

Osman, 1989, Simulated annealing for permutation flowshop scheduling, Omega—International Journal of Management Science, 17, 551, 10.1016/0305-0483(89)90059-5

Reeves, 1995, A genetic algorithm for flowshop sequencing, Computers & Operations Research, 22, 5, 10.1016/0305-0548(93)E0014-K

Ruiz, 2006, Two new robust genetic algorithms for the flowshop scheduling problem, Omega—International Journal of Management Science, 34, 461, 10.1016/j.omega.2004.12.006

Rajendran, 2004, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research, 155, 426, 10.1016/S0377-2217(02)00908-6

Onwubolu, 2006, Scheduling flow shops using differential evolution algorithm, European Journal of Operational Research, 171, 674, 10.1016/j.ejor.2004.08.043

Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European Journal of Operational Research, 177, 1930, 10.1016/j.ejor.2005.12.024

Ruiz, 2007, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, 177, 2033, 10.1016/j.ejor.2005.12.009

Vallada, 2009, Cooperative metaheuristics for the permutation flowshop scheduling problem, European Journal of Operational Research, 193, 365, 10.1016/j.ejor.2007.11.049

Vallada, 2008, Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics, Computers & Operations Research, 35, 1350, 10.1016/j.cor.2006.08.016

Minella, 2008, A review and evaluation of multiobjective algorithms for the flowshop scheduling problem, INFORMS Journal on Computing, 20, 451, 10.1287/ijoc.1070.0258

Jia, 2002, Web-based multi-functional scheduling system for a distributed manufacturing environment, Concurrent Engineering—Research and Applications, 10, 27, 10.1177/1063293X02010001054

Jia, 2003, A modified genetic algorithm for distributed scheduling problems, Journal of Intelligent Manufacturing, 14, 351, 10.1023/A:1024653810491

Jia, 2007, Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems, Computers & Industrial Engineering, 53, 313, 10.1016/j.cie.2007.06.024

Chan, 2005, An adaptive genetic algorithm with dominated genes for distributed scheduling problems, Expert Systems with Applications, 29, 364, 10.1016/j.eswa.2005.04.009

Chan, 2006, Solving distributed FMS scheduling problems subject to maintenance: genetic algorithms approach, Robotics and Computer-Integrated Manufacturing, 22, 493, 10.1016/j.rcim.2005.11.005

Wang, 2007

Wagner, 1959, An integer linear-programming model for machine scheduling, Naval Research Logistics Quarterly, 6, 131, 10.1002/nav.3800060205

Manne, 1960, On the job-shop scheduling problem, Operations Research, 8, 219, 10.1287/opre.8.2.219

Stafford, 1988, On the development of a mixed-integer linear-programming model for the flowshop sequencing problem, Journal of the Operational Research Society, 39, 1163, 10.1057/jors.1988.193

Wilson, 1989, Alternative formulations of a flowshop scheduling problem, Journal of the Operational Research Society, 40, 395, 10.1057/palgrave.jors.0400410

Pan, 1997, A study of integer programming formulations for scheduling problems, International Journal of Systems Science, 28, 33, 10.1080/00207729708929360

Tseng, 2004, An empirical analysis of integer programming formulations for the permutation flowshop, Omega—International Journal of Management Science, 32, 285, 10.1016/j.omega.2003.12.001

Stafford, 2005, Comparative evaluation of MILP flowshop models, Journal of the Operational Research Society, 56, 88, 10.1057/palgrave.jors.2601805

Tseng, 2008, New MILP models for the permutation flowshop problem, Journal of the Operational Research Society, 59, 1373, 10.1057/palgrave.jors.2602455

Taillard, 1990, Some efficient heuristic methods for the flow-shop sequencing problem, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X

Mladenovic, 1997, Variable neighborhood search, Computers & Operations Research, 24, 1097, 10.1016/S0305-0548(97)00031-2

Stützle T. Applying iterated local search to the permutation flow shop problem. AIDA-98-04, FG Intellektik, TU Darmstadt; 1998.

Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M

Morgan, 1963, Problems in analysis of survey data, and a proposal, Journal of the American Statistical Association, 58, 415, 10.2307/2283276

Biggs, 1991, A method of choosing multiway partitions for classification and decision trees, Journal of Applied Statistics, 18, 49, 10.1080/02664769100000005

Ruiz, 2008, Modeling realistic hybrid flexible flowshop scheduling problems, Computers & Operations Research, 35, 1151, 10.1016/j.cor.2006.07.014

Pan, 2008, A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems, European Journal of Industrial Engineering, 2, 279, 10.1504/EJIE.2008.017687

Pessan, 2008, An unrelated parallel machines model for an industrial production resetting problem, European Journal of Industrial Engineering, 2, 153, 10.1504/EJIE.2008.017349

Hmida, 2007, Climbing depth-bounded discrepancy search for solving hybrid flow shop problems, European Journal of Industrial Engineering, 1, 223, 10.1504/EJIE.2007.014110