References
- AzizogluMKircaOTardiness minimization on parallel machinesInt J Prod Econ19985516316810.1016/S0925-5273(98)00034-6
- BakerKRIntroduction to Sequencing and Scheduling1974
- CaoDChenMWanGParallel machine selection and job scheduling to minimize machine cost and job tardinessComput Opns Res2005321995201210.1016/j.cor.2004.01.001
- CoffmanEGGareyMRJohnsonDSAn application of bin-packing to multi-processor schedulingSIAM J Comput1978711710.1137/0207001
- ConwayRWMaxwellWLMillerLWTheory of Scheduling1976
- DosaGHeYBetter online algorithms for scheduling with machine costSIAM J Comput2004331035105110.1137/S009753970343395X
- DosaGHeYScheduling with machine cost and rejectionJ Comb Optim20061233735010.1007/s10878-006-9003-y
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
- GharbiAHaouariMAn approximate decomposition algorithm for scheduling on parallel machines with heads and tailsComput Opns Res20073486888310.1016/j.cor.2005.05.012
- GuptaJNDHoJCMinimizing makespan subject to minimum flowtime on two identical parallel machinesComput Opns Res20012870571710.1016/S0305-0548(99)00083-0
- GuptaJNDRuiz-TorresAJA LISTFIT heuristic for minimizing makespan on identical parallel machinesProd Plan Control J2001121283610.1080/09537280150203951
- GuptaJNDRuiz-TorresAJGenerating efficient schedules for identical parallel machines involving flow-time and tardy jobsEur J Opl Res200516767969510.1016/j.ejor.2004.07.015
- GuptaJNDRuiz-TorresAJWebsterSMinimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-timeJ Opl Res Soc2003541263127410.1057/palgrave.jors.2601638
- HoJCChangYLHeuristics for minimizing mean tardiness for m parallel machinesNav Res Log19913836738110.1002/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-I
- HoJCChangYLMinimizing the number of tardy jobs for m parallel machinesEuropean J Opl Res19958434335510.1016/0377-2217(93)E0280-B
- Imreh C (2007). Online scheduling with general machine cost functions. Discrete Appl Math (in press, doi:10.1016/j.dam.2007.10.014).
- JiangYWHeZPreemptive online algorithms for scheduling with machine costActa Inform20054131534010.1007/s00236-004-0156-9
- LeeCYMasseyJDMultiprocessor scheduling: Combining LPT and MULTIFITDiscrete Appl Math19882023324210.1016/0166-218X(88)90079-0
- LeeYHJeongCSMoonCAdvanced planning and scheduling with outsourcing in manufacturing supply chainComput Ind Eng20024335137410.1016/S0360-8352(02)00079-7
- LiaoCJChenCMLinCHMinimizing makespan for two parallel machines with job limit on each availability intervalJ Opl Res Soc20075893894710.1057/palgrave.jors.2602209
- M'HallahRBulfinRLMinimizing the weighted number of tardy jobs on parallel processorsEur J Opl Res200516047148410.1016/j.ejor.2003.06.027
- MokotoffEParallel machine scheduling problems: A surveyAsia Pac J Opl Res200118193242
- Nagy-GyörgyJImrehCOn-line scheduling with machine cost and rejectionDiscrete Appl Math20071552546255410.1016/j.dam.2007.07.004
- SarinSCAhnSBishopABAn improved branching scheme for the branch and bound procedure of scheduling n jobs on m machines to minimize total weighted flow timeInt J Prod Res1988261183119110.1080/00207548808947934