References
- Gue KR (2001). Crossdocking: just-in-time for distribution, Graduate School of Business & Public Policy Naval Postgraduate School, Monterey, CA, 8 May 2001.
- Donaldson H, Johnson EL, Ratliff HD and Zhang M (1998). Schedule-driven cross-docking networks. GIT technical report.
- Ratliff HD, Vate JV and Zhang M (1999). Network design for load-driven cross-docking systems. GIT technical report.
- Gue KR (2000). The Best Shape for a Crossdock, INFORMS National Conference, San Antonio, TX, 1 November 2000.
- GueKRThe effects of trailer scheduling on the layout of freight terminalsTransp Sci19993341942810.1287/trsc.33.4.419
- Sierksma G (1996). Linear and Integer Programming: Theory and Practice, 2nd edn. Marcel Dekker: New York, p 230.
- BagchiUChangeYSullivanRMinimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due dateNaval Res Logis Q19873473975110.1002/1520-6750(198710)34:5<739::AID-NAV3220340513>3.0.CO;2-3
- BagchiUSullivanRChangYMinimizing mean absolute deviations of completion times about a common due dateNaval Res Logis Q19863322724010.1002/nav.3800330206
- Hall N, Kubiak W and Sethi S (1989). Deviation of completion times about a restrictive common due date. Working Paper 89-15, College of Business, The Ohio State University, Columbus.
- Baker KR and Chadowitz A (1989). Algorithms for minimizing earliness and tardiness penalties with a common due date. Working Paper 240, Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH.
- SundararaghavanPAhmedMMinimizing the sum of absolute lateness in single machine and multimachine schedulingNaval Res Logis Q19843132533310.1002/nav.3800310214
- SzwarcWThe weighted common due date single machine scheduling problem revisitedComput Opns Res19962325526210.1016/0305-0548(95)O0025-O
- LeeCYDanusaputroSLLinCSMinimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due dateComput Opns Res19911837938910.1016/0305-0548(91)90098-C
- YeungWKOguzCChengTCESingle-machine scheduling with a common due windowComput Opns Res20012815717510.1016/S0305-0548(99)00097-0
- BakerKRScudderGDSequencing with earliness and tardiness penalties: a reviewOpns Res199038223610.1287/opre.38.1.22
- GareyMTarjanRWilfongGOne-processor scheduling with symmetric earliness and tardiness penaltiesMath Opns Res19881333034810.1287/moor.13.2.330
- DavisJSKanetJJSingle-machine scheduling with early and tardy completion costsNaval Res Logis1993408510110.1002/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C
- YanoCAKimY-DAlgorithms for a class of single machine weighted tardiness and earliness problemsEur J Opl Res19915216717810.1016/0377-2217(91)90078-A
- LeeCYChoiJYA genetic algorithm for job sequencing problems with distinct due dates and general early–tardy penalty weightsComput Opns Res19952285786910.1016/0305-0548(94)00073-H
- Ten KateJohn HA, Wijngaard J and Zijm WHM (1995). Minimizing weighted total earliness, total tardiness and setup costs. Research Paper 95A37, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
- MazziniRArmentanoVAA heuristic for single machine scheduling with early and tardy costsEur J Opl Res200112812914610.1016/S0377-2217(99)00345-8
- SridharanVZhouZA decision theory based scheduling procedure for single machine weighted earliness and tardiness problemsEur J Opl Res19969429230110.1016/0377-2217(96)00133-6
- BankJWernerFHeuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penaltiesMath Comput Modell20013336338310.1016/S0895-7177(00)00250-8
- Sivrikaya-SerifoǧluFUlusoyGParallel machine scheduling with earliness and tardiness penaltiesComput Opns Res19992677378710.1016/S0305-0548(98)00090-2
- HeardyRBZhuZMinimizing the sum of job earliness and tardiness in a multimachine systemInt J Prod Res1998361619163210.1080/002075498193192
- RadhakrishnanSVenturaJASimulated annealing for parallel machine scheduling with earlines–tardiness penalties and sequence-dependent set-up timesInt J Prod Res2000382233225210.1080/00207540050028070
- Fang HL, Ross P and Corne D (1993). A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. Proceedings of the Fifth International Conference on Genetic Algorithms, pp 375–382.
- LeeCYChoiJYA genetic algorithm for job sequencing problems with distinct due dates and general early–tardy penalty weightsComput Opns Res19952285786910.1016/0305-0548(94)00073-H
- WebsterSGuptaAJogPDA genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due dateInt J Prod Res1997362543255110.1080/002075498192689
- Li Y, Lim A and Wang F (2003). A genetic algorithm for machine scheduling problem under shared resource constraints. In: Proceedings of the Congress on Evolutionary Computation 2003. Canberra, pp 1080–1085.
- JoslinDEClementsDP‘Squeaky wheel’ optimizationJ Artif intell Res199910353373
- GuZHNemhauserGLSavelsberghMWPLifted flow cover inequalities for mixed 0–1 integer programsMath Programm19998543946710.1007/s101070050067