References
- AdamsJBalasEZawackDThe shifting bottleneck procedure for job shop schedulingMngt Sci19883439140110.1287/mnsc.34.3.391
- BalasEMachine scheduling via disjunctive graphs: An implicit enumeration algorithmOpns Res19691794195710.1287/opre.17.6.941
- Beasley J (1990). OR-library: Distributing test problems by electronic mail. J Opl Res Soc 41: 1069–1072. http://people.brunel.ac.uk/~mastjjb/jeb/info.html.
- BlackstoneJHJPhillipsDTHoggGLA state-of-the-art survey of dispatching rules for manufacturing job shop operationsInt J Prod Res198220274510.1080/00207548208947745
- De BontridderKMinimizing total weighted tardiness in a generalized job shopJ Scheduling2005847949610.1007/s10951-005-4779-7
- EilonSChowdhuryIGDue dates in job shop schedulingInt J Prod Res19761422323710.1080/00207547608956596
- GenMTsujimuraYKubotaESolving job shop scheduling problem by genetic algorithmProceedings of the IEEE International Conference on Systems, Man and Cybernetics199415771582
- GloverFTabu search-part iORSA J Comput1989119320010.1287/ijoc.1.3.190
- KanAHKRMachine Scheduling Problems: Classification, Complexity and Computations1976
- LogendranRSonthinenAA tabu search-based approach for scheduling job-shop type flexible manufacturing systemsJ Opl Res Soc19974826427710.1057/palgrave.jors.2600373
- MuthJThompsonGIndustrial Scheduling1963
- NatarajanKMohanasundaramKBabuBSSureshSRajKAADRajendranCPerformance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardinessInt J Adv Manuf Technol20073175176110.1007/s00170-005-0258-8
- NowickiESmutnickiCA fast taboo search algorithm for the job shop problemMngt Sci19964279781310.1287/mnsc.42.6.797
- NowickiESmutnickiCAn advanced tabu search algorithm for the job shop problemJ Scheduling2005814515910.1007/s10951-005-6364-5
- PinedoMScheduling Theory, Algorithms and Systems1995
- PinedoMSingerMA shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shopNav Res Logist19994611710.1002/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#
- ScrichCArmentanoVLagunaMTardiness minimization in a flexible job shop: A tabu search approachJ Intell Manuf20041510311510.1023/B:JIMS.0000010078.30713.e9
- TaillardEDParallel taboo search techniques for the job shop scheduling problemORSA J Comput1994610811710.1287/ijoc.6.2.108
- ThiagarajanSRajendranCScheduling in dynamic assembly job shops with jobs having different holding and tardiness costsInt J Prod Res2003414453448310.1080/00207540310001595864
- ThiagarajanSRajendranCScheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobsComput Ind Eng20054946350310.1016/j.cie.2005.06.005
- Van LaarhovenPJMAartsEHLLenstraJKJob shop scheduling by simulated annealingOpns Res19924011312510.1287/opre.40.1.113
- VepsalainenAPJMortonTEPriority rules for job shops with weighted tardiness costsMngt Sci1987331035104710.1287/mnsc.33.8.1035
- WatsonJPBeckJCHoweAEWhitleyLDProblem difficulty for tabu search in job shop schedulingArtif Intell200314318921710.1016/S0004-3702(02)00363-6
- WatsonJPHoweAEWhitleyLDDeconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problemComput Opns Res2006332623264410.1016/j.cor.2005.07.016