Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation

References

• Atan, M. O., and M. S. Akturk. 2008. “Single CNC Machine Scheduling with Controllable Processing Times and Multiple Due Dates.” International Journal of Production Research 46 (21): 6087–6111.
   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: 315–329.
   Web of Science ®Google Scholar
• Brucker, P. 2007. Scheduling Algorithms. 5th ed. Berlin: Springer.
   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.
   Google Scholar
• Hardy, G. H., J. E. Littlewood, and G. Polya. 1967. Inequalities. Cambridge: Cambridge University Press.
   Google Scholar
• Karimi-Nasab, M., and S. M. T. Fatemi Ghomi. 2012. “Multi-objective Production Scheduling with Controllable Processing Times and Sequence-dependent Setups for Deteriorating Items.” International Journal of Production Research 50: 7378–7400.
   Web of Science ®Google Scholar
• Karimi-Nasab, M., and M. B. Aryanezhad. 2011. “A Multi-objective Production Smoothing Model with Compressible Operating Times.” Applied Mathematical Modelling 35 (7): 3596–3610.
   Web of Science ®Google Scholar
• Karimi-Nasab, M., and K. Sabri-Laghaie. 2014. “Developing Approximate Algorithms for EPQ Problem with Process Compressibility and Random Error in Production/Inspection.” International Journal of Production Research 52 (8): 2388–2421.
   Web of Science ®Google Scholar
• Karimi-Nasab, M., and S. M. Seyedhoseini. 2013. “Multi-level Lot Sizing and Job Shop Scheduling with Compressible Process Times: A Cutting Plane Approach.” European Journal of Operational Research 231 (3): 598–616.
   Web of Science ®Google Scholar
• Karimi-Nasab, M., S. M. Seyedhoseini, M. Modarres, and M. Heidari. 2013. “Multi-period Lot Sizing and Job Shop Scheduling with Compressible Process Times for Multilevel Product Structures.” International Journal of Production Research 51 (20): 6229–6246.
   Web of Science ®Google Scholar
• Leyvand, Y., D. Shabtay, and G. Steiner. 2010. “A Unified Approach for Scheduling with Convex Resource Consumption Functions Using Positional Penalties.” European Journal of Operational Research 206: 301-312.
   Web of Science ®Google Scholar
• Li, G., X.-Y. Wang, J.-B. Wang, and L.-Y. Sun. 2013. “Worst Case Analysis of Flow Shop Scheduling Problems with a Time-dependent Learning Effect.” International Journal of Production Economics 142: 98-104.
   Web of Science ®Google Scholar
• Lu, Y.-Y., G. Li, Y.-B. Wu, and P. Ji. 2014. “Optimal Due-date Assignment Problem with Learning Effect and Resource-dependent Processing Times.” Optimization Letters 8: 113–127.
   Web of Science ®Google Scholar
• Mahdavi Mazdeh, M., A. Khan Nakhjavani, and A. Zareei. 2010. “Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem.” International Journal of Industrial Engineering & Production Research 21 (2): 89–95.
   Google Scholar
• Mokhtari, H., I. N. Kamal Abadi, and A. Cheraghalikhani. 2011. “A Multi-objective Flow Shop Scheduling with Resource-dependent Processing Times: Trade-off between Makespan and Cost of Resources.” International Journal of Production Research 49: 5851–5875.
   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: 222–230.
   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: 185–195.
   Google Scholar
• Niu, G., S. Sun, P. Lafon, Y. Zhang, and J. Wang. 2012. “Two Decompositions for the Bicriteria Job-shop Scheduling Problem with Discretely Controllable Processing Times.” International Journal of Production Research 50: 7415–7427.
   Web of Science ®Google Scholar
• Noorollahi, E., M. Karimi-Nasab, and M. B. Aryanezhad. 2012. “An Economic Production Quantity Model with Random Yield Subject to Process Compressibility.” Mathematical and Computer Modelling 56 (3): 80–96.
   Web of Science ®Google Scholar
• Qian, J., and G. Steiner. 2013. “Fast Algorithms for Scheduling with Learning Effects and Time-dependent Processing Times on a Single Machine.” European Journal of Operational Research 225: 547–551.
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2007. “A Survey of Scheduling with Controllable Processing Times.” Discrete Applied Mathematics 155 (13): 1643–1666.
   Web of Science ®Google Scholar
• Sun, L.-H., K. Cui, J.-H. Chen, J. Wang, and X.-C. He. 2013a. “Research on Permutation Flow Shop Scheduling Problems with General Position-dependent Learning Effects.” Annals of Operations Research 211: 473–480.
   Web of Science ®Google Scholar
• Sun, L.-H., K. Cui, J.-H. Chen, J. Wang, and X.-C. He. 2013b. “Some Results of the Worst-case Analysis for Flow Shop Scheduling with a Learning Effect.” Annals of Operations Research 211: 481–490.
   Web of Science ®Google Scholar
• Tavakoli-Moghadam, R., and M. Vasei. 2008. “A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-bound Methods.” International Journal of Industrial Engineering & Production Research 19 (4): 47–56.
   Google Scholar
• Turkcan, A., M. S. Akturk, and R. H. Storer. 2009. “Predictive/Reactive Scheduling with Controllable Processing Times and Earliness-tardiness Penalties.” IIE Transactions 41 (12): 1080-1095.
   Web of Science ®Google Scholar
• Wang, X., and T. C. E. Cheng. 2005. “Single Machine Scheduling with Resource Dependent Release Times and Processing Times.” European Journal of Operational Research 162: 727–739.
   Web of Science ®Google Scholar
• Wang, J.-B., L. Liu, and C. Wang. 2013. “Single Machine SLK/DIF Due Window Assignment Problem with Learning Effect and Deteriorating Jobs.” Applied Mathematical Modelling 37: 8394–8400.
   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: 4017–4022.
   Web of Science ®Google Scholar
• Wang, J.-B., and M.-Z. Wang. 2012. “Single-machine Scheduling to Minimize Total Convex Resource Consumption with a Constraint on Total Weighted Flow Time.” Computers & Operations Research 39: 492–497.
   Web of Science ®Google Scholar
• Wang, J. B., and M. Z. Wang. 2014a. “Single-machine Due-window Assignment and Scheduling with Learning Effect and Resource-dependent Processing Times.” Asia-Pacific Journal of Operational Research 31 (5):1450036. 15 p.
   Web of Science ®Google Scholar
• Wang, J.-B., and J.-J. Wang. 2014b. “Flowshop Scheduling with a General Exponential Learning Effect.” Computers & Operations Research 43: 292–308.
   Web of Science ®Google Scholar
• Wang, D., M.-Z. Wang, and J.-B. Wang. 2010. “Single-machine Scheduling with Learning Effect and Resource-dependent Processing Times.” Computer & Industrial Engineering 59: 458-462.
   Web of Science ®Google Scholar
• Wong, C. S., F. T. S. Chan, and S. H. Chung. 2013. “A Joint Production Scheduling Approach Considering Multiple Resources and Preventive Maintenance Tasks.” International Journal of Production Research 51: 883–896.
   Web of Science ®Google Scholar
• Yang, D.-L., T. C. E. Cheng, and S.-J. Yang. 2014. “Parallel-machine Scheduling with Controllable Processing Times and Rate-modifying Activities to Minimise Total Cost Involving Total Completion Time and Job Compressions.” International Journal of Production Research 52: 1133–1141.
   Web of Science ®Google Scholar
• Yin, Y., 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: 5083–5099.
   Web of Science ®Google Scholar
• Yin, N., and X.-Y. Wang. 2011. “Single Machine Scheduling with Controllable Processing Times and Learning Effect.” International Journal of Advanced Manufacturing Technology 54: 743–748.
   Web of Science ®Google Scholar