References
- AllahverdiAGuptaJNDAldowaisanTA review of scheduling research involving setup considerationsOmega19992721923910.1016/S0305-0483(98)00042-5
- Amin-NayeriMRMoslehiGOptimal algorithm for single machine sequencing to minimize early/tardy costJ Esteghlal200013548
- BakerKRScudderGDSequencing with earliness and tardiness penalties: A reviewJ Opl Res199038223610.1287/opre.38.1.22
- DasSRGuptaJNDKhumawalaBMA saving index heuristic algorithm flow shop scheduling with sequence dependent set-up timesJ Opl Res Soc1995461365137310.1057/jors.1995.184
- DavisJSKanetJJSingle-machine scheduling with early and tardy completion costsNav Res Logist1993408510110.1002/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C
- FryTDArmstrongRDBlackstoneJHMinimizing weighted absolute deviation in single machine schedulingIIE Trans1987944545010.1080/07408178708975418
- GareyMRTarjanREWilfongGTOne-processor scheduling with symmetric earliness and tardinessMath Opns Res19881333034810.1287/moor.13.2.330
- KanetJJSridharanVScheduling with inserted idle time: Problem taxonomy and literature reviewJ Opl Res2000489911010.1287/opre.48.1.99.12447
- KimYDYanoCAMinimizing mean tardiness and earliness in single-machine scheduling problems with unequal due datesNav Res Logist19944191393310.1002/1520-6750(199412)41:7<913::AID-NAV3220410705>3.0.CO;2-A
- LagunaMA heuristic for production scheduling and inventory control in the presence of sequence-dependent setup timesIIE Trans199931125134
- LiuCChangSScheduling flexible flow shops with sequence-dependent setup effectsIEEE T Robotic Autom200016440841910.1109/70.864235
- LuhPBGouLZhangYNagahoraTTsujiMYonedaKHasegawaTKyoyaYKanoTJob shop scheduling with group dependent setups, finite buffers, and long time horizonAnn Opns Res19987623325910.1023/A:1018948621875
- LuoXChuCA branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardinessEur J Opl Res2007180688110.1016/j.ejor.2005.06.069
- MahnamMMoslehiGA branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release timesEng Optimiz20094152153610.1080/03052150802657290
- PanwalkarSSDudekRASmithMLSequencing research and the industrial scheduling problemSymposium on the Theory of Scheduling and its Applications19732938
- SchallerJA comparison of lower bounds for the single-machine early/tardy problemComput Opns Res2007342279229210.1016/j.cor.2005.09.003
- SchallerJScheduling on a single machine with family setups to minimize total tardinessInt J Prod Econ200710532934410.1016/j.ijpe.2004.10.020
- SchallerJGuptaJNDSingle machine scheduling with family setups to minimize total earliness and tardinessEur J Opl Res20081871050110610.1016/j.ejor.2006.06.061
- SourdFEarliness–tardiness scheduling with setup considerationsComput Opns Res2005321849186510.1016/j.cor.2003.12.002
- SourdFDynasearch for the earliness–tardiness scheduling problem with release dates and setup constraintsOpns Res Lett20063459159810.1016/j.orl.2005.06.005
- Tavakkoli-MoghaddamRMoslehiGVaseiMAzaronAOptimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insertJ Appl Math Comput20051671430145010.1016/j.amc.2004.08.022
- Tavakkoli-MoghaddamRMoslehiGVaseiMAzaronAA branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insertJ Appl Math Comput200617438840810.1016/j.amc.2005.05.011
- Wisner JD and Siferd SP (1995). A survey of LIS manufacturing practices in make-to-order machine shops. Prod Inventory Mngt J : 11–17.
- YanoCAKimYDAlgorithms for a class of single machine weighted tardiness and earliness problemsEur J Opl Res19915216117810.1016/0377-2217(91)90078-A