References
- Ben-TalANemirovskiARobust solutions of linear programming problems contaminated with uncertain dataMathematical Programming200088341142410.1007/PL00011380
- BertsimasDSimMThe price of robustnessOperations Research2004521355310.1287/opre.1030.0065
- DanielsRLKouvelisPRobust scheduling to hedge against processing time uncertainty in single-stage productionManagement Science199541236337610.1287/mnsc.41.2.363
- JacobsLWBruscoMJA local-search heuristic for large set-covering problemsNaval Research Logistics19954271129114010.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M
- JanakSLLinXFloudasCAA new robust optimization approach for scheduling under uncertainty: II. Uncertainty with known probability distributionComputers and Chemical Engineering200731317119510.1016/j.compchemeng.2006.05.035
- JohnsonSMOptimal two-and three-stage production schedules with setup times includedNaval Research Logistics Quarterly195411616810.1002/nav.3800010110
- KasperskiAMinimizing maximal regret in the single machine sequencing problem with maximum lateness criterionOperations Research Letters200533443143610.1016/j.orl.2004.07.004
- KouvelisPYuGRobust Discrete Optimization and Its Applications1997
- KouvelisPDanielsCLVairaktarakisERobust scheduling of a two-machine flow shop with uncertain processing timesIIE Transactions2000325421432
- LiZIerapetritouMGRobust optimization for process scheduling under uncertaintyIndustrial & Engineering Chemistry Research200847124148415710.1021/ie071431u
- LinSWYingKCApplying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problemsInternational Journal of Production Research20094751411142410.1080/00207540701484939
- LinSWYingKCMinimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithmComputers and Operations Research20134061625164710.1016/j.cor.2011.08.009
- LinSWGuptaJNDYingKCLeeZJUsing simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup timesInternational Journal of Production Research200947123205321710.1080/00207540701813210
- LinSWYingKCLuCCGuptaJNDApplying multi-start simulated annealing to schedule a flowline manufacturing cell with sequence dependent family setup timesInternational Journal of Production Economics2011130224625410.1016/j.ijpe.2011.01.004
- LinXJanakSLFloudasCAA new robust optimization approach for scheduling under uncertainty: I. Bounded uncertaintyComputers and Chemical Engineering2004286–71069108510.1016/j.compchemeng.2003.09.020
- LuCCLinSWYingKCRobust scheduling on a single machine to minimize total flow timeComputers and Operations Research20123971682169110.1016/j.cor.2011.10.003
- LuCCLinSWYingKCMinimizing worst-case regret of makespan on a single machine with uncertain processing and setup timesApplied Soft Computing201423114415110.1016/j.asoc.2014.06.006
- LuCCYingKCLinSWRobust single machine scheduling for minimizing total flow time in the presence of uncertain processing timesComputer and Industrial Engineering201474110211010.1016/j.cie.2014.04.013
- MatsveichukNMSotskovYNEgorovaNGLaiTCScheduling execution for two-machine flow-shop with interval processing timesMathematical and Computer Modelling2009495–6991101110.1016/j.mcm.2008.02.004
- MetropolisNRosenbluthARosenbluthMTellerATellerEEquation of state calculations by fast computing machinesJournal of Chemical Physics19532161087109210.1063/1.1699114
- MontgomeryDDesign and Analysis of Experiments2007
- MulveyJMVanderbeiRJRobust optimization of large-scale systemsOperations Research199543226428110.1287/opre.43.2.264
- PetrovicSSongXA new approach to two-machine flow shop problem with uncertain processing timesOptimization Engineering20067332934210.1007/s11081-006-9975-6
- SabuncuogluIGorenSHedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability researchInternational Journal of Computer Integrated Manufacturing200922213815710.1080/09511920802209033
- SoysterALConvex programming with set-inclusive constraints and applications to inexact linear programmingOperations Research19732151154115710.1287/opre.21.5.1154
- Stützle TG (1998). Local search algorithms for combinatorial problems: Analysis, improvements, and new applications. PhD thesis, Darmstadt University of Technology, Department of Computer Science.
- SumanBKumarPA survey of simulated annealing as a tool for single and multiobjective optimizationJournal of the Operational Research Society200657181143116010.1057/palgrave.jors.2602068
- YangJYuGOn the robust single machine scheduling problemJournal of Combinatorial Optimization200261173310.1023/A:1013333232691
- YingKCSolving non-permutation flowshop scheduling problems by an effective iterated greedy heuristicInternational Journal of Advanced Manufacturing Technology200838334835410.1007/s00170-007-1104-y
- YingKCAn iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasksJournal of the Operational Research Society200960681081710.1057/palgrave.jors.2602625
- YingKCScheduling identical wafer sorting parallel machines with sequence-dependent setup times using an iterated greedy heuristicInternational Journal of Production Research201250102710271910.1080/00207543.2011.588617
- YingKCChengHMDynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristicExpert Systems with Applications20103742848285210.1016/j.eswa.2009.09.006
- YingKCGuptaJNDLinSWLeeZJPermutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setupsInternational Journal of Production Research20104882169218410.1080/00207540802534707
- YingKCLinSWHuangCYSequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristicExpert Systems with Applications20093637087709210.1016/j.eswa.2008.08.033