Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window

References

• Anger, F. D., C. Y. Lee, and L. A. Martin-Vega. 1986. “Single Machine Scheduling with Tight Windows.” Research Report. 86–16. Gainesville: University of Florida.
   Google Scholar
• Biskup, D., and M. Feldmann. 2001. “Benchmarks for Scheduling on a Single Machine against Restrictive and Unrestrictive Common Due Dates.” Computers & Operations Research 28 (8): 787–801.10.1016/S0305-0548(00)00008-3
   Web of Science ®Google Scholar
• Biskup, D., and M. Feldmann. 2005. “On Scheduling around Large Restrictive Common Due Windows.” European Journal of Operational Research 162 (3): 740–761.10.1016/j.ejor.2003.10.026
   Web of Science ®Google Scholar
• Blackstone, J. H., D. T. Phillips, and G. L. Hogg. 1982. “A State-of-the-art Survey of Dispatching Rules for Manufacturing Job Shop Operations.” International Journal of Production Research 20 (1): 27–45.10.1080/00207548208947745
   Web of Science ®Google Scholar
• Chen, Z. L. 1996. “Scheduling and Common Due Date Assignment with Earliness–Tardiness Penalties and Batch Delivery Costs.” European Journal of Operational Research 93 (1): 49–60.10.1016/0377-2217(95)00133-6
   Web of Science ®Google Scholar
• Cheng, T. C. E. 1988. “Optimal Common Due-date with Limited Completion Time Deviation.” Computers & Operations Research 15 (2): 91–96.10.1016/0305-0548(88)90001-9
   Web of Science ®Google Scholar
• Chen, B., C. N. Potts, and G. J. Woeginger. 1999. “A Review of Machine Scheduling: Complexity, Algorithms and Approximability.” In Handbook of Combinatorial Optimization, edited by Ding-Zhu Du, and Panos M. Pardalos. 1493–1641. New York: Springer.
   Google Scholar
• Gens, G. V., and E. V. Levner. 1981. “Fast Approximation Algorithm for Job Sequencing with Deadlines.” Discrete Applied Mathematics 3 (4): 313–318.10.1016/0166-218X(81)90008-1
   Web of Science ®Google Scholar
• Gordon, V., J. M. Proth, and C. Chu. 2002. “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.10.1016/S0377-2217(01)00181-3
   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 Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.10.1016/S0167-5060(08)70356-X
   Google Scholar
• Hall, N. G., and M. E. Posner. 1991. “Earliness–Tardiness Scheduling Problems, I: Weighted Deviation of Completion times about a Common Due Date.” Operations Research 39 (5): 836–846.10.1287/opre.39.5.836
   Web of Science ®Google Scholar
• Hall, N. G., W. Kubiak, and S. P. Sethi. 1991. “Earliness–Tardiness Scheduling Problems, II: Deviation of Completion times about a Restrictive Common Due Date.” Operations Research 39 (5): 847–856.10.1287/opre.39.5.847
   Web of Science ®Google Scholar
• Janiak, A., W. A. Janiak, T. Krysiak, and T. Kwiatkowski. 2015. “A Survey on Scheduling Problems with Due Windows.” European Journal of Operational Research 242 (2): 347–357.10.1016/j.ejor.2014.09.043
   Web of Science ®Google Scholar
• Kanet, J. J. 1981. “Minimizing the Average Deviation of Job Completion times about a Common Due Date.” Naval Research Logistics Quarterly 28 (4): 643–651.10.1002/(ISSN)1931-9193
   Google Scholar
• Kramer, F. J., and C. Y. Lee. 1993. “Common Due-window Scheduling.” Production and Operations Management 2 (4): 262–275.
   Google Scholar
• Lee, Y. H., K. Bhaskaran, and M. Pinedo. 1997. “A Heuristic to Minimize the Total Weighted Tardiness with Sequence-dependent Setups.” IIE Transactions 29 (1): 45–52.10.1080/07408179708966311
   Web of Science ®Google Scholar
• Lee, Z. J., C. C. Chuang, and K. C. Ying. 2007. “An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date.” In Knowledge-based Intelligent Information and Engineering Systems, edited by Bruno Apolloni, Robert J. Howlett, and Lakhmi Jain. 689–695. Heidelberg: Springer Berlin Heidelberg.
   Google Scholar
• Liman, S. D., and S. Ramaswamy. 1994. “Earliness–Tardiness Scheduling Problems with a Common Delivery Window.” Operations Research Letters 15 (4): 195–203.10.1016/0167-6377(94)90078-7
   Web of Science ®Google Scholar
• Lin, S. W., S. Y. Chou, and K. C. Ying. 2007. “A Sequential Exchange Approach for Minimizing Earliness–Tardiness Penalties of Single-machine Scheduling with a Common Due Date.” European Journal of Operational Research 177 (2): 1294–1301.10.1016/j.ejor.2005.11.015
   Web of Science ®Google Scholar
• Lin, S. W., C. C. Lu, and K. C. Ying. 2011. “Minimization of Total Tardiness on Unrelated Parallel Machines with Sequence- and Machine-dependent Setup Times under Due Date Constraints.” The International Journal of Advanced Manufacturing Technology 53 (1–4): 353–361.10.1007/s00170-010-2824-y
   Web of Science ®Google Scholar
• Lin, S. W., and K. C. Ying. 2008. “A Hybrid Approach for Single-machine Tardiness Problems with Sequence-dependent Setup times.” Journal of the Operational Research Society 59 (8): 1109–1119.10.1057/palgrave.jors.2602434
   Web of Science ®Google Scholar
• Lin, S. W., K. C. Ying, Y. I. Chiang, and W. J. Wu. Forthcoming. “Minimizing Total Weighted Earliness and Tardiness Penalties on Identical Parallel Machines Using a Fast Ruin-and-recreate Algorithm.” International Journal of Production Research. doi:10.1080/00207543.2016.1190041.
   Web of Science ®Google Scholar
• Liu, J., Y. Wang, and X. Min. 2014. “Single-machine Scheduling with Common Due-window Assignment for Deteriorating Jobs.” Journal of the Operational Research Society 65 (2): 291–301.10.1057/jors.2013.6
   Web of Science ®Google Scholar
• Liu, L., J. J. Wang, and X. Y. Wang. 2016. “Single Machine Due-window Assignment Scheduling with Resource-dependent Processing times to Minimise Total Resource Consumption Cost.” International Journal of Production Research 54 (4): 1186–1195.10.1080/00207543.2015.1056323
   Web of Science ®Google Scholar
• Lu, C. C., S. W. Lin, and K. C. Ying. 2012. “Robust Scheduling on a Single Machine to Minimize Total Flow Time.” Computers & Operations Research 39 (7): 1682–1691.10.1016/j.cor.2011.10.003
   Web of Science ®Google Scholar
• Lu, C. C., K. C. Ying, and S. W. Lin. 2014. “Robust Single Machine Scheduling for Minimizing Total Flow Time in the Presence of Uncertain Processing Times.” Computers & Industrial Engineering 74: 102–110.10.1016/j.cie.2014.04.013
   Web of Science ®Google Scholar
• Morton, T. E., and R. M. V. Rachamadugu. 1982. Myopic Heuristics for the Single Machine Weighted Tardiness Problem. Technical Report, CMU-RI-TR-83-19, Pittsburgh: Carnigie Mellon University.
   Google Scholar
• Moslehi, G., M. Mahnam, M. Amin-Nayeri, and A. Azaron. 2010. “A Branch-and-bound Algorithm to Minimise the Sum of Maximum Earliness and Tardiness in the Single Machine.” International Journal of Operational Research 8 (4): 458–482.10.1504/IJOR.2010.034069
   Google Scholar
• Ow, P. S., and T. E. Morton. 1989. “The Single Machine Early/Tardy Problem.” Management Science 35 (2): 177–191.10.1287/mnsc.35.2.177
   Web of Science ®Google Scholar
• Panwalkar, S. S., and W. Iskander. 1977. “A Survey of Scheduling Rules.” Operations Research 25 (1): 45–61.10.1287/opre.25.1.45
   Web of Science ®Google Scholar
• Raman, N., R. V. Rachamadugu, and F. B. Talbot. 1989. “Real-time Scheduling of an Automated Manufacturing Center.” European Journal of Operational Research 40 (2): 222–242.10.1016/0377-2217(89)90332-9
   Web of Science ®Google Scholar
• Senthilkumar, P., and S. Narayanan. 2010. “Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines.” Intelligent Information Management 2 (8): 457–474.10.4236/iim.2010.28056
   Google Scholar
• Sidney, J. B. 1977. “Optimal Single-machine Scheduling with Earliness and Tardiness Penalties.” Operations Research 25 (1): 62–69.10.1287/opre.25.1.62
   Web of Science ®Google Scholar
• Smith, W. E. 1956. “Various Optimizers for Single-stage Production.” Naval Research Logistics Quarterly 3 (1–2): 59–66.10.1002/(ISSN)1931-9193
   Google Scholar
• Sun, L. H., K. Cui, J. H. Chen, and J. Wang. 2016. “Due Date Assignment and Convex Resource Allocation Scheduling with Variable Job Processing times.” International Journal of Production Research 54 (12): 3551–3560.10.1080/00207543.2015.1083628
   Web of Science ®Google Scholar
• Ventura, J. A., and M. X. Weng. 1996. “Single Machine Scheduling with a Common Delivery Window.” Journal of the Operational Research Society 47 (3): 424–434.10.1057/jors.1996.41
   Web of Science ®Google Scholar
• Vepsalainen, A. P. J., and T. E. Morton. 1987. “Priority Rules for Job Shops with Weighted Tardiness Costs.” Management Science 33 (8): 1035–1047.10.1287/mnsc.33.8.1035
   Web of Science ®Google Scholar
• Wang, J. B., and C. Wang. 2011. “Single-machine Due-window Assignment Problem with Learning Effect and Deteriorating Jobs.” Applied Mathematical Modelling 35 (8): 4017–4022.10.1016/j.apm.2011.02.023
   Web of Science ®Google Scholar
• Wang, D. J., Y. Yin, S. R. Cheng, T. C. E. Cheng, and C. C. Wu. 2016. “Due Date Assignment and Scheduling on a Single Machine with Two Competing Agents.” International Journal of Production Research 54 (4): 1152–1169.10.1080/00207543.2015.1056317
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, C. C. Wu, and S. R. Cheng. 2014. “Single-machine Batch Delivery Scheduling and Common Due-date Assignment with a Rate-modifying Activity.” International Journal of Production Research 52 (19): 5583–5596.10.1080/00207543.2014.886027
   Web of Science ®Google Scholar
• Yurtkuran, A., and E. Emel. Forthcoming. “A Discrete Artificial Bee Colony Algorithm for Single Machine Scheduling Problems.” International Journal of Production Research. doi:10.1080/00207543.2016.1185550.
   Web of Science ®Google Scholar