References
- AlidaeeBKochenbergerGAAminiMMGreedy solutions of selection and ordering problemsEuropean Journal of Operational Research2001134120321510.1016/S0377-2217(00)00252-6
- AspvallBFlåmSDVillangerKPSelecting among scheduled projectsOperations Research Letters1995171374010.1016/0167-6377(94)00055-B
- CesaretBOğuzCSibel SalmanFA tabu search algorithm for order acceptance and schedulingComputers and Operations Research20123961197120510.1016/j.cor.2010.09.018
- ChenCYangZTanYHeRDiversity controlling genetic algorithm for order acceptance and scheduling problemMathematical Problems in Engineering20142014111
- EmmonsHOne-machine sequencing to minimize certain functions of job tardinessOperations Research196917470171510.1287/opre.17.4.701
- GhoshJBJob selection in a heavily loaded shopComputers and Operations Research199724214114510.1016/S0305-0548(96)00045-7
- GuptaSKKyparisisJIpCMNote—Project selection and sequencing to maximize net present value of the total returnManagement Science199238575175210.1287/mnsc.38.5.751
- HolthausORajendranCA fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobsJournal of the Operational Research Society200456894795310.1057/palgrave.jors.2601906
- KanetJJNew precedence theorems for one-machine weighted tardinessMathematics of Operation Research200732357958810.1287/moor.1070.0255
- KanetJJBirkemeierCWeighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivityComputers and Operations Research2013401919710.1016/j.cor.2012.05.013
- KyparisisGJGuptaSKIpC-MProject selection with discounted returns and multiple constraintsEuropean Journal of Operational Research1996941879610.1016/0377-2217(95)00156-5
- LewisHFSlotnickSAMulti-period job selection: Planning work loads to maximize profitComputers and Operations Research20022981081109810.1016/S0305-0548(00)00105-2
- LinSWYingKCIncreasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithmJournal of the Operational Research Society201364229331110.1057/jors.2012.47
- MestrySDamodaranPChenCSA branch and price solution approach for order acceptance and capacity planning in make-to-order operationsEuropean Journal of Operational Research2011211348049510.1016/j.ejor.2011.01.002
- Nguyen S, Zhang M and Johnston M (2014). Enhancing branch-and-bound algorithms for order acceptance and scheduling with genetic programming. In M Nicolau, K Krawiec, M Heywood, M Castelli, P García-Sánchez, J Merelo, V Rivas Santos and K Sim (eds), Genetic Programming. Springer: Berlin, pp. 124–136.
- NobibonFTLeusRExact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environmentComputers and Operations Research201138136737810.1016/j.cor.2010.06.003
- OğuzCSibel SalmanFBilgintürk YalçınZOrder acceptance and scheduling decisions in make-to-order systemsInternational Journal of Production Economics2010125120021110.1016/j.ijpe.2010.02.002
- PanYShiLOn the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problemsMathematical Programming, Series A2007110354355910.1007/s10107-006-0013-4
- PottsCNWassenhoveLNA branch and bound algorithm for the total weighted tardiness problemOperations Research198533236337710.1287/opre.33.2.363
- RachamaduguRMVA note on the weighted tardiness problemOperations Research198735345045210.1287/opre.35.3.450
- Rinnooy KanAHGLagewegBJLenstraJKMinimizing total costs in one-machine schedulingOperations Research197523590892710.1287/opre.23.5.908
- RomWOSlotnickSAOrder acceptance using genetic algorithmsComputers and Operations Research20093661758176710.1016/j.cor.2008.04.010
- Selim AkturkMBayram YildirimMA new lower bounding scheme for the total weighted tardiness problemComputers and Operations Research199825426527810.1016/S0305-0548(97)00073-7
- SlotnickSAMortonTESelecting jobs for a heavily loaded shop with lateness penaltiesComputers and Operations Research199623213114010.1016/0305-0548(95)00015-E
- SlotnickSAMortonTEOrder acceptance with weighted tardinessComputers and Operations Research200734103029304210.1016/j.cor.2005.11.012
- TanakaSFujikumaSArakiMAn exact algorithm for single-machine scheduling without machine idle timeJournal of Scheduling200912657559310.1007/s10951-008-0093-5
- WangXXieXChengTCEA modified artificial bee colony algorithm for order acceptance in two-machine flow shopsInternational Journal of Production Economics20131411142310.1016/j.ijpe.2012.06.003
- WangXXieXChengTCEOrder acceptance and scheduling in a two-machine flowshopInternational Journal of Production Economics2013141136637610.1016/j.ijpe.2012.08.020
- WangXHuangGHuXEdwin ChengTCOrder acceptance and scheduling on two identical parallel machinesJournal of the Operational Research Society201566101755176710.1057/jors.2015.3
- XiaoYYZhangRQZhaoQHKakuIPermutation flow shop scheduling with order acceptance and weighted tardinessApplied Mathematics and Computation2012218157911792610.1016/j.amc.2012.01.073