Skip to main content
SpringerLink
Log in

Interval Balanced Multiprocessor Scheduling of Modular Jobs

  • INFORMATION TECHNOLOGY IN ENGINEERING SYSTEMS
  • Published:
Journal of Communications Technology and Electronics Aims and scope Submit manuscript

Abstract

This article addresses multiprocessor scheduling of modular jobs while taking into account a balance requirements for each time interval. First, a brief description of just-in-time (JIT) planning approach is described. Further, the problem statement of the examined scheduling problem is suggested. A numerical example from planning in house-building illustrates the proposed problem and heuristic solving scheme. This scheme involves (i) clustering of the initial set of building blocks/details to obtain eight typical groups which correspond to manufacturing conveyers, (ii) generation of an initial plan for building assembly, (iii) detection of time intervals with disbalance by a basic building block/detail, and (iv) modification of the plan (by a multiple choice problem). A possible application of the proposed problem in information transmission is very briefly described as well.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.
Fig. 10.
Fig. 11.
Fig. 12.

Similar content being viewed by others

REFERENCES

  1. M. O. Adamu and O. Abass, “Parallel machine scheduling to maximize the weighted number of just-in-time jobs,” J. Appl. Sci. Technol. 15 (1–2), 27–34 (2010).

    Article  Google Scholar 

  2. M. O. Adamu and A. O. Adewumi, “Metaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs,” Int. J. Phys. Sci. 7, (10) 1641–1652 (2012).

    Article  Google Scholar 

  3. M. S. Akturk and F. Erhun, “An overview of design and operational issues of kanban systems,” Int. J. Prod. Res. 37 (17), 3859–3881 (1999).

    Article  MATH  Google Scholar 

  4. G. A. Alvarez-Perez, J. L. Gonzalez-Valarde, and J. W. Fowler, “Cross-docking—just in time scheduling: an alternative solution approach,” J. the ORS 60 (4), 554–564 (2009).

    MATH  Google Scholar 

  5. R. Alvarez-Valdes, E. Crespo, J. M. Tamarit, and F. Villa, “Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models,” TOP 20, 754–767 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  6. R. Alvarez-Valdes, J. M. Tamarit, and F. Villa, “Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics,” Comp. & Oper. Res. 54, 1–11 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  7. E. Angelelli and C. Filippi, “On the complexity of interval scheduling with a resource constraint,” Theor. Comp. Sci. 412 (29), 3650–3657 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  8. E. M. Arkin and E. L. Silverberg, “Scheduling jobs with fixed start and finish times,” Discr. Appl. Math. 18 (1), 1–8 (1987).

    Article  MATH  Google Scholar 

  9. K. R. Baker, “Minimizing earliness and tardiness costs in stochastic scheduling,” EJOR 236 (2), 445–452 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  10. K. R. Baker and G. D. Scudder, “Sequencing with earliness and tardiness penalties: a review,” Oper. Res. 38 (1), 22–36 (1990).

    Article  MathSciNet  MATH  Google Scholar 

  11. R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” Discr. Appl. Math. 194 (23), 23–36 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  12. A. R. Boloori Arabani, S. M. T. Fatemi Ghomi, and M. Zandieh, “A multi-criteria cross-docking scheduling with just-in-time approach,” Int. J. Adv. Manuf. Technol. 49 (5), 741–756 (2010).

    Article  Google Scholar 

  13. N. Boysen and S. Bock, “Scheduling just-in-time part supply for mixed-model assembly lines,” EJOR 211 (1), 15–25 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  14. W. Bozejko, P. Rajba, and M. Wodecki, “Scheduling problem with uncertain parameters in just in time system,” in L. Rutkowski, M. Korytkowski, R. Scherer, R. Tadeusiewicz, L. A. Zadeh, and J. M. Zurada (eds), Artif. Intell. and Soft Comput., LNCS 8468 (Springer, 2014), pp. 456–467.

    Google Scholar 

  15. M. Branda, J. Novotny, and A. Olstad, “Fixed interval scheduling under uncertainty—a tabu search algorithm for an extended robust coloring formulation,” Comp. and Ind. Eng. 93, 45–54 (2016).

    Article  Google Scholar 

  16. X. Cai and S. Zhou, “Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs,” Oper. Res. 47 (3), 422–437 (1999).

    Article  MathSciNet  MATH  Google Scholar 

  17. M. C. Carlisle and E. L. Lloyd, “On the k-coloring of intervals,” Discr. Appl. Math. 59, 225–235 (1995).

    Article  MathSciNet  MATH  Google Scholar 

  18. M. W. Carter and C. A. Tovey, “When is the classroom assignment problem hard?,” Oper. Res. 40, 28–39 (1992).

    Article  MATH  Google Scholar 

  19. O. Cepek and S. C. Sung, “A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines,” Comp. and Oper. Res. 32 (12), 3265–3271 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  20. Z.-L. Chen and W. B. Powell, “A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem,” EJOR 116 (1), 220–232 (1999).

    Article  MATH  Google Scholar 

  21. B. Chen, R. Hassan, and M. Tzur, “Allocation of bandwidth and storage,” IIE Trans. 34, 501–507 (2002).

    Article  Google Scholar 

  22. Z. Z. Chen, T. Jiang, G. H. Lin, R. Rizzi, J. J. Wen, D. Xu, and Y. Xu, “More reliable protein NMR peak assignment via improved 2-interval scheduling,” in G. Di Battista and U. Zwick (eds), Algorithms—ESA 2003, LNCS 2832 (Springer, 2003), pp. 580–592.

    Google Scholar 

  23. S. Chetty and A. O. Adewumi, “A study of the enhanced best performance algorithm for the just-in-time scheduling problem,” Discr. Dynam. Nature Soc. 2015 Art. ID 350308 (2015).

  24. B. C. Choi and S. J. Yoon, “Maximizing the number of just-in-time jobs in flow-shop scheduling,” J. Sched. 10 (4-5), 237–243 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  25. D. Y. Chung and B. C. Choi, “Just-in-time scheduling with competing agents,” Korean Oper. Res. Manag. Sci. 37, 19–28 (2012).

    Google Scholar 

  26. T. N. Dhamala and S. R. Khadka, “A review on sequencing approaches for mixed-model just-in-time production systems,” Iranian J. Optim. 1, 266–290 (2009).

    Google Scholar 

  27. I. G. Drobouchevich and J. B. Sidney, “Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs,” Comp. and Oper. Res. 39 (9), 1919–1926 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  28. A. Elysi and N. Salmasi, “Stochastic scheduling with minimizing the number of tardy jobs using change constrained programming,” Math. and Comp. Modell. 57 (5-6), 1154–1164 (2013).

    Article  Google Scholar 

  29. A. Elysi and N. Salmasi, “Stochastic flow-shop scheduling with minimizing the expected number of tardy jobs,” The Int. J. of Adv. Manuf. Technol. 66 (1–4), 337–346 (2013).

    Article  Google Scholar 

  30. M. R. Garey and D. S. Johnson, Computers and Intractability. The Guide to the Theory of NPCompleteness, (W. H. Freeman and Company, San Francisco, 1979).

    MATH  Google Scholar 

  31. M. R. Garey, R. E. Tarjan, and G. T. Wilfong, “One-processor scheduling with symmetric earliness and tardiness penalties,” Math. Oper. Res. 13, 330–348 (1988).

    Article  MathSciNet  MATH  Google Scholar 

  32. E. Gerstl and G. Mosheiov, “Due-window assignment problems with unit-time jobs,” Appl. Math. and Comput. 220, 487–495 (2013).

    MathSciNet  MATH  Google Scholar 

  33. E. Gerstl and G. Mosheiov, “Minmax weighted earliness-tardiness with identical processing times and two competing agents,” Comp. and Ind. Eng. 107, 171–177 (2017).

    Article  Google Scholar 

  34. F. Giordano and M. M. Schiraldi, “On Just-In-Time production leveling,” in Operations Management, INTECH, 2015, pp. 141–162.

    Google Scholar 

  35. D. Y. Golhar and C. L. Stamm, “The just-in-time philosophy: a literature review,” The Int. J. of Prod. Res. 29 (4), 657–676 (1991).

    Article  Google Scholar 

  36. V. S. Gordon, J. M. Proth, and C. Chu, “A survey of the state-of-the-art of common due-date assignment and scheduling research,” EJOR 139 (1), 1–25 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  37. V. S. Gordon, J.-M. Proth, and V. A. Strusevich, “Scheduling with due date assignment,” in J. Y. Leung (ed.), Handbook of Scheduling: Algorithms, Models and Performance Analysis (Chapman & Hall, Boca Raton, FL, USA, 2004), Chapter 10.

    MATH  Google Scholar 

  38. H. Groenevelt, “The just-in-time systems,” Handbook in Operations Research & Management Science 4, 629–670 (1993).

    Article  Google Scholar 

  39. U. I. Gupta, D. T. Lee, and J. Y.-T. Leung, “An optimal solution the the channel-assignment problem,” IEEE Trans. Comp. 28, 807–810 (1979).

    Article  MATH  Google Scholar 

  40. D. Hermelin, D. Shabtay, and N. Talmon, “On the parameterized tractability of the just-in-time flow-shop scheduling problem,” Electr. Prepr., Sep. 13, (2017). http://arxiv.org/abs/1709.04169 [cs.DS].

  41. K. Hiraishi, E. Levner, and M. Vlach, “Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs,” Comp. and Oper. Res. 29 (7), 841–848 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  42. J. A. Hoogeveen, “Multicriteria scheduling,” EJOR 167 (3), 592–623 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  43. P. Y. Huang, L. P. Rees, and B. W. Taylor III, “A simulation analysis of the Japanese just-in-time techniques (with kanbans) for a multiline, multistage production systems. Dec. Sci. 14 (3), 326–344 (1983).

    Article  Google Scholar 

  44. A. Janiak and R. Januszkiewicz, “Scheduling of unit-time jobs distinct due windows on parallel processors,” in Proc. 9th IFAC Workshop on Intell. Manuf. Syst., 2008, pp. 118–121.

  45. A. Janiak, W. Janiak, T. Krysiak, and T. Kwiatkowski, “A survey on scheduling problems with due windows,” EJOR 242 (2), 347–357 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  46. J. Josefowska, Just-in-Time Scheduling: Models and Algorithms for Computer and Manufacturing Systems (Springer, 2010).

    Google Scholar 

  47. I. Kacem, “Fully polynomial time approximation scheme for the total weighted tardiness with a common due date,” Discr. Appl. Math. 158 (9), 1035–1040 (2010).

  48. V. Kayvanfar, G. H. M. Komaki, A. Aalaei, and M. Zandieh, “Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times,” Comput. Oper. Res. 41, 31–43 (2014).

  49. H. Kellerer, K. Rustogi, and V. A. Strusevich, “A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about large common due date” (Omega, 2018) [in press].

  50. T. Keshavarz, M. Savelsbergh, and N. Salmasi, “A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties,” App. Math. Modell. 39 (20), 6410–6424 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  51. A. W. J. Kolen, J. K. Lenstra, Ch. H. Papadimitriou, and F. C. R. Spieksma, “Interval scheduling: a survey,” Naval Res. Logist. 54 (5), 530–543 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  52. A. J. Kootanaee, K. N. Babu, and H. F. Talari, “Just-in-tome manufacturing system: from introduction to implement,” Int. J. Econom., Busin. and Finance 1 (2), 7–25 (2013).

    Google Scholar 

  53. M. Y. Kovalyov and W. Kubiak, “A fully polynomial approximation scheme for the weighted earlinesstardiness problem,” Oper. Res. 47 (5), 757–761 (1999).

    Article  MathSciNet  MATH  Google Scholar 

  54. M. Y. Kovalyov, C. T. Ng, and T. C. E. Cheng, “Fixed interval scheduling: models, applications, computational complexity and algorithms,” EJOR 178 (2), 331–342 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  55. G. N. Krieg and H. Kuhn, “A decomposition method for multi-product kanban systems with setup times and lost sales,” IEE Trans. 34, 613–625 (2002).

    Article  Google Scholar 

  56. K. G. Kroon, M. Salomon, and L. N. van Wassenhove, “Exact and approximation algorithms for the tactical fixed interval scheduling problem,” Oper. Res. 45, 624–638 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  57. S. O. Krumke, C. Thielen, and S. Westphal, “Interval scheduling on related machines,” Comp. and Oper. Res. 38, 1836–1844 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  58. W. Kubiak and S. Sethi, “Optimal just-in-time schedules for flexible transfer lines,” Int. J. of Flexible Manuf. Syst. 6 (2), 137–154 (1994).

    Article  Google Scholar 

  59. W. Kubiak, G. Steiner, and J. S. Yeomans, “Optimal level schedules for mixed-model, multi level just-in-time assembly systems,” Ann. Oper. Res. 69, 241–259 (1997).

    Article  MATH  Google Scholar 

  60. M. Laguna and J. L. G. Velarde, “A search heuristic for just-in-time scheduling in parallel machines,” J. Intell. Manuf. 2 (4), 253–260 (1991).

    Article  Google Scholar 

  61. V. Lauff and F. Werner, “Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey,” Math. and Comp. Modell. 40 (5–6), 637–655 (2004).

    Article  MathSciNet  MATH  Google Scholar 

  62. M. Lawson, R. Ogden, and C. Goodier, Design in Modular Construction (CRC Press, 2014).

    Book  Google Scholar 

  63. M. Sh. Levin, The Techno Working Draft of Subsystem of Forming of Zavodstvy Production on Basis of Line Construction Schedules (“Mosproekt-1”, GlavAPU, Moscow, 1982).

  64. M. Sh. Levin, Modular System Design and Evaluation (Springer, 2015).

    Book  Google Scholar 

  65. M. Sh. Levin, “Towards balanced clustering—part 1 (preliminaries),” Elec. Prepr., Jun. 9, (2017). http://arxiv.org/abs/1706.03065 [cs.DS].

  66. M. Sh. Levin, “On balanced clustering (indices, models, examples),” J. Commun. Technol. and Electron. 62, 1506–1515 (2017).

    Article  Google Scholar 

  67. M. Sh. Levin, “Time-interval balanced clustering in multi-processor scheduling of composite modular jobs (preliminary description),” Elec. Prepr., Nov. 11, (2018). http://arxiv.org/abs/1811.04458 [cs.AI].

  68. Y. Leyvand, D. Shabtay, G. Steiner, and L. Yedidsion, “Just-in-time scheduling with controllable processing times on parallel machines,” J. Comb. Optim. 19 (3), 347–368 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  69. L. Li, D. J. Fonescca, and D. S. Chen, “Earliness-tardiness production planning for just in time manufacturing: A unifying approach by goal programming,” EJOR 175 (1), 508–515 (2006).

    Article  MATH  Google Scholar 

  70. K. Liu, N. Abu-Ghazaleh, and K. D. Kang, “JiTS: Just-in-time scheduling for real-time sensor data dissemination,” Elec. Prepr., Aug. 16, (2006). http://arxiv. org/abs/0608069 [cs.NI].

  71. B. A. Maksimenko, “Method of catalog space-planning elements as new stage of development of large panel housing construction,” Peredovoi Opyt v Stroitel’stve Moskvy, No. 2, 7–9 (1982).

  72. S. Martello and P. Toth, “A heuristic approach to the bus driver scheduling problem,” EJOR 24, 106–117 (1986).

    Article  MATH  Google Scholar 

  73. S. Meissner, “Controlling just-in-sequence flow-production” Logist. Res. 2, 45–53 (2010).

    Article  Google Scholar 

  74. M. P. McGrarry, M. Reisslein, C. J. Colbourn, M. Maier, F. Aurzada, and M. Scheutzow, “Just-in-time scheduling for multichannel EPONs,” IEEE Trans. Lightwave Technol. 26 (10), 1204–1216 (2008).

    Article  Google Scholar 

  75. P. R. McMullen, “JIT sequencing for mixed-model assembly lines with setups using,” Tabu Search. Production Planning and Control 9 (5), 504–510 (1998).

    Article  Google Scholar 

  76. R. M’Hallah and R. L. Bulfin, “Minimizing the weighted number of tardy jobs on parallel processors,” EJOR 160, 471–484 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  77. J. Miltenburg, “Level schedules for mixed-model assembly lines in just-in-time production systems,” Manag. Sci. 35 (2), 192–207 (1989).

    Article  MATH  Google Scholar 

  78. J. Miltenburg, G. Steiner, and S. Yeomans, “A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems,” Math. and Comp. Modell. 13 (3), 57–66 (1990).

    Article  MathSciNet  MATH  Google Scholar 

  79. J. Mittenthal and M. Raghavachari, “Stochastic single machine scheduling with quadratic early-tardy penalties,” Oper. Res. 41, 786–796 (1993).

    Article  MathSciNet  MATH  Google Scholar 

  80. J. N. Monette, Y. Deville, and P. Van Hentenryck, “Just-in-time scheduling with constrained programming,” in Nineteenth Int. Conf. on Automated Planning and Scheduling ICAPS 2009 (ICAPS, 2009), pp. 241–248.

  81. Y. Monden, Toyota Production System: An Integrated Approach to Just-In-Time, 4th ed. (CRC Press, 2011).

    Google Scholar 

  82. F. Mooeni, S. M. Sanchez, and A. J. Vakharia, “A robust design methodology for Kanban system design,” Int. J. of Prod. Res. 35, 2821–2838 (1997).

    Article  MATH  Google Scholar 

  83. J. M. Moore, “An n job, one machine sequencing algorithm for minimizing the number of late jobs,” Manag. Sci. 15, 102–109 (1968).

    Article  MATH  Google Scholar 

  84. G. Mosheiov and D. Oron, “A multi-criteria scheduling with due-window assignment problem,” Math. and Comp. Modell. 48 (5), 898–907 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  85. G. Mosheiov and A. Sarig, “Minmax scheduling problems with a common due-window,” Comput. Oper. Res. 36 (6), 1886–1892 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  86. G. Mosheiov and A. Sarig, “Scheduling a maintenance activity and due-window assignment on a single machine,” Comput. Oper. Res. 36 (9), 2541–2545 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  87. G. Mosheiov and A. Sarig, “Scheduling with a common due-window: polynomial solvable cases,” Inf. Sci. 180 (8), 1492–1505 (2010).

    Article  MATH  Google Scholar 

  88. M. A. Mullens, Factory Design for Modular Homebuilding (Constructability Press, 2011).

    Google Scholar 

  89. V. S. Nori and B. R. Sarker, “Cyclic scheduling for a multi-product, single-facility production system operating under a just-in-time delivery policy,” J. ORS 47 (7), 930–935 (1996).

    MATH  Google Scholar 

  90. Ch. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Dover, 2013).

  91. J. Pereira and O. C. Vasquez, “The single machine weighted mean squared deviation problem,” EJOR 261 (2), 515–529 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  92. L. S. Pheng and T. S. Jayawickrama, “Just-in-time management of a building project in the Middle-East,” in R. Rios-Mercado and Y. A. Rios-Solis (eds), Just-in-Time Systems (Springer, 2012), pp. 261–286.

    MATH  Google Scholar 

  93. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 5th ed., (Springer, New York, 2016).

    Book  MATH  Google Scholar 

  94. R. Rios-Mercado and Y. A. Rios-Solis, (eds), Just-in-Time System (Springer, 2012).

    MATH  Google Scholar 

  95. A. Roach and R. Nagi, “A hybrid GA-SA algorithm for just-in-time scheduling of multi-level assemblies,” Comp. and Oper. Res. 30 (4), 1047–1060 (1996).

    Google Scholar 

  96. A. Rochegov and L. Vaisman, New System of the Moscow Large-Panel Housing Construction Stroit-vo i Arkhitek. Moskvy, No. 5, 4–7 (1980).

    Google Scholar 

  97. K. Van Rompaey, I. Bolsens, and H. De Man, in Proc. IEEE 1992 Int. Conf. on Computer Design: VLSI in Computers and Processors ICCD’92, 1992 (IEEE, New York, 1992), pp. 295–300.

  98. D. P. Ronconi and M. S. Kawamura, “The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm,” Comput. and Appl. Math. 29 (2), 107–124 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  99. D. P. Ronconi and E. G. Birgin, “Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness,” in R. Rios-Mercado and Y. A. Rios-Solis (eds), Just-in-Time Systems (Springer, 2012), pp. 91–105.

    Google Scholar 

  100. B. F. Rosa, M. J. F. Souza, S. R. de Souza, Filho M. F. de Franca, Z. Ales, and P. Y. P. Machelon, “Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties,” Comp. and Oper. Res. 81, 203–215 (2017).

    Article  MATH  Google Scholar 

  101. Kumar C. Sendil and R. Panneerselvam, “Literature review of JIT-KANBAN system,” Int. J. Adv. Manuf. Technol., 393–408 (2007).

  102. D. K. Seo, C. M. Klein, and W. Jang, “Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models,” Comp. and Ind. Eng. 48, 153–161 (2005).

    Article  Google Scholar 

  103. D. Shabtay, “The just-in-time scheduling problem in flow shop scheduling systems,” EJOR 216 (3), 521–532 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  104. D. Shabtay and G. Steiner, “Scheduling to maximize the number of just-in-time jobs: a survey,” in R. Z. Rioz-Mercado and Y. A. Rios-Solis (eds), Just-In-Time Systems (Springer, 2012), pp. 3–20.

    MATH  Google Scholar 

  105. A. Soukhal and N. H. Toung, “Just-in-time scheduling with equal-size jobs,” in R. Rios-Mercado and Y. A. Rios-Solis (eds), Just-in-Time Systems (Springer, 2012), pp. 107–146.

    MATH  Google Scholar 

  106. F. Sourd and S. Kedad-Sidhoum, “A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem,” J. Sched. 11 (1), 49–58 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  107. S. C. Sung and M. Vlach, “Maximizing weighted number of just-in-time jobs on unrelated parallel machines,” J. Sched. 8 (5), 453–460 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  108. S. Tanaka, “An exact algorithm for the single-machine earlinessЦtardiness scheduling problem,” in R. Rios-Mercado, and Y. A. Rios-Solis (eds), Just-in-Time Systems (Springer, 2012), pp. 21–40.

    Google Scholar 

  109. H. Y. Tang, C. L. Zhao, and C. D. Cheng, “Single machine stochastic JIT scheduling problem subject to machine breakdowns,” Science Chine Ser. A: Math. 51 (2), 273–292 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  110. V. Tkindt and J.-C. Billaut, Multicriteria Scheduling: Theory, Models and Algorithms, 2nd ed., (Springer, 2006).

    Google Scholar 

  111. D. Trietsch and K. Baker, “Minimizing the number of tardy jobs with stochastically-ordered processing times,” J. Sched. 11 (1), 71–73 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  112. N. H. Tuong and A. Soukhal, “Some new polynomial cases in just-in-time scheduling problems with multiple due dates,” in Proc. 16th Int. Conf. on Research, Innovation and Vision for the Future in Computing and Communications Technologies (RIVFT08), 2008, pp. 36–41.

  113. N. H. Tuong and A. Soukhal, “Polynomial cases and PTAS for Just-in-Time scheduling on parallel machines around a common due-date,” in Proc. 11th Int. Workshop on Project Management and Scheduling (PMS08), 2008, pp. 152–155.

  114. N. H. Tuong and A. Soukhal, “Due dates assignment and JIT scheduling with equal-size jobs,” EJOR 205 (2), 280–289 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  115. E. Vallada and R. Ruiz, “Scheduling uated parallel machines with sequence dependent setup times and weighted earliness tardiness minimization,” in R. Rios-Mercado and Y. A. Rios-Solis (eds), Just-in-Time Systems (Springer, 2012), pp. 67–90.

    Google Scholar 

  116. J. M. S. Valente and R. A. F. S. Alves, “Efficient polynomial algorithms for special cases of weighted early/tardy scheduling with release dates and a common due date,” Pesquisa Operacional 23 (3), 443–456 (2003).

    Article  Google Scholar 

  117. J. M. S. Valente and J. F. Goncalves, “A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties,” Comp. and Oper. Res. 36 (10), 2707–2715 (2009).

    Article  MATH  Google Scholar 

  118. X.-Y. Wang and M.-Z. Wang, “Single machine common flow allowance scheduling with a rate-modifying activity,” Comp. and Ind. Eng. 59 (4), 898–902 (2010).

    Article  Google Scholar 

  119. D. Wang, Y. Yin, and T. C. E. Cheng, “A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times,” Naval Res. Logist. 64 (1), 41–63 (2017).

  120. J. Y. Wei and R. I. McFarland, “Just-in-time signaling for WDM optical burst switching networks,” J. Lightwave Technol. 18 (12), 2019–2037 (2000).

  121. G. J. Woeginger, “On-line scheduling of jobs with fixed start and end times,” Theor. Comp. Sci. 130, 5– 16 (1994).

  122. W. K. Yeung, C. Oguz, and T. C. E. Cheng, “Single-machine scheduling with a common due window,” Comp. and Oper. Res. 28, 157–175 (2001).

    Article  MathSciNet  MATH  Google Scholar 

  123. Y. Yin, D.-J. Wang, T. C. E. Cheng, and C.-C. Wu, “Bi-criterion single machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times,” J. of the ORS 67 (9), 1169–1183 (2016).

    Google Scholar 

  124. B. Yuce, F. Fruggiero, M. S. Packianather, D. T. Pham, E. Mastrocinque, A. Lambiase, and M. Fera, “Hybrid Genetic Bees Algorithm applied to single machine scheduling with earliness and tardiness penalties,” Comp. and Ind. Eng. 113, 842–858 (2017).

    Article  Google Scholar 

Download references

Funding

The work is supported by the Russian Science Foundation, project no. 14-50-00150.

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems (Kharkevich Institute), Russian Academy of Sciences, 127051, Moscow, Russia

    M. Sh. Levin

Authors
  1. M. Sh. Levin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Sh. Levin.

Ethics declarations

The author declares that he has no conflict of interest.

Additional information

Translated by E. Oborin

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Levin, M.S. Interval Balanced Multiprocessor Scheduling of Modular Jobs. J. Commun. Technol. Electron. 66 (Suppl 1), S35–S52 (2021). https://doi.org/10.1134/S1064226921130064

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064226921130064

Search

Navigation