References
- CentenoGArmacostRLParallel machine scheduling with release time and machine eligibility restrictionsComput Indust Eng19973327327610.1016/S0360-8352(97)00091-0
- OvacikIMUzsoyRRolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup timeInt J Prod Res1995333173319210.1080/00207549508904867
- OvacikIMUzsoyRDecomposition methods for scheduling semiconductor testing facilitiesInt J Flex Manuf Syst1996835738810.1007/BF00170018
- ChengTCESinCCSA state-of-the-art review of parallel-machine scheduling researchEur J Opl Res19904727129210.1016/0377-2217(90)90215-W
- HoJCChangYLMinimizing the number of tardy jobs for m parallel machinesEur J Opl Res19958434335510.1016/0377-2217(93)E0280-B
- ChengRGenMParallel machine scheduling problem using memetic algorithmsComput Indust Eng19973376176410.1016/S0360-8352(97)00247-7
- Ruiz-TorresAJEnscoreEEBartonRRSimulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problemComput Indust Eng19973325726010.1016/S0360-8352(97)00087-9
- GabrelVScheduling jobs within time windows on identical parallel machines: new model and algorithmsEur J Opl Res19958332032910.1016/0377-2217(95)00010-N
- ParkMWKimYDSearch heuristics for a parallel machine scheduling problem with ready time and due datesComput Indust Eng19973379379610.1016/S0360-8352(97)00255-6
- LeeYHPinedoMScheduling jobs on parallel machines with sequence-dependent setup timesEur J Opl Res199710046447410.1016/S0377-2217(95)00376-2
- SchuttenJMJLeussinkRAMParallel machine scheduling with release dates, due dates and family setup timesInt J Prod Econ199646-4711912510.1016/0925-5273(95)00086-0
- DessoukyMIMarcellusRLZhangLScheduling identical jobs on uniform parallel machines with random processing timesComput Indust Eng19983510911210.1016/S0360-8352(98)00032-1
- BalakrishnanNKanetJJSridharanSVEarly/tardy scheduling with sequence dependent setups on uniform parallel machinesComput Opns Res19992612714110.1016/S0305-0548(98)00051-3
- PiersmaNDijkWVA local search heuristics for unrelated parallel machine scheduling with efficient neighborhood searchMath Comput Modelling199624111910.1016/0895-7177(96)00150-1
- HerrmannJPorthJMSauerNHeuristics for unrelated machine scheduling with precedence constraintsEur J Opl Res199710252853710.1016/S0377-2217(96)00247-0
- PearnWLChungSHYangMHThe wafer probing scheduling problem (WPSP)J Opl Res Soc20025386487410.1057/palgrave.jors.2601362
- ClarkGWrightJScheduling vehicles from a central depot to a number of delivery pointsOpns Res19641256858010.1287/opre.12.4.568
- GoldenBEvaluate a sequential vehicle routing algorithmAIIE Trans1977920420810.1080/05695557708975144
- ChristofidesNMingozziATothPSandiCCombinatorial Optimization1979
- AltinkemerKGavishBParallel savings based heuristics for the delivery problemOpns Res19913945646910.1287/opre.39.3.456