References
- AllahverdiAAldowaisanTNew heuristic to minimize total completion time in m-machine flowshopsInt J Prod Econ2002117783
- BakerKRIntroduction to Sequencing and Scheduling1974
- BruckerPScheduling Algorithms2001
- CampbellHGDudekRASmithMLA heuristic algorithm for the n-job m-machine sequencing problemMngt Sci197016B630B63710.1287/mnsc.16.10.B630
- Davoud PourHA new heuristic for the n-job, m-machine flow-shop problemProd Plan Control20011264865310.1080/09537280152582995
- FraminanJMLeistenRAn efficient constructive heuristic for flowtime minimisation in permutation flow shopsOmega—Int J Mngt Sci20033131131710.1016/S0305-0483(03)00047-1
- FraminanJMLeistenRRajendranCDifferent initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problemInt J Prod Res20034112114810.1080/00207540210161650
- FraminanJMGuptaJNDLeistenRA review and classification of heuristics for permutation flow-shop scheduling with makespan objectiveJ Opl Res Soc20045511310.1057/palgrave.jors.2601784
- FrenchSSequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop1982
- GareyMRJohnsonDSComputers and Intractability a Guide to the Theory of NP-Completeness1979
- GareyMRJohnsonDSSethiRThe complexity of flowshop and jobshop schedulingMath Opns Res1976111712910.1287/moor.1.2.117
- GonzalezTSahniSFlowshop and jobshop schedules: Complexity and approximationOpns Res197826365210.1287/opre.26.1.36
- JohnsonSMOptimal two-and-three-stage production schedules with set-up times includedNav Res Log19541616810.1002/nav.3800010110
- KalczynskiPJKamburowskiJOn the NEH heuristic for minimizing the makespan in permutation flow shopsOmega—Int J Mngt Sci200735536010.1016/j.omega.2005.03.003
- KlirGJYuanBFuzzy Sets and Fuzzy Logic: Theory and Applications1995
- NaganoMSMoccellinJVA high quality solution constructive heuristic for flow shop sequencingJ Opl Res Soc2002531374137910.1057/palgrave.jors.2601466
- NawazMEnscoreEEJrHamIA heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega—Int J Mngt Sci198311919510.1016/0305-0483(83)90088-9
- PageESAn approach to the scheduling of jobs on machinesJ R Stat Soc196123484492
- PalmerDSSequencing jobs through a multi-stage process in the minimum total time—A quick method of obtaining a near optimumOpns Res Quart19651610110710.1057/jors.1965.8
- PinedoMScheduling: Theory, Algorithms, and Systems2002
- RajendranCHeuristic algorithm for scheduling in a flowshop to minimize total flowtimeInt J Prod Econ199329657310.1016/0925-5273(93)90024-F
- RajendranCHeuristics for scheduling in flowshop with multiple objectivesEur J Opl Res19958254055510.1016/0377-2217(93)E0212-G
- RajendranCZieglerHAnt-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobsEur J Opl Res200415542643810.1016/S0377-2217(02)00908-6
- RuizRMarotoCA comprehensive review and evaluation of permutation flowshop heuristicsEur J Opl Res200516547949410.1016/j.ejor.2004.04.017
- Sheibani K (2005). Fuzzy greedy evaluation in search, optimisation, and learning. PhD thesis, London Metropolitan University, London, UK.
- SheibaniKFuzzy Greedy Search in Combinatorial Optimisation2008
- StaffordEFTsengFTGuptaJNDComparative evaluation of MILP flowshop modelsJ Opl Res Soc2005568810110.1057/palgrave.jors.2601805
- SuleDRIndustrial Scheduling1997
- TaillardESome efficient heuristic methods for the flow shop sequencing problemEur J Opl Res199047657410.1016/0377-2217(90)90090-X
- TaillardEBenchmarks for basic scheduling problemsEur J Opl Res19936427828510.1016/0377-2217(93)90182-M
- WooDSYimDSA heuristic algorithm for mean flowtime objective in flowshop schedulingComput Opl Res19982517518210.1016/S0305-0548(97)00050-6
- ZhengDZWangLAn effective hybrid heuristic for flow shop schedulingInt J Adv Manuf Technol200321384410.1007/s001700300005