References
- AltınelIKÖncanTA new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problemJ Opl Res Soc20055695496110.1057/palgrave.jors.2601916
- AnjosMFChengRCHCurrieCSMMaximizing revenue in the airline industry under one-way pricingJ Opl Res Soc20045553554110.1057/palgrave.jors.2601721
- BarrRGoldenBKellyJResendeMStewartWDesigning and reporting on computational experiments with heuristic methodsJ Heuristics1995193210.1007/BF02430363
- BixbyRESolving real-world linear programs: A decade and more of progressOpns Res20025031510.1287/opre.50.1.3.17780
- BoxMJDaviesDSwannWHNon-linear Optimization Techniques1969
- CampbellHGDudekRASmithMLA heuristic algorithm for the n-job, m-machine sequencing problemMngt Sc197016B63063710.1287/mnsc.16.10.B630
- ChelouahRSiarryPA hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global minimization of multiminima functionsEur J Opl Res200516163665410.1016/j.ejor.2003.08.053
- ClarkeGWrightJScheduling of vehicles from a central depot to a number of delivery pointsOpns Res19641256858110.1287/opre.12.4.568
- CompanysRMétodos heurísticos en la resolución del problema del taller mecánicoEstudios empresariales19665314
- DannenbringDGAn evaluation of flow-shop sequencing heuristicsMngt Sc1977231174118210.1287/mnsc.23.11.1174
- FeoTAResendeMGCGreedy randomized adaptive search proceduresJ Glob Opt1995610913310.1007/BF01096763
- GassSIHarrisCMEncyclopaedia of Operations Research and Management Science1996
- GeigerCDUzsoyRLearning effective dispatching rules for batch processor schedulingInt J Prod Res2008461431145410.1080/00207540600993360
- GeigerCDUzsoyRAytuğHRapid modeling and discovery of priority dispatching rules: An autonomous learning approachJ Sched2006973410.1007/s10951-006-5591-8
- Glover F (1998). A template for scatter search and path relinking. http://leeds-faculty.colorado.edu/glover/SS-PR%20Template.pdf (previous version appeared in Lecture notes in Computer Science 1363), In: Hao JK, Lutton E, Ronald E and Snyders D (eds). pp 13–54, 1997.
- HookerJNTesting heuristics: We have it all wrongJ Heuristics19951334210.1007/BF02430364
- HorstRPardalosPMVan-ThoaiNIntroduction to Global Optimization2000
- JohnsonSMOptimal two- and three-stage production schedules with setup times includedNav Res Log Q19541616810.1002/nav.3800010110
- LagariasJCReedsJAWrightMHWrightPEConvergence properties of the Nelder-Mead simplex method in low dimensionsSIAM J Opt1998911214710.1137/S1052623496303470
- MartinoLPastorRHeuristic procedures for solving the general assembly line balancing problem with setupsInt J Prod Res2010481787180410.1080/00207540802577979
- NelderJAMeadRA simplex method for function minimizationComput J1965730831310.1093/comjnl/7.4.308
- RardinRLUzsoyRExperimental evaluation of heuristic optimization algorithms: A tutorialJ Heuristics2001726130410.1023/A:1011319115230
- Sánchez A (2007). Determinación de secuencias en una máquina multiproducto sujeta a fallos y con costes cuadraticos. PhD thesis, Technical University of Catalonia, Barcelona.
- StorerRHWuSDVaccariRNew search spaces for sequencing problems with application to job shop schedulingMngt Sci1992381495150910.1287/mnsc.38.10.1495
- WatsonJPBarbulescuLHoweAEWhitleyLDAlgorithm performance and problem structure for flow-shop schedulingProceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99)1999