Determination of Production Start Time for Inventory Storage Space Minimization
References
- Kanet, J.J. and Sridharan, V. (2000) ‘Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review’, Operations Research, 48(1), pp. 99-110.
- Vivithkeyoonvong, T. and Supithak, W. (2022) ‘Production sequence determination to minimize the required storage space for the multiple items production system’, Journal of Industrial Engineering and Management, 15(3), pp. 416-432. https://doi.org/10.3926/jiem.3715.
- Pinedo, M. (2012) ‘Deterministic Models: Preliminaries’, in Scheduling. Theory, algorithms, and systems. 4th ed. pp. 13-33. 2. https://doi.org/10.1007/978-1-4614-2361-4.
- Davis, J.S. and Kanet, J.J. (1993) ‘Single-machine scheduling with early and tardy completion costs’, Naval Research Logistics (NRL), 40(1), pp. 85-101. https://doi.org/10.1002/1520-6750(199302)40:1<85:AID-NAV3220400106>3.0.CO;2-C.
- Supithak, W., Liman, S.D. and Montes, E.J. (2010) ‘Lot-sizing and scheduling problem with earliness tardiness and setup penalties’, Computers & Industrial Engineering, 58(3), pp. 363-372. https://doi.org/10.1016/j.cie.2008.10.005.
- Baker, K.R. and Scudder, G.D. (1990) ‘Sequencing with Earliness and Tardiness Penalties: A Review’, Operations Research, 38(1), pp. 22-36. https://doi.org/10.1287/opre.38.1.22.
- Sterna, M. (2021) ‘Late and early work scheduling: A survey’, Omega, 104, p. 102453. https://doi.org/10.1016/j.omega.2021.102453.
- Rolim, G.A. and Nagano, M.S. (2020) ‘Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review’, Computers & Industrial Engineering, 149, p. 106803. https://doi.org/10.1016/j.cie.2020.106803.
- Szwarc, W. and Mukhopadhyay, S.K. (1995) ‘Optimal timing schedules in earliness-tardiness single machine sequencing’, Naval Research Logistics (NRL), 42(7), pp. 1109-1114. https://doi.org/10.1002/1520-6750(199510)42:7<1109: AID-NAV3220420709>3.0.CO;2-5.
- Lee, C.Y. and Choi, J.Y. (1995) ‘A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights’, Computers & Operations Research, 22(8), pp. 857-869. https://doi.org/10.1016/0305-0548(94)00073-H.
- Colin, E.C. and Quinino, R.C. (2005) ‘An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions’, Computers & Operations Research, 32(9), pp. 2285-2296. https://doi.org/10.1016/j.cor.2004.03.003.
- Gerstl, E. and Mosheiov, G. (2020) ‘Single machine scheduling to maximize the number of on-time jobs with generalized due-dates’, Journal of Scheduling, 23(3), pp. 289-299. https://doi.org/10.1007/s10951-020-00638-7.
- Croce, F.D. and Trubian, M. (2002) ‘Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints’, Production Planning & Control, 13(2), pp. 133-142. https://doi.org/10.1080/09537280110069630.
- Chaimanee, A. and Supithak, W. (2018) ‘A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows’, Songklanakarin J. Sci. Technol., 40(5), pp. 1203-1218.
- Tsai, T.-I. (2007) ‘A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times’, The International Journal of Advanced Manufacturing Technology, 31(9), pp. 994-1000. https://doi.org/10.1007/s00170-005-0261-0.
- Schaller, J. (2004) ‘Single machine scheduling with early and quadratic tardy penalties’, Computers & Industrial Engineering, 46(3), pp. 511-532. https://doi.org/10.1016/j.cie.2004.01.011.
- Yano, C.A. and Kim, Y.-D. (1991) ‘Algorithms for a class of single-machine weighted tardiness and earliness problems’, European Journal of Operational Research, 52(2), pp. 167-178. https://doi.org/10.1016/0377-2217(91)90078-A.
- Wan, G. and Yen, B.P.C. (2002) ‘Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties’, European Journal of Operational Research, 142(2), pp. 271-281. https://doi.org/10.1016/S0377-2217(01)00302-2.
- Bomberger, E.E. (1966) ‘A Dynamic Programming Approach to a Lot Size Scheduling Problem’, Management Science, 12(11), pp. 778-784. https://doi.org/10.1287/mnsc.12.11.778.
- Taleizadeh, A.A., Yadegari, M. and Sana, S.S. (2019) ‘Production models of multiple products using a single machine under quality screening and reworking policies’, Journal of Modelling in Management, 14(1), pp. 232-259. https://doi.org/10.1108/jm2-06-2018-0086.
- Zhao, Z., Liu, S., Zhou, M., Guo, X. and Qi, L. (2020) ‘Decomposition Method for New Single-Machine Scheduling Problems From Steel Production Systems’, IEEE Transactions on Automation Science and Engineering, 17(3), pp. 1376-1387. https://doi.org/10.1109/TASE.2019.2953669.
- Glock, C.H., Grosse, E.H. and Ries, J.M. (2014) ‘The lot sizing problem: A tertiary study’, International Journal of Production Economics, 155, pp. 39-51. https://doi.org/10.1016/j.ijpe.2013.12.009.
- Jans, R. and Degraeve, Z. (2008) ‘Modeling industrial lot sizing problems: a review’, International Journal of Production Research, 46(6), pp. 1619-1643. https://doi.org/10.1080/00207540600902262.
- Beck, F.G. and Glock, C.H. (2019) ‘The economic lot scheduling problem: a content analysis’, International Journal of Production Research, 58(11), pp. 3437-3454. https://doi.org/10.1080/00207543.2019.1668071.
- Tersine, R.J. (1993) ‘Independent demand systems: deterministic models’, in Principles of Inventory and Materials Management. 4th edn. Prentice Hall, pp. 90-176.
- Taleizadeh, A.A., Cárdenas-Barrón, L.E., Biabani, J. and Nikousokhan, R. (2012) ‘Multi products single machine EPQ model with immediate rework process’, International Journal of Industrial Engineering Computations, 3(2), pp. 93-102. https://doi.org/10.5267/j.ijiec.2011.09.001.
- Taleizadeh, A.A., Wee, H.-M. and Jalali-Naini, S.G. (2013) ‘Economic production quantity model with repair failure and limited capacity’, Applied Mathematical Modelling, 37(5), pp. 2765-2774. https://doi.org/10.1016/j.apm.2012.06.006.
- Taleizadeh, A.A., Cárdenas-Barrón, L.E. and Mohammadi, B. (2014) ‘A deterministic multi product single machine EPQ model with backordering, scraped products, rework and interruption in manufacturing process’, International Journal of Production Economics, 150, pp. 9-27. https://doi.org/10.1016/j.ijpe.2013.11.023.
- Cárdenas-Barrón, L.E., Treviño-Garza, G., Widyadana, G.A. and Wee, H.-M. (2014) ‘A constrained multi-products EPQ inventory model with discrete delivery order and lot size’, Applied Mathematics and Computation, 230, pp. 359-370. https://doi.org/10.1016/j.amc.2013.12.077.
- Khalilpourazari, S., Mirzazadeh, A., Weber, G.-W. and Pasandideh, S.H.R. (2019) ‘A robust fuzzy approach for constrained multi-product economic production quantity with imperfect items and rework process’, Optimization, 69(1), pp. 63-90. https://doi.org/10.1080/02331934.2019.1630625.
Language: English
Page range: 290 - 299
Submitted on: Jun 1, 2025
Accepted on: Apr 1, 2026
Published on: Apr 30, 2026
Published by: STE Group sp. z.o.o.
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Related subjects:
© 2026 Titirat Vivithkeyoonvong, Wisut Supithak, published by STE Group sp. z.o.o.
This work is licensed under the Creative Commons Attribution 4.0 License.