Single machine scheduling with slack due dates assignment

References

• Adamopoulos, G. I., and C. P. Pappis. 1996. “Single Machine Scheduling with Flow Allowances.” Journal of the Operational Research Society 47 (10): 1280–1285. doi: 10.1057/jors.1996.155
   Web of Science ®Google Scholar
• Baker, K. R., and G. D. Scudder. 1990. “Sequencing with Earliness and Tardiness Penalties: A Review.” Operations Research 38 (1): 22–36. doi: 10.1287/opre.38.1.22
   Web of Science ®Google Scholar
• Birgin, E. G., and D. P. Ronconi. 2012. “Heuristic Methods for the Single Machine Scheduling Problem with Different Ready Times and a Common Due Date.” Engineering Optimization 44 (10): 1197–1208. doi: 10.1080/0305215X.2011.634409
   Web of Science ®Google Scholar
• Biskup, D. 1999. “Single-Machine Scheduling with Learning Considerations.” European Journal of Operational Research 115 (1): 173–178. doi: 10.1016/S0377-2217(98)00246-X
   Web of Science ®Google Scholar
• Biskup, D. 2008. “A State-of-the-Art Review on Scheduling with Learning Effects.” European Journal of Operational Research 188 (2): 315–329. doi: 10.1016/j.ejor.2007.05.040
   Web of Science ®Google Scholar
• Brucker, P. 2001. Scheduling Algorithms. 3rd ed. Berlin: Springer.
   Google Scholar
• Chung, T.-P., C.-J. Liao, and M. Smith. 2014. “A Canned Food Scheduling Problem with Batch Due Date.” Engineering Optimization 46 (9): 1284–1294. doi: 10.1080/0305215X.2013.827674
   Web of Science ®Google Scholar
• Gawiejnowicz, S. 2008. Time-Dependent Scheduling. Berlin: Springer.
   Google Scholar
• Gordon, V. S., J. M. Proth, and C. B. Chu. 2002a. “A Survey of the State-of-the-Art of Common Due Date Assignment and Scheduling Research.” European Journal of Operational Research 139 (1): 1–25. doi: 10.1016/S0377-2217(01)00181-3
   Web of Science ®Google Scholar
• Gordon, V. S., J. M. Proth, and C. B. Chu. 2002b. “Due Date Assignment and Scheduling: SLK, TWK and Other Due Date Assignment Models.” Production Planning and Control 13 (2): 117–132. doi: 10.1080/09537280110069621
   Web of Science ®Google Scholar
• Gordon, V., V. Strusevich, and A. Dolgui. 2012. “Scheduling with Due Date Assignment under Special Conditions on Job Processing.” Journal of Scheduling 15 (4): 447–456. doi: 10.1007/s10951-011-0240-2
   Web of Science ®Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326. doi: 10.1016/S0167-5060(08)70356-X
   Google Scholar
• Guo, P., W. Cheng, and Y. Wang. 2015. “Parallel Machine Scheduling with Step-Deteriorating Jobs and Setup Times by a Hybrid Discrete Cuckoo Search Algorithm.” Engineering Optimization 47 (11): 1564–1585. doi: 10.1080/0305215X.2014.982634
   Web of Science ®Google Scholar
• Hardy, G. H., J. E. Littlewood, and G. Polya. 1967. Inequalities. 2nd ed. Cambridge, UK: Cambridge University Press.
   Google Scholar
• Hasani, K., S. A. Kravchenko, and F. Werner. 2016. “Minimizing the Makespan for the Two-Machine Scheduling Problem with a Single Server: Two Algorithms for Very Large Instances.” Engineering Optimization 48 (1): 173–183. doi: 10.1080/0305215X.2015.1005083
   Web of Science ®Google Scholar
• Janiak, A., and R. Rudek. 2010. “Scheduling Jobs under an Aging Effect.” Journal of the Operational Research Society 61 (6): 1041–1048. doi: 10.1057/jors.2009.30
   Web of Science ®Google Scholar
• Ji, M., K. Chen, J. Ge, and T. C. E. Cheng. 2014a. “Group Scheduling and Job-Dependent Due Window Assignment Based on a Common Flow Allowance.” Computers & Industrial Engineering 68: 35–41. doi: 10.1016/j.cie.2013.11.017
   Web of Science ®Google Scholar
• Ji, P., G. Li, Y. Huo, and J.-B. Wang. 2014b. “Single-Machine Common Flow Allowance Scheduling with Job-Dependent Aging Effects and a Deteriorating Maintenance Activity.” Optimization Letters 8 (4): 1389–1400. doi: 10.1007/s11590-012-0504-6
   Web of Science ®Google Scholar
• Li, G., M.-L. Luo, W.-J. Zhang, and X.-Y. Wang. 2015. “Single-Machine Due-Window Assignment Scheduling Based on Common Flow Allowance, Learning Effect and Resource Allocation.” International Journal of Production Research 53 (4): 1228–1241. doi: 10.1080/00207543.2014.954057
   Web of Science ®Google Scholar
• Mor, B., and G. Mosheiov. 2012. “Scheduling a Maintenance Activity and Due Window Assignment Based on Common Flow Allowance.” International Journal of Production Economics 135 (1): 222–230. doi: 10.1016/j.ijpe.2011.07.013
   Web of Science ®Google Scholar
• Mosheiov, G., and D. Oron. 2010. “Job Dependent Due-Window Assignment Based on a Common Flow Allowance.” Foundations of Computing and Decision Sciences 35 (3): 185–195.
   Google Scholar
• Mosheiov, G., and J. B. Sidney. 2003. “Scheduling with General Job-Dependent Learning Curves.” European Journal of Operational Research 147 (3): 665–670. doi: 10.1016/S0377-2217(02)00358-2
   Web of Science ®Google Scholar
• Shabtay, D. 2016. “Optimal Restricted Due Date Assignment in Scheduling.” European Journal of Operational Research 252 (1): 79–89. doi: 10.1016/j.ejor.2015.12.043
   Web of Science ®Google Scholar
• Wang, J.-B. 2006. “Single Machine Common Flow Allowance Scheduling with Controllable Processing Times.” Journal of Applied Mathematics and Computing 21 (1–2): 249–257. doi: 10.1007/BF02896403
   Google Scholar
• Wang, X.-Y., and M.-Z. Wang. 2010. “Single Machine Common Flow Allowance Scheduling with a Rate-Modifying Activity.” Computers & Industrial Engineering 59 (4): 898–902. doi: 10.1016/j.cie.2010.08.020
   Web of Science ®Google Scholar
• Wang, J.-B., and M.-Z. Wang. 2014. “Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times.” Asia-Pacific Journal of Operational Research 31 (5): Article ID 1450036. doi: 10.1142/S0217595914500365.
   Web of Science ®Google Scholar
• Wang, D.-J., Y. Yin, J. Xu, W.-H. Wu, S.-R. Cheng, and C.-C. Wu. 2015. “Some Due Date Determination Scheduling Problems with Two Agents on a Single Machine.” International Journal of Production Economics 168: 81–90. doi: 10.1016/j.ijpe.2015.06.018
   Web of Science ®Google Scholar
• Xu, Y., L. Wang, S. Wang, and M. Liu. 2014. “An Effective Hybrid Immune Algorithm for Solving the Distributed Permutation Flow-Shop Scheduling Problem.” Engineering Optimization 46 (9): 1269–1283. doi: 10.1080/0305215X.2013.827673
   Web of Science ®Google Scholar
• Yang, S.-J., C.-J. Hsu, and D.-L. Yang. 2012. “Single-Machine Scheduling and Slack Due-Date Assignment with Aging Effect and Deteriorating Maintenance.” Optimization Letters 6 (8): 1855–1873. doi: 10.1007/s11590-011-0382-3
   Web of Science ®Google Scholar
• Yang, S.-J., H.-T. Lee, and J.-Y. Guo. 2013. “Multiple Common Due Dates Assignment and Scheduling Problems with Resource Allocation and General Position-Dependent Deterioration Effect.” International Journal of Advanced Manufacturing Technology 67 (1): 181–188. doi: 10.1007/s00170-013-4763-x
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, C.-C. Wu, and S.-R. Cheng. 2013a. “Single-Machine Common Due-Date Scheduling with Batch Delivery Costs and Resource-Dependent Processing Times.” International Journal of Production Research 51 (17): 5083–5099. doi: 10.1080/00207543.2013.793424
   Web of Science ®Google Scholar
• Yin, Y., M. Liu, T. C. E. Cheng, C.-C. Wu, and S.-R. Cheng. 2013b. “Four Single-Machine Scheduling Problems Involving Due Date Determination Decisions.” Information Sciences 251: 164–181. doi: 10.1016/j.ins.2013.06.035
   Web of Science ®Google Scholar
• Zhao, C. 2016. “Common Due Date Assignment and Single-Machine Scheduling with Release Times to Minimize the Weighted Number of Tardy Jobs.” Japan Journal of Industrial and Applied Mathematics 33 (1): 239–249. doi: 10.1007/s13160-015-0205-5
   Web of Science ®Google Scholar