References
- MontgomeryDCJohnsonLAOperations Research in Production Planning Scheduling and Inventory Control1974
- JohnsonSMOptimal two and three stage production schedules with setup times includedNav Res Log Q19541616810.1002/nav.3800010110
- PalmerDSSequencing jobs through a multi-stage process in the minimum total time-A quick method of obtaining a near optimumOpl Res Q19651610110610.1057/jors.1965.8
- CampbellHGDudekRASmithMLA heuristic algorithm for the n job, m machine sequencing problemMngt Sci19701663063710.1287/mnsc.16.10.B630
- GuptaJNDA functional heuristic algorithm for the flow-shop scheduling problemOpl Res Q197122394710.1057/jors.1971.18
- DannenbringDAn evaluation of flow shop sequencing heuristicsMngt Sci1977231174118210.1287/mnsc.23.11.1174
- NawazMEnscoreEEHamIA heuristic algorithm for the m machine, n job flow shop sequencing problemOmega198311919510.1016/0305-0483(83)90088-9
- WidmerMHertzAA new heuristic for the flowshop sequencing problemEur J Opl Res19894118619310.1016/0377-2217(89)90383-4
- HoJCChangYLA new heuristic for the n-job, m-machine flow shop problemEur J Opl Res19915219420210.1016/0377-2217(91)90080-F
- HollandJHAdaptation in Natural and Artificial Systems1975
- GrefenstetteJJGopalRRosmaitaBvan GuchtDGenetic algorithms for the travelling salesman problemProceeding of the First International Conference on Genetic Algorithms and Their Applications1985160168
- GoldbergDELingleRAlleles, loci and the travelling salesman problemProceeding of the First International Conference on Genetic Algorithms and their Applications1985154159
- WhitleyDStarkwetherTShanerDThe travelling salesman and sequence scheduling problems: quality solutions using genetic edge recombinationHandbook of Genetic Algorithms1991350372
- DavisLJob shop scheduling with genetic algorithmsProceedings of the First International Conference on Genetic Algorithms1985136140
- ClevelandGASmithSFUsing genetic algorithms to schedule flow shop releasesProceeding of the Third International Conference on Genetic Algorithms1989160169
- BiegalJEDavernJJGenetic algorithms and job-shop schedulingComput Ind Eng199019819110.1016/0360-8352(90)90082-W
- ShiGA genetic algorithm applied to a classic job shop scheduling problemInt J Sys Sci199728253210.1080/00207729708929359
- FalkenauerEBouffoixSA genetic algorithm for job shopProceedings of the 1991 IEEE International Conference on Robotics and Automation1991824829
- ChenCLVempatiVSAljaberNAn application of genetic algorithms for flow shop problemsEur J Opl Res19958038939610.1016/0377-2217(93)E0228-P
- MurataTIshibuchiHTanakaHGenetic algorithms for flowshop scheduling problemsComput Ind Eng1996301061107110.1016/0360-8352(96)00053-8
- ReevesCRA genetic algorithm for flowshop sequencingComput Opns Res19952251310.1016/0305-0548(93)E0014-K
- GoldbergDEGenetic Algorithms in Search, Optimization and Machine Learning1989
- EtilerOTokluBComparisons of Genetic Crossover Operators Used in Scheduling ProblemsJ Inst Sci Technol, Gazi Univ, Turkey2001142132
- ArmentanoVARonconiDPTabu Search for total tardiness minimization in flowshop scheduling problemsComput Opns Res19992621923510.1016/S0305-0548(98)00060-4
- KoulamasCA new constructive heuristic for the flowshop scheduling problemEur J Opl Res1998105667110.1016/S0377-2217(97)00027-1
- RonconiDPA note on constructive heuristic for the flowshop problem with blockingInt J Prod Econ20036110
- FraminanJMLeistenRAn efficient constructive heuristic for flowtime minimization in permutation flow shopsOmega20033131131710.1016/S0305-0483(03)00047-1