References
- AzizogluMWebsterSScheduling a batch processing machine with incompatible job familiesComput Ind Eng20013932533510.1016/S0360-8352(01)00009-2
- BeanJCGenetic algorithms and random keys for sequencing and optimizationORSA J Comput1994615416010.1287/ijoc.6.2.154
- BruckerPGladkyAHoogeveenHKovalyovMYPottsCTautenhahnTVan De VeldeSScheduling a batching machineJ Sched19981315410.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R
- BullnheimerBHartlRFStraussCA new rank based version of the ant system: A computational studyCent Eur J Oper Res Econ199972538
- ChandruVLeeCYUzsoyRMinimizing total completion time on batch processing machinesInt J Prod Res1993312097212110.1080/00207549308956847
- ChandruVLeeC-YUzsoyRMinimizing total completion time on a batch processing machine with job familiesOpns Res Lett199313616510.1016/0167-6377(93)90030-K
- Dobson G and Nambimadom RS (1992). The batch loading and scheduling problem. Research Report, Simon School of Business Administration. University of Rochester, Rochester, NY, USA..
- DobsonGNambimadomRSThe batch loading and scheduling problemOpns Res200149526510.1287/opre.49.1.52.11189
- DorigoMStützleMThe Ant colony optimization meta-heuristic: Algorithms, applications and advancesHandbook of Metaheuristics2003
- DorigoMManiezzoMColorniAAnt system: Optimization by a colony of cooperating agentsIEEE Trans Syst Man Cybernet B199626294110.1109/3477.484436
- HochbaumDSLandyDScheduling semiconductor burn-in operations to minimize total flow timeOpns Res19974587488510.1287/opre.45.6.874
- IkuraYGimpleMEfficient scheduling algorithms for a single batch processing machineOpns Res Lett19865616510.1016/0167-6377(86)90104-5
- JolaiFMinimizing number of tardy jobs on a batch processing machine with incompatible job familiesEur J Opl Res200516218419010.1016/j.ejor.2003.10.011
- KohSGKooPHKimDCHurWSScheduling a single batch processing machine with arbitrary job sizes and incompatible job familiesInt J Prod Econ200598819610.1016/j.ijpe.2004.10.001
- LeeCYUzsoyRMinimizing makespan on a single batch processing machine with dynamic job arrivalsInt J Prod Res19993721923610.1080/002075499192020
- LeeCYUzsoyRMartin-VegaLAEfficient algorithms for scheduling semiconductor burn-in operationsOpl Res19924076477510.1287/opre.40.4.764
- LiCLLeeCYScheduling with agreeable release times and due dates on a batch processing machineEur J Opl Res19979656456910.1016/0377-2217(95)00332-0
- MehtaSVUzsoyRMinimizing total tardiness on a batch processing machine with incompatible job familiesIIE Trans199830165178
- MeloukSDamodaranPChangPYMinimizing makespan for single machine batch processing with non-identical job sizes using simulated annealingInt J Prod Econ20048714114710.1016/S0925-5273(03)00092-6
- UzsoyRA single batch processing machine with non-identical job sizesInt J Prod Res1994321615163510.1080/00207549408957026
- UzsoyRScheduling batch processing machines with incompatible job familiesInt J Prod Res1995332685270810.1080/00207549508904839
- UzsoyRYangYMinimizing total weighted completion time on a single batch processing machineProd Opns Mngt199765773
- WangCUzsoyRA genetic algorithm to minimize maximum lateness on a batch processing machineComput Opns Res2002291621164010.1016/S0305-0548(01)00031-4