References
- BakerKRIntroduction to Sequencing and Scheduling1974New YorkWiley
- BartalYLeonardiSMarchetti-SpaccamelaASgallJStougieLMultiprocessor scheduling with rejectionSIAM Journal on Discrete Mathematics2000131647810.1137/S0895480196300522
- BielenFDemoulinNWaiting time influence on the satisfaction-loyalty relationship in servicesManaging Service Quality: An International Journal200717217419310.1108/09604520710735182
- BorgesAHerterMMCheatJCIt was not that long!: the effects of the in-store TV screen content and consumers emotions on consumer waiting perceptionJournal of Retailing and Consumer Services2015229610610.1016/j.jretconser.2014.10.005
- DantzigGBDiscrete-variable extremum problemsOperations Research19575226627710.1287/opre.5.2.266
- HallNGPosnerMEGenerating experimental data for computational testing with machine scheduling applicationsOperations Research200149685486510.1287/opre.49.6.854.10014
- JaniakAKrysiakTSingle processor scheduling with job values depending on their completion timesJournal of Scheduling200710212913810.1007/s10951-006-0004-6
- KarpRMMillerREThatcherJWReducibility among combinatorial problemsComplexity of Computer Computations1972New YorkPlenum Press85103
- KimESSungCSLeeISScheduling of parallel machines to minimize total completion time subject to s-precedence constraintsComputers & Operations Research200936369871010.1016/j.cor.2007.10.025
- 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
- LinSWYingKCOrder acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardinessApplied Soft Computing20153046247410.1016/j.asoc.2015.01.069
- MartelloSPisingerDTothPNew trends in exact algorithms for the 0–1 knapsack problemEuropean Journal of Operational Research2000123232533210.1016/S0377-2217(99)00260-X
- OuJZhongXWangGAn improved heuristic for parallel machine scheduling with rejectionEuropean Journal of Operational Research2015241365366110.1016/j.ejor.2014.09.028
- PinedoMScheduling: Theory, Algorithms, and Systems20124New York, NJPrentice Hall
- Reisi-NafchiMMoslehiGIntegrating two-agent scheduling and order acceptance problems to maximise total revenue by bounding each agent penalty functionInternational Journal of Services and Operations Management201520335838410.1504/IJSOM.2015.067773
- ShabtayDGasperNKaspiMA survey on offline scheduling with rejectionJournal of Scheduling201316132810.1007/s10951-012-0303-z
- SlotnickSAOrder acceptance and scheduling: a taxonomy and reviewEuropean Journal of Operational Research2011212111110.1016/j.ejor.2010.09.042
- TheveninSZuffereyNWidmerMMetaheuristics for a scheduling problem with rejection and tardiness penaltiesJournal of Scheduling20151818910510.1007/s10951-014-0395-8
- TheveninSZuffereyNWidmerMOrder acceptance and scheduling with earliness and tardiness penaltiesJournal of Heuristics201622684989010.1007/s10732-016-9321-x
- RielACRSemejinJRibbinkDBomert-PetersYWaiting for service at the checkout: negative emotional responses, store image and overall satisfactionJournal of Service Management201223214416910.1108/09564231211226097
- VoutsinasTGPappisCPScheduling jobs with values exponentially deteriorating over timeInternational Journal of Production Economics200279316316910.1016/S0925-5273(02)00110-X
- VoutsinasTGPappisCPA branch and bound algorithm for single machine scheduling with deteriorating values of jobsMathematical and Computer Modelling2010521556110.1016/j.mcm.2009.12.024
- WangJBWangJJJiPScheduling jobs with chain precedence constraints and deteriorating jobsJournal of the Operational Research Society20116291765177010.1057/jors.2010.120
- ZhangXZhouSKosterRVeldeSIncreasing the revenue of self-storage warehouses by optimizing order schedulingEuropean Journal of Operational Research20162521697810.1016/j.ejor.2015.12.044
- ZhongXOuJWangGOrder acceptance and scheduling with machine availability constraintsEuropean Journal of Operational Research2014232343544110.1016/j.ejor.2013.07.032