Minmax common due-window assignment and scheduling on a single machine with two competing agents

References

• Adamopoulos, G. I., & Pappis, C. P. (1996). Single machine scheduling with flow allowances. Journal of the Operational Research Society, 47(10), 1280–1285.
   Web of Science ®Google Scholar
• Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52(2), 229–242.
   Web of Science ®Google Scholar
• Agnetis, A., Billaut, J. C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling. Berlin: Springer.
   Google Scholar
• Baker, K. R., & Smith, J. C. (2003). A multiple criterion model for machine scheduling. Journal of scheduling, 6(1), 7–16.
   Web of Science ®Google Scholar
• Dover, O., & Shabtay, D. (2015). Single machine scheduling with two competing agents, arbitrary release dates and unit processing times. Annals of Operations Research, 238(1), 145–178.
   Google Scholar
• Fan, B. Q., & Cheng, T. C. E. (2016). Two-agent scheduling in a flowshop. European Journal of Operational Research, 252(2), 376–384.
   Web of Science ®Google Scholar
• Gerstl, E., & Mosheiov, G. (2014). Single machine Just-in-Time scheduling problems with two competing agents. Naval Research Logistics, 61(1), 1–16.
   Google Scholar
• Gordon, V. S., Proth, J. M., & Chu, C. (2002). A survey of the state-of-theart of common due date assignment and scheduling research. European Journal of Operational Research, 139(1), 1–25.
   Web of Science ®Google Scholar
• Janiak, A., Janiak, W. A., Krysiak, T., & Kwiatkowski, T. (2015). A survey on scheduling problems with due windows. European Journal of Operational Research, 242(2), 347–357.
   Web of Science ®Google Scholar
• Lawler, E. L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19(5), 544–546.
   Web of Science ®Google Scholar
• Li, S. L., Chen, R. X., & Feng, Q. (2015). Scheduling two job families on a single machine with two competing agents. Journal of Combinatorial Optimization, 32(3), 784–799.
   Google Scholar
• Lu, Y.-Y., Li, G., Wu, Y.-B., & Ji, P. (2014). Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optimization Letters, 8(1), 113–127.
   Web of Science ®Google Scholar
• Mor, B. & Mosheiov, G. (2014). Polynomial time solutions for scheduling problems on proportionate flow shop with two competing agents. Journal of the Operational Research Society, 65(1), 151–157.
   Web of Science ®Google Scholar
• Mor, B. & Mosheiov, G. (2016). Minsum and Minmax scheduling on a proportionate flowshop with common flow-allowance. European Journal of Operational Research, 254(2), 360–370.
   Web of Science ®Google Scholar
• Mosheiov, G. & Sarig, A. (2009). Due-date assignment on uniform machines. European Journal of Operational Research, 193(1), 49–58.
   Google Scholar
• Panwalkar, S. S., Smith, M. L., & Seidmann, A. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30(2), 391–399.
   Web of Science ®Google Scholar
• Seidmann, A., Panwalkar, S. S., & Smith, M. L. (1981). Optimal assignment of due-dates for a single processor scheduling problem. International Journal of Production Research, 19(4), 393–399.
   Web of Science ®Google Scholar
• Shiau, Y.-R., Lee, W.-C., Kung, Y.-S., & Wang, J.-Y. (2016). A lower bound for minimizing the total completion time of a three-agent scheduling problem. Information Sciences, 340–341, 305–320.
   Google Scholar
• Sun, L.-H., Cuidc, K., Chenec, J.-H., & Wang, J. (2015). Due date assignment and convex resource allocation scheduling with variable job processing times. International Journal of Production Research, 54(12), 3551–3560.
   Google Scholar
• Wang, D.-J., Yin, Y., Xu, J., Wu, W.-H., Cheng, S.-R., & Wu, C.-C. (2015). Some due date determination scheduling problems with two agents on a single machine. International Journal of Production Economics, 168, 81–90.
   Web of Science ®Google Scholar
• Wang, D.-J., Yin, Y., Cheng, S.-R., Cheng, T. C. E., & Wu, C.-C. (2015). Due date assignment and scheduling on a single machine with two competing agents. International Journal of Production Research, 54(4), 1152–1169.
   Web of Science ®Google Scholar
• Wu, Y.-B., Wan, L., & Wang, X.-Y. (2015). Study on due-window assignment scheduling based on common flow allowance. International Journal of Production Economics, 165, 155–157.
   Web of Science ®Google Scholar
• Yang, D.-L., Lai, C.-J., & Yang, S.-J. (2015). Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. International Journal of Production Economics, 150, 96–103.
   Google Scholar
• Yue, Q. & Wan, G. (2016). Single machine SLK/DIF due window assignment problem with job-dependent linear deterioration effects. Journal of the Operational Research Society, 67(6), 872–883.
   Web of Science ®Google Scholar
• Zhao, C., Hsu, C.-J., Wu, W.-H., Cheng, S.-R., & Wu, C.-C. (2016). Note on a unified approach to the single-machine scheduling problem with a deterioration effect and convex resource allocation. Journal of Manufacturing Systems, 38, 134–140.
   Web of Science ®Google Scholar