References
- ChengTCEChenZLOguzCOne-machine batching and sequencing of multiple-type itemsComput Opl Res19942171772110.1016/0305-0548(94)90001-9
- ChengTCELinBMTTokerAMakespan minimization in the two-machine flowshop batch scheduling problemNav Res Log20004712814410.1002/(SICI)1520-6750(200003)47:2<128::AID-NAV4>3.0.CO;2-#
- ChengTCEYuanJJYangAFScheduling a batch-processing machine subject to precedence constraints, release dates and identical processing timesComput Opl Res20053284985910.1016/j.cor.2003.09.001
- CongramRKPottsCNVan de VeldeSLAn iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problemINFORMS J Comput2002141526710.1287/ijoc.14.1.52.7712
- EberhartRCKennedyJA new optimizer using particle swarm theoryProceedings of the 6th International Symposium on Micro Machine and Human Science19953943
- KalczynskiPJKamburowskiJOn the NEH heuristic for minimizing the makespan in permutation flow shopsOmega200735536010.1016/j.omega.2005.03.003
- KennedyJEberhartRCParticle swarm optimizationProceedings of IEEE International Conference on Neural Networks199519421948
- LeeCYUzsoyRMartin-VegaLAEfficient algorithms for scheduling semiconductor burn-in operationsOpns Res19924076477510.1287/opre.40.4.764
- LiaoCJTsengCTLuarnPA discrete version of particle swarm optimization for flowshop scheduling problemsComput Opl Res2007343099311110.1016/j.cor.2005.11.017
- LinBMTChengTCEChouASCScheduling in an assembly-type production chain with batch transferOmega20073514315110.1016/j.omega.2005.04.004
- LiuZHYuWCNP-hardness of some special cases of the three-machine flow-shop problemOR Transactions2000414349
- LowCSimulated annealing heuristic for flow shop scheduling problems with unrelated parallel machinesComput Opl Res2005322013202510.1016/j.cor.2004.01.003
- MladenovićNHansenPVariable neighborhood searchComput Opl Res1997241097110010.1016/S0305-0548(97)00031-2
- NawazMEnscoreEEHamIA heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega198311919510.1016/0305-0483(83)90088-9
- NeronEBaptistePGuptaJNDSolving hybrid flow shop problem using energetic reasoning and global operationsOmega20012950151110.1016/S0305-0483(01)00040-8
- NgCTChengTCEYuanJJLiuZHOn the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing timesOpns Res Lett20033132332610.1016/S0167-6377(03)00007-5
- PottsCNKovalyovMYScheduling with batching: A reviewEur J Opl Res200012022824910.1016/S0377-2217(99)00153-8
- RatnaweeraAHalgamugeSKWatsonHCSelf-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficientsIEEE T Evolut Comput2004824025510.1109/TEVC.2004.826071
- SenTSulekJMDileepanPStatic scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art surveyInt J Prod Econ20038311210.1016/S0925-5273(02)00265-7
- SungCSChoungYIHongJMKimYHMinimizing makespan on a single burn-in oven with job families and dynamic job arrivalsComput Opl Res200229995100710.1016/S0305-0548(00)00098-8
- TaillardESome efficient heuristic methods for the flow shop sequencing problemEur J Opl Res199047657410.1016/0377-2217(90)90090-X
- TangLXZhaoYFScheduling a single semi-continuous batching machineOmega200836992100410.1016/j.omega.2007.11.003
- TasgetirenMFLiangYCSevkliMGencyilmazGParticle swarm optimization and differential evolution for the single machine total weighted tardiness problemInt J Prod Res2006444737475410.1080/00207540600620849
- VolgenantATeerhuisEImproved heuristics for the n-job single machine weighted tardiness problemComput Opl Res199926354410.1016/S0305-0548(98)00048-3
- WangCSUzsoyRA genetic algorithm to minimize maximum lateness on a batch processing machineComput Opl Res2002291621164010.1016/S0305-0548(01)00031-4
- WebsterSBakerKRScheduling groups of jobs on a single machineOpns Res19954369270310.1287/opre.43.4.692