References
- SungCSMinJIScheduling with two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due dateEur J Opl Res20011319510610.1016/S0377-2217(99)00447-6
- SidneyJOptimal single machine scheduling with earliness and tardiness penaltiesOpns Res197725626910.1287/opre.25.1.62
- GareyMRTarjanREWilfongGTOne processor scheduling with symmetric earliness and tardiness penaltiesMath Opns Res19881333034810.1287/moor.13.2.330
- LiC-LChenZLChengTCEA note on one processor scheduling with asymmetry earliness and tardiness penaltiesOpns Res Lett199313454810.1016/0167-6377(93)90084-T
- ChengTCEChenZLParallel-machine scheduling problems with earliness and tardiness penaltiesJ Opl Res So19944568569510.1057/jors.1994.106
- LiC-LChengTCEThe parallel machine min–max weighted absolute lateness scheduling problemNaval Res Logist199441334610.1002/1520-6750(199402)41:1<33::AID-NAV3220410104>3.0.CO;2-S
- FedergruenAMosheiovGHeuristics for multi-machine minmax scheduling problems with general earliness and tardiness costsNaval Res Logist19974428729910.1002/(SICI)1520-6750(199704)44:3<287::AID-NAV4>3.0.CO;2-4
- MosheiovGShadmonMMinmax earliness-tardiness costs with unit processing time jobsEur J Opl Res200113063865210.1016/S0377-2217(99)00432-4
- HallNKubiakWSethiSEarliness–tardiness scheduling problems, II: deviation of completion times about a restrictive common due dateOpns Res19913984785610.1287/opre.39.5.847
- HsuWLApproximation algorithms for the assembly line crew scheduling problemMath Opns Res1984937638310.1287/moor.9.3.376
- DyerMELinear time algorithms for two- and three-variable linear programsSIAM J Comput198413314510.1137/0213003