Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity

References

• Adamopoulos, G. I., and C. P. Pappis. 1995. “The CON Due-date Determination Method with Processing Time-dependent Lateness Penalties.” International Journal of Production Economics 40: 29–36.
   Web of Science ®Google Scholar
• Bartal, Y., S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie. 2000. “Multiprocessor Scheduling with Rejection.” Seventh ACM-SIAM Symposium on Discrete Algorithms 13: 95–103.
   Google Scholar
• Biscup, D., and T. C. E. Cheng. 1999. “Single-machine Scheduling with Controllable Processing Times and Earliness, Tardiness and Completion Time Penalties.” Engineering Optimization 31 (3): 329–336.
   Web of Science ®Google Scholar
• Cao, Z., and X. Yang. 2009. “A PTAS for Parallel Batch Scheduling with Rejection and Dynamic Job Arrivals.” Theoretical Computer Science 410: 2732–2745.
   Web of Science ®Google Scholar
• Cheng, Y., and S. Sun. 2007. “Scheduling Linear Deteriorating Jobs with Rejection on a Single Machine.” European Journal of Operational Research 194: 18–27.
   Web of Science ®Google Scholar
• Engels, D. W., D. R. Karger, S. G. Kolliopoulos, S. Segupta, R. N. Uma, and J. Wein. 2003. “Techniques for Scheduling with Rejection.” Journal of Algorithms 49: 175–191.
   Web of Science ®Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Machine Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Hsieh, P. H., S. J. Yang, and D. L. Yang. 2015. “Decision Support for Unrelated Parallel Machine Scheduling with Discrete Controllable Processing Times Original.” Applied Soft Computing 30: 475–483.
   Web of Science ®Google Scholar
• Hsu, C. J., T. C. E. Cheng, and D. L. Yang. 2011. “Unrelated Parallel-machine Scheduling with Rate-modifying Activities to Minimize the Total Completion Time.” Information Sciences 181: 4799–4803.
   Web of Science ®Google Scholar
• Hoogeveen, H., M. Skutella, and G.J. Woeginer. 2003. “Preemptive Scheduling with Rejection.” Mathematical Programming 3: 287–326.
   Google Scholar
• Lu, L., T. C. E. Cheng, J. Yuan, and L. Zhang. 2009. “Bounded Single-machine Parallel-batch Scheduling with Release Dates and Rejection.” Computers and Operations Research 36: 2748–2751.
   Web of Science ®Google Scholar
• Janiak, A., and M. Y. Kovalyov. 1996. “Single Machine Scheduling Subject to Deadlines and Resource Dependent Processing Times.” European Journal of Operational Research 94: 284–291.
   Web of Science ®Google Scholar
• Jung, J., and T. Kim. 2011. “Scheduling and Resource Binding Algorithm Considering Timing Variation.” IEEE Transactions on Automation Science and Engineering 19: 205–216.
   Google Scholar
• Ji, M., and T. C. E. Cheng. 2010. “Scheduling with Job-dependent Learning Effects and Multiple Rate-modifying Activities.” Information Processing Letters 110 (1): 460–463.
   Web of Science ®Google Scholar
• Lee, C. Y., and V. J. Leon. 2001. “Machine Scheduling with a Rate-modifying Activity.” European Journal of Operational Research 128: 119–128.
   Web of Science ®Google Scholar
• Liu, L., J.-J. Wang, and X.-Y. Wang. 2015. “Due-window Assignment Scheduling with Resource Processing Times to Minimise Total Resource Consumption Cost.” International Journal of Production Research. doi:10.1080/00207543.2015.1056323.
   Google Scholar
• Monma, C. L., A. Schrijver, M. J. Todd, and V. K. Wei. 1990. “Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases and Extensions.” Mathematical Operations Research 15: 736–748.
   Web of Science ®Google Scholar
• Mor, B., and G. Mosheiov. 2014. “Batch Scheduling with a Rate-modifying Maintenance Activity to Minimize Total Flow Time.” International Journal of Production Economics 153: 238–242.
   Web of Science ®Google Scholar
• Mosheiov, G., and A. Sarig. 2009. “Scheduling a Maintenance Activity and Due-window Assignment on a Single Machine.” Computers and Operations Research 36: 2541–2545.
   Web of Science ®Google Scholar
• Ng, C. T., T. C. E. Cheng, and M. Y. Kovalyov. 2004. “Single Machine Batch Scheduling with Jointly Compressible Setup and Processing Times.” European Journal of Operational Research 153: 211–219.
   Web of Science ®Google Scholar
• Nowicki, E., and S. Zdrzazka. 1990. “A Survey of Results for Sequencing Problems with Controllable Processing Times.” Discrete Applied Mathematics 26 (2–3): 271–287.
   Web of Science ®Google Scholar
• Oron, D. 2014. “Scheduling Controllable Processing Time Jobs in a Deteriorating Environment.” Journal of the Operational Research Society 65 (1): 49–56.
   Web of Science ®Google Scholar
• Papadimitriou, C. H., and K. Steiglitz. 1982. Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs: Prentice-Hall.
   Google Scholar
• Rustogi, K., and V. A. Strusevich. 2012. “Single Machine Scheduling with General Positional Deterioration and Rate-modifying Maintenance.” Omega 40: 791–804.
   Web of Science ®Google Scholar
• Rustogi, K., and V. A. Strusevich. 2014. “Combining Time and Position Dependent Effects on a Single Machine Subject to Rate-modifying Activities.” Omega 42: 166–178.
   Web of Science ®Google Scholar
• Sengupta, S. 2003. “Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection.” Lecture Notes in Computer Science 2748: 79–90.
   Google Scholar
• Shabtay, D. 2014. “The Single Machine Serial Batch Scheduling Problem with Rejection to Minimize Total Completion Time and Total Rejection Cost.” European Journal of Operational Research 233: 4–74.
   Web of Science ®Google Scholar
• Shabtay, D., N. Gaspar, and M. Kaspi. 2013. “A Survey on Offline Scheduling with Rejection.” Journal of Scheduling 16 (1): 3–28.
   Web of Science ®Google Scholar
• Shabtay, D., N. Gaspar, and L. Yedidsion. 2012. “A Bicriteria Approach to Scheduling a Single Machine with Job Rejection and Positional Penalties.” Journal of Combinatorial Optimization 23: 395–424.
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2007a. “A Survey of Scheduling with Controllable Processing Times.” Discrete Applied Mathematics 155 (13): 1643–1666.
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2007b. “Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine.” Manufacturing and Service Operations Management 9 (3): 332–350.
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2008. “The Single-machine Earlinesstardiness Scheduling Problem with Due Date Assignment and Resource-dependent Processing Times.” Annals of Operations Research 159 (1): 25–40.
   Web of Science ®Google Scholar
• T’kindt, V., and J. C. Billaut. 2006. Multicriteria Scheduling: Theory, Models and Algorithms. 2nd ed. Berlin: Springer.
   Google Scholar
• Vickson, R. G. 1980. “Two Single-machine Sequencing Problems Involving Controllable Job Processing Times.” IIE Transactions 12 (3): 258–262.
   Web of Science ®Google Scholar
• Wang, J. B. 2006. “Single Machine Common Flow Allowance Scheduling with Controllable Processing Times.” Applied Mathematics and Computing 21 (1–2): 249–257.
   Google Scholar
• Wang, X. Y., and M. Z. Wang. 2010. “Single Machine Common Flow Allowance Scheduling with a Rate-modifying Activity.” Computers and Industrial Engineering 59: 898–902.
   Web of Science ®Google Scholar
• Wang, J. B., and J. J. Wang. 2015. “Research on Scheduling with Job-dependent Learning Effect and Convex Resource Dependent Processing Times.” International Journal of Production Research 53: 5826–5836.
   Web of Science ®Google Scholar
• Yin, Y. Q., T. C. E. Cheng, D. J. Wang , and C. C. Wu. 2015. “Improved Algorithms for Single-machine Serial-batch Scheduling with Rejection to Minimize Total Completion Time and Total Rejection Cost.” IEEE Transactions on Systems, Man, and Cybernetics: Systems doi: 10.1109/TSMC.2015.2505644.
   Google Scholar
• Yin, Y. Q., T. C. E. Cheng, C. C. Wu, and S. R. Cheng. 2013. “Single-machine Common Due-date Scheduling with Batch Delivery Costs and Resource-dependent Processing Times.” International Journal of Production Research 51 (17): 5083–5099.
   Web of Science ®Google Scholar
• Yin, Y. Q., T. C. E. Cheng, C. C. Wu, and S. R. Cheng. 2014a. “Single-machine Due Window Assignment and Scheduling with a Common Flow Allowance and Controllable Job Processing Time.” Journal of the Operational Research Society 65: 1–13.
   Web of Science ®Google Scholar
• Yin, Y. Q., T. C. E. Cheng, C. C. Wu, and S. R. Cheng. 2014b. “Single-machine Batch Delivery Scheduling and Common Due-date Assignment with a Rate-modifying Activity.” International Journal of Production Research 52 (19): 5583–5596.
   Web of Science ®Google Scholar
• Yin, Y. Q., T. C. E. Cheng, D. H. Xu, and C. C. Wu. 2012. “Common Due Date Assignment and Scheduling with a Rate-modifying Activity to Minimize the Due Date, Earliness, Tardiness, Holding, and Batch Delivery Cost.” Computers and Industrial Engineering 63: 223–234.
   Web of Science ®Google Scholar
• Zhang, L., L. Lu, and J. Yuan. 2010. “Single-machine Scheduling under the Job Rejection Constraint.” Theoretical Computer Science 411: 1877–1882.
   Web of Science ®Google Scholar
• Zhao, C. L., and H. Y. Tang. 2012. “A Note to Due-window Assignment and Single Machine Scheduling with Deteriorating Jobs and a Rate-modifying Activity.” Computers and Operations Research 39: 1300–1303.
   Web of Science ®Google Scholar