Browse > Article
http://dx.doi.org/10.22156/CS4SMB.2019.9.12.124

Periodic Scheduling Problem on Parallel Machines  

Joo, Un Gi (Department of Industrial and Management Engineering, Sun Moon University)
Publication Information
Journal of Convergence for Information Technology / v.9, no.12, 2019 , pp. 124-132 More about this Journal
Abstract
Scheduling problems can be classified into offline and online ones. This paper considers an online scheduling problem to minimize makespan on the identical parallel machines. For dynamically arrived jobs with their ready times, we show that the sequencing order according to the ERD (Earliest Ready Date) rule is optimal to minimize makespan. This paper suggests an algorithm by using the MIP(Mixed Integer Programming) formulation periodically to find a good periodic schedule and evaluates the required computational time and resulted makespan of the algorithm. The comparition with an offline scheduling shows our algorithm makes the schedule very fast and the makespan can be reduced as the period time reduction, so we can conclude that our algorithm is useful for scheduling the jobs under online environment even though the number of jobs and machines is large. We expect that the algorithm is invaluable one to find good schedules for the smart factory and online scheduler using the blockchain mechanism.
Keywords
Periodic Scheduling; Makespan; ERD; MIP formulation; Online; Blockchain;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 D. Gupta & C. T. Maravelias. (2019), Online Scheduling: Understanding the Impact of Uncertainty. IFAC PapersOnLine, 52-1, 727-732.   DOI
2 L. F. Bittencourt, A. Goldman, E. R. M. Madeira, N. L. S. da Fonseca & R. Sakellariou. (2018), Scheduling in Distributed Systems: a Cloud Computing Perspective. Computer Science Review, 30, 31-54.   DOI
3 A. R. Arunarani, D. Manjula & V. Sugumaran. (2019). Task Scheduling Techniques in Cloud Computing: a Literature Survey. Future Generation Computer Systems, 91, 407-415.   DOI
4 L. Yang. (2019). The Blockchain: State-of-the-art and Research Challenges. Journal of Industrial Information Integration. DOI : 10.1016/j.jii.2019.04.002.
5 E. Levner, V. Kats, D. A. L. de Pablo & T. C. E. Cheng. (2010), Complexity of Cyclic Scheduling Problems: a State-of-the-art Survey. Computer and Industrial Engineering, 59, 352-361.   DOI
6 P. Perez-Gonzalez & J. M. Framinan. (2018). Single Machine Scheduling with Periodic Machine Availability. Computer and Industrial Engineering, 123, 180-188.   DOI
7 A. H. G. Rinnooy Kan. (1976), Machine Scheduling Problems - Classification, Complexity and Computations, Martinus Nijhoff.
8 U. G. Joo. (2018), Makespan Minimization Scheduling Problem with Energy-efficient Turning On/Off Mechanism. Journal of the Korean Institute of Industrial Engineers, 41(5), 1-8.   DOI
9 A. Reyna, C. Martin, J. Chen, E. Soler & M. Diaz. (2018). On Blockchain and Its Integration with IoT. Challenges and Opportunities, Future Generation Computer Systems, 88, 173-190.   DOI
10 I. Makhdoom, M. Abolhasan, H. Abbas & W. Ni. (2019). Blockchain's Adoption in IoT: the Challenges, and a way Forward. Journal of Network and Computer Applications, 125, 251-279.   DOI
11 LINDO Systems Inc. (2019). LINGO: The Modeling Language and Optimizer. http://lindo.com/index.php/help/user-manuals, accessed in 2019.
12 S. Albers & M. Hellwig. (2012). Semi-online Scheduling Revisited. Theoretical Computer Science, 443, 1-9.   DOI
13 J. H. Lee & H. K. Nam. (2017), A Implementation of Blockchain based Manufacturing Supply Chain Tracking System. Journal of Korea Safety Management Science, 19(4), 183-188.   DOI
14 Y. J. Lee & S. H. Lee. (2018), Efficient RBAC based on Block Chain for Entities in Smart Factory. Journal of the Korea Convergence Society, 9(7), 69-75.   DOI