Log in

Relevant bibliographies by topics / Scheduling / Journal articles

To see the other types of publications on this topic, follow the link: Scheduling.

Journal articles on the topic 'Scheduling'

Author: Grafiati

Published: 4 June 2021

Last updated: 9 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Scheduling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Fithri, Prima, and Fitri Ramawinta. "Penjadwalan Mesin dengan Menggunakan Algoritma Pembangkitan Jadwal Aktif dan Algoritma Penjadwalan Non-Delay untuk Produk Hydrotiller dan Hammermil pada CV. Cherry Sarana Agro." Jurnal Optimasi Sistem Industri 12, no. 2 (April 25, 2016): 377. http://dx.doi.org/10.25077/josi.v12.n2.p377-399.2013.

Full text

Abstract:

Fulfillment of all demands of consumers who come to the product is one thing that always wanted to be achieved by a company. These requests are not independent of the company's ability to manufacture certain products. CV Cherry Sarana Agro manufactures a wide range of agricultural equipment, one of which is the product hydrotiller and hammermil. Demand for both products are always in large numbers for each period, however, the company could not meet the entire demand. One of the main factors that led this small company's production capacity for these two products is not optimal scheduling of machines made by companies, causing many to be a queue on a particular machine so that the total process operating time becomes very large. Scheduling method is used to optimize the scheduling of machines working on the report of this practice is actively scheduling method and the method of non-delay scheduling. The data needed to perform scheduling with both of these methods is the data used machines, data processing operations and data processing time of operation. With these three data, can be compared to the actual scheduling done by the company with the scheduling is done using active scheduling method and the method of non-delay scheduling. The most optimal scheduling is obtained after comparing the three methods used are scheduling using the non-delay scheduling. This method was chosen because the resulting make span is much smaller than the two other methods. This method is well applied in the company because in addition to reducing the total processing time, can also increase production capacity, so that all requests can be met.Keywords: Active schedulling method, non-delay schedulling method, makespan, hydrotiller, hammermil

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Kui, Bu Han Zhang, Jia Jun Zhai, Wen Shao, Xiao Shan Wu, and Cheng Xiong Mao. "Coordination between Short-Term and Real-Time Scheduling Incorporating Wind Power." Advanced Materials Research 512-515 (May 2012): 700–703. http://dx.doi.org/10.4028/www.scientific.net/amr.512-515.700.

Full text

Abstract:

Coordination strategies between short-term (e.g., weekly and daily scheduling ) and real-time scheduling in wind power integrated system are disscussed. To cope with the uncertainty of wind power and load demands, weekly and daily rolling schedulings are applied. According to the latest updated prediction results of wind power and load demands, weekly rolling scheduling is applied to revise unit commitment and fuel allocation in remaining hours in a week. Daily rolling scheduling is applied to revise generation scheduling in remaining time in a day. A modified IEEE 118-bus system is applied to test the proposed approach.

APA, Harvard, Vancouver, ISO, and other styles

3

Jin, Wangkai, and Xiangjun Peng. "SLITS: Sparsity-Lightened Intelligent Thread Scheduling." ACM SIGMETRICS Performance Evaluation Review 51, no. 1 (June 26, 2023): 21–22. http://dx.doi.org/10.1145/3606376.3593568.

Full text

Abstract:

To make the most of hardware resources in multi-core architectures, effective thread scheduling is crucial. To achieve this, various scheduling objectives have been developed, such as reducing hardware resource contention [1, 11], allocating resources evenly for co-running threads [ 5, 6], and following priority-based policies [7]. Current thread scheduling designs can be categorized into two types. The first type involves fixed-rule scheduling1, which does not depend on workload characteristics and cannot meet the needs of different scheduling objectives. The second type takes the scheduling objectives into account by collecting run-time information on threads together with their correlations (e.g., Cache Miss Count [10, 13], Thread IPC [20], dynamic priority requirements like Earliest Deadline First [2 , 8, 17]), and making scheduling decisions based on thread-to-thread interactions. A unified approach to these two types of scheduler designs can be achieved by focusing on Thread-Interaction statistics. To this end, we introduce the Thread-Interaction Matrix (TIM), which stores statistics on thread-to-thread interaction. These statistics can be any type of run-time statistics concerning the thread-to-thread pairs (e.g., Cache Miss Count [10 , 13], Thread IPC [20], dynamic priority requirements like Earliest Deadline First [2 , 8, 17])2. For fixed-rule scheduling, the TIM contains static values as the statistics do not affect the scheduling decisions. Based on the TIM, scheduling policies can be customized by specifying the rules of thread rescheduling, such as reschedule conditions and strategy. Combining the Thread-Interaction Matrix and scheduling policy provides a formalization of existing thread scheduler designs. Therefore, it is essential to design a general scheduler that can be tailored to different scheduling objectives by co-designing the Thread-Interaction Matrix and the scheduling policy in a synergistic manner.

APA, Harvard, Vancouver, ISO, and other styles

4

Kromodihardjo, Sudiyono, and Ergo Swasono Kromodihardjo. "Modeling of Well Service and Workover to Optimize Scheduling of Oil Well Maintenance." Applied Mechanics and Materials 836 (June 2016): 311–16. http://dx.doi.org/10.4028/www.scientific.net/amm.836.311.

Full text

Abstract:

Well maintenance (well service and workover) is an operation needed by oil company to guarantee the optimum productionof its oil well.Well maintenance is performed using large equipment called hydraulic workover unit (HWU-Rig) which is available in limited number. Scheduling sequence of the HWU-Rig to do well service must meet the goal of the maintenance that is to minimize the loss of oil well production due to well breakdown. Thus minimizing breakdown time of well with high rate production is a priority. However, scheduling secuence of the HWU-Rig to perform its task for few days ahead become complicated due to the numerous alternatives of secuence to choose. Each alternatives of sequence yields a certain production loss. Arbitrarily scheduling sequence may not yield the goal og minimizing the loss of well production. This research was done by analyzing workover scheduling system and data from Kondur Petroleum such as well location, well production rate, and service time needed to be performed on wells. Algorithm to create schedulling sequence was developed in the research. The algorithm was then implemented in discrete simulation software, and yield the result of absolute global optimal solution, near optimal solution and local optimal solution of the HWU scheduling problem.

APA, Harvard, Vancouver, ISO, and other styles

5

Thenata, Angelina Pramana, and Andhika Galuh Prabawati. "EVALUATION INFORMATION TECHNOLOGY UTILIZATION OF SCHOOL SUBJECT SCHEDULING USING PIECES FRAMEWORK." Jurnal Terapan Teknologi Informasi 2, no. 1 (July 23, 2018): 53–63. http://dx.doi.org/10.21460/jutei.2018.21.97.

Full text

Abstract:

Abstract— Information technology has been widely used by several aspects, such as in the scope of business, industry, government, education, and service. The use of information technology in various aspects of spatial planning can help in its business process. One of the use of information technology in the field of education is e-learning, scheduling, financial information systems, and others. SMK N 1 Kaliwungu is one of the schools that already utilize information technology, such as Program Scheduling Subject Schedule. The program helps scheduling in its implementation need to be evaluated to improve more accurate objectives. In this study, will be discussed about system scheduling program Lesson using PIECES Framework. The Framework section is one way of ordering systems or applications related to Performance, Information, Economics, Control, Efficiency, Application Services. Theuse of this framework aims to determine theimplementation of scheduling aids program at SMKN1 Kaliwungu works as a support, enabler, ordriver in the utilization of Information Technology. This research using data from interviews,observations on the curriculum and provision ofquestionnaires to 30 teachers SMKN 1 Kaliwungu. The result of the evaluation obtained from this research is the utilization of scheduling aidsprogram can improve the curriculum performance program can improve the curriculum performance and teaching process to be smoothly without anycollision schedule. The results of evaluation in this research can be said that the utilization of auxiliary programscheduling at SMKN 1 Kaliwungu role as an enabler. Keyword ----- Evaluation, Technology Information, PIECESFramework, Schedulling

APA, Harvard, Vancouver, ISO, and other styles

6

Antonova, Anna, Konstantin Aksyonov, and Olga Aksyonova. "An Imitation and Heuristic Method for Scheduling with Subcontracted Resources." Mathematics 9, no. 17 (August 30, 2021): 2098. http://dx.doi.org/10.3390/math9172098.

Full text

Abstract:

A scheduling problem with subcontracted resources is widely spread and is associated with the distribution of limited renewable and non-renewable resources, both own and subcontracted ones based on the work’s due dates and the earliest start time. Scheduling’s goal is to reduce the cost of the subcontracted resources. In the paper, application of a few scheduling methods based on scheduling theory and the optimization algorithm is considered; limitations of these methods’ application are highlighted. It is shown that the use of simulation modeling with heuristic rules for allocation of the renewable resources makes it possible to overcome the identified limitations. A new imitation and heuristic method for solving the assigned scheduling problem is proposed. The comparison of the new method with existing ones in terms of the quality of the found solution and performance of the methods is carried out. A case study is presented that allowed a four-fold reduction of the overall subcontracted resources cost in a real project portfolio.

APA, Harvard, Vancouver, ISO, and other styles

7

hia, M. Sop. "Review on Scheduling-Job Scheduling." International Journal of Engineering Trends and Technology 60, no. 1 (June 25, 2018): 42–44. http://dx.doi.org/10.14445/22315381/ijett-v60p205.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Huijun, and Oliver Sinnen. "List-Scheduling versus Cluster-Scheduling." IEEE Transactions on Parallel and Distributed Systems 29, no. 8 (August 1, 2018): 1736–49. http://dx.doi.org/10.1109/tpds.2018.2808959.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Belmabrouk, Mounira, and Mounir Marrakchi. "Design, analysis and performance evaluation of parallel algorithms for solving triangular linear systems on multicore platforms." RAIRO - Operations Research 55, no. 2 (March 2021): 545–59. http://dx.doi.org/10.1051/ro/2021009.

Full text

Abstract:

In this paper, we focus on the schedulings of 2-steps graph with constant task cost obtained when parallelizing algorithm solving a triangular linear system. We present three scheduling approaches having the same least theoretical execution time. The first is designed through solving a 0-1 integer problem by Mixed Integer Programming (MIP), the second is based on the Critical Path Algorithm (CPA) and the third is a particular Column-Oriented Scheduling (COS). The MIP approach experiments were carried out and confirmed that the makespan values of the MIP scheduling coincide with those of the corresponding lower bound already reached. Experimental results of the last two approaches detailing both makespans and efficiencies are presented and show that their practical performances differ though they are theoretically identical. We compare also these results to those of the appropriate procedure into so-called PLASMA library (Parallel Linear Algebra for Scalable Multi-core Architectures).

APA, Harvard, Vancouver, ISO, and other styles

10

Larco, J. A., J. C. Fransoo, and V. C. S. Wiers. "Scheduling the scheduling task: a time-management perspective on scheduling." Cognition, Technology & Work 20, no. 1 (October 28, 2017): 1–10. http://dx.doi.org/10.1007/s10111-017-0443-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Hamilton, James E. "SCHEDULING." Journal of the American Society for Naval Engineers 58, no. 3 (March 18, 2009): 399–417. http://dx.doi.org/10.1111/j.1559-3584.1946.tb01732.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

de Vries, Tonny T., and Arif A. Anwar. "Irrigation Scheduling Using Complex Machine Scheduling." Journal of Irrigation and Drainage Engineering 141, no. 5 (May 2015): 04014065. http://dx.doi.org/10.1061/(asce)ir.1943-4774.0000824.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Ling, Yibei, and Jie Mi. "An optimal trade-off between content freshness and refresh cost." Journal of Applied Probability 41, no. 3 (September 2004): 721–34. http://dx.doi.org/10.1239/jap/1091543421.

Full text

Abstract:

Caching is an effective mechanism for reducing bandwidth usage and alleviating server load. However, the use of caching entails a compromise between content freshness and refresh cost. Constant refreshing allows a high degree of content freshness at a greater cost of system resource. Conversely, too little refreshing reduces content freshness but saves the cost of resource usage. To address the freshness-cost problem, we formulate the refresh scheduling problem with a generic cost model and use this cost model to determine an optimal refresh frequency that gives the best trade-off between refresh cost and content freshness. We prove the existence and uniqueness of an optimal refresh frequency under the assumptions that the arrival of updated content is Poisson and the age-related cost monotonically increases with decreasing freshness. In addition, we provide an analytic comparison of system performance under fixed refresh scheduling and random refresh scheduling, showing that two refresh schedulings with the same average refresh frequency are mathematically equivalent in terms of the long-run average cost.

APA, Harvard, Vancouver, ISO, and other styles

14

Ling, Yibei, and Jie Mi. "An optimal trade-off between content freshness and refresh cost." Journal of Applied Probability 41, no. 03 (September 2004): 721–34. http://dx.doi.org/10.1017/s0021900200020507.

Full text

Abstract:

Caching is an effective mechanism for reducing bandwidth usage and alleviating server load. However, the use of caching entails a compromise between content freshness and refresh cost. Constant refreshing allows a high degree of content freshness at a greater cost of system resource. Conversely, too little refreshing reduces content freshness but saves the cost of resource usage. To address the freshness-cost problem, we formulate the refresh scheduling problem with a generic cost model and use this cost model to determine an optimal refresh frequency that gives the best trade-off between refresh cost and content freshness. We prove the existence and uniqueness of an optimal refresh frequency under the assumptions that the arrival of updated content is Poisson and the age-related cost monotonically increases with decreasing freshness. In addition, we provide an analytic comparison of system performance under fixed refresh scheduling and random refresh scheduling, showing that two refresh schedulings with the same average refresh frequency are mathematically equivalent in terms of the long-run average cost.

APA, Harvard, Vancouver, ISO, and other styles

15

Asmawar, Mellysa. "USULAN PENJADWALAN PRODUKSI PRODUK ST 37777 PT EBAKO NUSANTARA PADA DEPARTEMEN SMOOTHMILLING UNTUK MEMINIMASI MAKESPAN." J@ti Undip : Jurnal Teknik Industri 13, no. 1 (March 31, 2018): 61. http://dx.doi.org/10.14710/jati.13.1.61-66.

Full text

Abstract:

AbstrakProses produksi ST 37777 di PT Ebako Nusantara menggunakan jadwal yang didasarkan oleh proses-proses yang dilakukan dengan menggunakan data historis yang telah ada dari proses produksi yang telah dilakukan. PT Ebako Nusantara merupakan industri manufaktur yang bergerak di bidang furnitur yang berlokasi di Terboyo, Semarang, Jawa Tengah. Dalam proses produksi ST 37777, terdapat 11 mesin dan 16 job dimana setiap job memiliki urutan mesin yang berbeda. Penjadwalan yang ada untuk produk tipe ST 37777 dengan tipe jobshop belum menerapkan suatu ketetapan dalam penentuan waktu dan urutan pengerjaan mesin yang efektif sehingga masih banyak job yang selesai terlambat. Untuk itu diperlukan suatu penjadwalan mesin yang efektif sehingga dapat memenuhi waktu produksi pesanan sesuai dengan yang telah disepakati. Penjadwalan jobshop diperlukan untuk memaksimumkan efisiensi dan utilitas sumber daya di lantai produksi. Penentuan jadwal mesin ini bertujuan meminimasi makespan dengan menggunakan Software WINQSB modul job schedulling. Metode yang digunakan adalah metode Short Processing Time. Hasil penjadwalan menggunakan Software WINQSB diperoleh makespan menjadi 15 jam dengan hasil penjadwalan tersebut tidak ada job yang terlambat dan semua job dikerjakan berurutan. AbstractThe production process of ST 37777 in PT Ebako Nusantara uses a schedule based on the processes performed using existing historical data from the production process that has been done. PT Ebako Nusantara is a manufacturing industry engaged in furnitur located in Terboyo, Semarang, Central Java. In the production process ST 37777, there are 11 machines and 16 jobs where each job has a different sequence of machines. The existing scheduling for ST 37777 type product with jobshop type has not been applied a determination in the timing and sequence of effective machine work so that many jobs are finished too late. For that required an effective engine scheduling so that it can meet the production time of orders in accordance with the agreed. Jobshop scheduling is needed to maximize efficiency and resource utilities on the production floor. Determination of this machine schedule aims to minimize the makespan using WINQSB Software job scheduling module. The method used is the method of Short Processing Time. The scheduling result using WINQSB software obtained makespan to 15 hours with scheduling result no job is late and all job done in sequence. Keywords: Jobshop Scheduling; Short Processing Time; Makespan Minimization

APA, Harvard, Vancouver, ISO, and other styles

16

IWAMURA, Koji, Yoshitaka TANIMIZU, and Nobuhiro SUGIMURA. "A Study on Real-Time Scheduling of Holonic Manufacturing Systems(Manufacturing systems and Scheduling)." Proceedings of International Conference on Leading Edge Manufacturing in 21st century : LEM21 2005.2 (2005): 421–26. http://dx.doi.org/10.1299/jsmelem.2005.2.421.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

SAKAGUCHI, Tatsuhiko, Yoshitaka TANIMIZU, Tsuyoshi MIYAMAE, Yasuhiro MAEDA, Keiichi SHIRASE, and Nobuhiro SUGIMURA. "Improvement of crossover operator in genetic algorithm for reactive scheduling(Manufacturing systems and Scheduling)." Proceedings of International Conference on Leading Edge Manufacturing in 21st century : LEM21 2005.2 (2005): 427–32. http://dx.doi.org/10.1299/jsmelem.2005.2.427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Xu, Bin-yang, He-ping Pu, and Shao-qian Li. "Scheduling Algorithm Design for Enhanced Scheduling Fairness." Journal of Electronics & Information Technology 30, no. 6 (March 16, 2011): 1462–65. http://dx.doi.org/10.3724/sp.j.1146.2006.01043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Lelchook, Ariel Maya, James E. Martin, and Agnieszka Shepard. ""Sunday Work, Scheduling Preferences, and Scheduling Attitudes"." Academy of Management Proceedings 2013, no. 1 (January 2013): 17237. http://dx.doi.org/10.5465/ambpp.2013.17237abstract.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Vemuri, S., A. B. Ranjit Kumar, and A. Halimah. "Fuel Resource Scheduling??? The Daily Scheduling Problem." IEEE Power Engineering Review PER-5, no. 2 (February 1985): 33–34. http://dx.doi.org/10.1109/mper.1985.5528868.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Verstichel, Jannes, Patrick De Causmaecker, and Greet Vanden Berghe. "Scheduling algorithms for the lock scheduling problem." Procedia - Social and Behavioral Sciences 20 (2011): 806–15. http://dx.doi.org/10.1016/j.sbspro.2011.08.089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Stillwell, Mark, Frederic Vivien, and Henri Casanova. "Dynamic Fractional Resource Scheduling versus Batch Scheduling." IEEE Transactions on Parallel and Distributed Systems 23, no. 3 (March 2012): 521–29. http://dx.doi.org/10.1109/tpds.2011.183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Xu, J., and D. L. Parnas. "Priority Scheduling Versus Pre-Run-Time Scheduling." IFAC Proceedings Volumes 31, no. 14 (June 1998): 53–60. http://dx.doi.org/10.1016/s1474-6670(17)44872-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Burleson, W., J. Ko, D. Niehaus, K. Ramamritham, J. A. Stankovic, G. Wallace, and C. Weems. "The spring scheduling coprocessor: a scheduling accelerator." IEEE Transactions on Very Large Scale Integration (VLSI) Systems 7, no. 1 (March 1999): 38–47. http://dx.doi.org/10.1109/92.748199.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Ranjit Kumar, A., S. Vemuri, and A. Halimah. "Fuel Resource Scheduling The Daily Scheduling Problem." IEEE Transactions on Power Apparatus and Systems PAS-104, no. 2 (February 1985): 313–20. http://dx.doi.org/10.1109/tpas.1985.319045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Kaplansky, Eliezer, and Amnon Meisels. "Distributed personnel scheduling—negotiation among scheduling agents." Annals of Operations Research 155, no. 1 (July 17, 2007): 227–55. http://dx.doi.org/10.1007/s10479-007-0206-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Bai, Yuntao, Di Liu, and Jili Ma. "Centralized scheduling, decentralized scheduling or demand scheduling? How to more effectively allocate and recycle shared takeout lunch boxes." PLOS ONE 20, no. 3 (March 4, 2025): e0319257. https://doi.org/10.1371/journal.pone.0319257.

Full text

Abstract:

Efficient scheduling of shared takeaway containers plays a significant role in the sharing economy system. An effective scheduling system ensures the maximization of container reuse, reducing resource waste and environmental pollution. To explore the applicability of different scheduling models for shared takeaway containers, this paper constructs differential game models for three modes: centralized scheduling, decentralized scheduling, and demand-based scheduling. The equilibrium outcomes are compared and analyzed. The research findings indicate that when the revenue from scheduling takeaway containers is low, decentralized scheduling can yield the maximum benefit for takeaway platforms; conversely, when the revenue is high, centralized scheduling offers the greatest benefit. For restaurant enterprises, when the revenue from scheduling is low, if the cost of scheduling is also low, demand-based scheduling can provide the maximum benefit; however, if the cost is high, decentralized scheduling is more advantageous; otherwise, centralized scheduling can maximize the benefits for restaurant enterprises.

APA, Harvard, Vancouver, ISO, and other styles

28

Setialana, Pradana, Muhamad Rizki Fajri, Abdul Rachman Pambudi, and Ratna Wardani. "ATLAS (Application for Tracking and Scheduling) as Location Guide and Academic Schedulling at Campus YSU (Yogyakarta State University)." International Journal of Computer and Communication Engineering 3, no. 4 (2014): 274–78. http://dx.doi.org/10.7763/ijcce.2014.v3.335.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

You, Wanqing, Kai Qian, and Ying Qian. "Hierarchical Queue-Based Task Scheduling." Journal of Advances in Computer Networks 2, no. 2 (2014): 138–41. http://dx.doi.org/10.7763/jacn.2014.v2.98.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

WU, MIN-YOU. "PARALLEL INCREMENTAL SCHEDULING." Parallel Processing Letters 05, no. 04 (December 1995): 659–70. http://dx.doi.org/10.1142/s0129626495000588.

Full text

Abstract:

Parallel incremental scheduling is a new approach for load balancing. In parallel scheduling, all processors cooperate together to balance the workload. Parallel scheduling accurately balances the load by using global load information. In incremental scheduling, the system scheduling activity alternates with the underlying computation work. This paper provides an overview of parallel incremental scheduling. Different categories of parallel incremental scheduling are discussed.

APA, Harvard, Vancouver, ISO, and other styles

31

Wang, Zhen, Xiaohuan Zhang, and Gang Peng. "An Improved Integrated Scheduling Algorithm with Process Sequence Time-Selective Strategy." Complexity 2021 (March 9, 2021): 1–10. http://dx.doi.org/10.1155/2021/5570575.

Full text

Abstract:

The integrated scheduling algorithm of process sequence time-selective strategy (ISAOPSTSS) is an advanced algorithm in the field of integrated scheduling. The proposed algorithm points out the shortcomings of the process sequence time-selective strategy. Generally, there are too many “trial scheduling” times. The authors propose that there is no need to make “trial scheduling” at every “quasi-scheduling time point.” In fact, the process scheduling scheme can be obtained by trial scheduling on some “quasi-scheduling time points.” The scheduling result is the same as that of the sequence timing strategy. The proposed algorithm reduces the runtime of scheduling algorithm and improves the performance of the algorithm without reducing the optimization effect.

APA, Harvard, Vancouver, ISO, and other styles

32

Selvarajah, Esaignani, and George Steiner. "BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS(Advanced Planning and Scheduling for Supply Chain Management)." Journal of the Operations Research Society of Japan 49, no. 3 (2006): 174–87. http://dx.doi.org/10.15807/jorsj.49.174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Zhang, Fan, Gui Fa Teng, Jian Bin Ma, and Jie Yao. "Research on Multitask Collaborative Scheduling Problem with Heuristic Strategies." Applied Mechanics and Materials 66-68 (July 2011): 758–63. http://dx.doi.org/10.4028/www.scientific.net/amm.66-68.758.

Full text

Abstract:

According to problems existed in the current farm machinery scheduling process, a new farm machinery scheduling scheme is adopted in this dissertation. The collaborative scheduling model of farm machinery is established and multitask collaborative scheduling algorithm is designed through analyzing the differences between Vehicle Scheduling Problem and agricultural machinery scheduling in the dissertation. Earliest Start Time First and minimal resource allocated capacity first strategies are used in the farm machinery scheduling. The algorithm is useful for the case of machinery owner with sufficient farm machinery. The experiment proves that the collaborative scheduling algorithm is more effective than the serial scheduling algorithm.

APA, Harvard, Vancouver, ISO, and other styles

34

Zhu, Ze Lei, Wen Wen Wang, Qiang Li, Cui Hui Yan, and Sai Dai. "Multi-Period Generation Scheduling Optimization Model and its Application." Advanced Materials Research 614-615 (December 2012): 850–56. http://dx.doi.org/10.4028/www.scientific.net/amr.614-615.850.

Full text

Abstract:

Generation scheduling depended on accurate boundary conditions. Before the actual implementation, optimization result of day-ahead schedule was needed to be rolling corrected by two periods of intraday scheduling and real-time scheduling. It was key problem to establish optimization models which adapt to different dispatch period and coordinate different period generation scheduling for to achieving the best optimization results. This paper first discussed coordination mode of different period generation scheduling; Then, the mathematical models were established for day-ahead scheduling, intraday scheduling and real-time scheduling; Day-ahead scheduling and intraday scheduling including SCUC and SCED, intraday scheduling including SCED, and optimization goals were the minimum total cost of generation. In addition to boundary conditions, the difference between day-ahead scheduling and intraday scheduling model was that the optimal range from all units into AGC units; In real-time operation stage, the optimized objective was the minimum deviation between real-time schedule and intraday schedule for AGC units. Through practical application in a provincial, it proves that the proposed model is correct and effective.

APA, Harvard, Vancouver, ISO, and other styles

35

Li, Xiao Wen, Xiang Song Meng, and Li Zeng. "Research on TD-LTE Downlink Packet Scheduling." Applied Mechanics and Materials 513-517 (February 2014): 1067–71. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1067.

Full text

Abstract:

In order to solve the limitations of classical packet scheduling architecture in TD-LTE, the TD-LTE downlink packet scheduling was studied and a architecture of downlink packet scheduling for TD-LTE is designed. The packet scheduling architecture was built and three classic scheduling algorithms were simulated in this architecture by Matlab. The simulation results show that the packet scheduling architecture can be applied to scheduling algorithms with different purposes and verify the performances of throughput and fairness of these three scheduling algorithms.

APA, Harvard, Vancouver, ISO, and other styles

36

Chen, Zai Ping, and Hong Qiao Xu. "Research on Network Control System Using Improved EDF Dynamic Scheduling Algorithm." Advanced Materials Research 403-408 (November 2011): 2420–23. http://dx.doi.org/10.4028/www.scientific.net/amr.403-408.2420.

Full text

Abstract:

In this paper classic static and dynamic scheduling strategy is analyzed first, and then communication network of schedule ability judgment basis is given. An improved dynamic EDF scheduling algorithm is proposed in order to improve the scheduling task of real-time. The scheduling strategy is to change task priority according to the transmission error over deadline task when applying dynamic EDF scheduling strategy. True Time tool is used to build CAN network control system simulation platform. Dynamic EDF scheduling algorithm and improved scheduling algorithm are simulated respectively. The effectiveness of improved scheduling algorithm is verified by the simulation Keywords-Network control system; Scheduling Algorithm; True Time toolbox result.

APA, Harvard, Vancouver, ISO, and other styles

37

Huang, Yuan, Xiu Tian Yan, and Jing Yao Li. "Dual Resource Constrained Job Shop Dynamic Scheduling with Local Time Window." Advanced Materials Research 933 (May 2014): 708–13. http://dx.doi.org/10.4028/www.scientific.net/amr.933.708.

Full text

Abstract:

To solve the Dual Resource Constrained Job Shop Dynamic Scheduling Problem with heterogeneous workers (DRCJDSP-HW),a three-tier dynamic scheduling system including dynamic disturbance analysis, dynamic disturbance evaluation and dynamic scheduling method was constructed based on the idea of scheduling with local time window. To minimize the revision of old scheduling scheme in DRCJDSP-HW, a hybrid dynamic scheduling algorithm was proposed based on the chromosome reduction mechanism and the scheduling optimization of local job in stages. The outstanding application effect of the dynamic scheduling system and the hybrid dynamic scheduling algorithm were validated reducing the influence of dynamic disturbances effectively by simulation experiment at last.

APA, Harvard, Vancouver, ISO, and other styles

38

Huang, Guo Xun, Wei Xiang, Chong Li, Qian Zheng, Shan Zhou, Bing Qian Shen, and Sai Feng Chen. "Surgical Scheduling Based on Hybrid Flow-Shop Scheduling." Applied Mechanics and Materials 201-202 (October 2012): 1004–7. http://dx.doi.org/10.4028/www.scientific.net/amm.201-202.1004.

Full text

Abstract:

The efficient surgical scheduling of the operating theatre plays a significant role in hospital’s income and cost. Currently surgical scheduling only considered the surgery process in operating room and ignored other stages which should not be left out in real situations. The surgical scheduling problem is regarded as the hybrid flow-shop scheduling problem in this study. Each elective surgery which need local anesthesia has to go through a two-stage surgery procedure. Beds and operating rooms are represented as parallel machines. A mathematical model for such surgical scheduling problem is proposed and solved by LINGO. A case study with its optimal solution is also presented to verify the model.

APA, Harvard, Vancouver, ISO, and other styles

39

Tuscano, Tanmay Zakaria, and Bita Astaneh Asl. "Visual versus Tabular Scheduling Programs." Buildings 14, no. 10 (September 26, 2024): 3084. http://dx.doi.org/10.3390/buildings14103084.

Full text

Abstract:

Effective scheduling in construction is crucial for ensuring timely project completion and maintaining budget control. Scheduling programs play an important role in this process by providing digital tools to develop, monitor, and adjust project timelines effectively. In the industry’s current method of practice, tabular scheduling programs are utilized that require users to enter task information and their relationships in a tabular format. Recently, a new scheduling program approach called visual scheduling has emerged that requires users to draw the network diagram to create the schedule. This paper presents an experimental study that evaluated the efficiency of schedule creation using a visual scheduling program compared to two tabular scheduling programs. The results show that the time spent creating a schedule using the visual scheduling program was significantly shorter than using tabular scheduling programs. Participants found visual scheduling easier to define tasks, define correlations, spot mistakes in the schedule, make changes to the schedule, and understand the overall schedule. The majority of the participants reported visual scheduling as a tool that allowed them to create schedules faster. They also found it to be a more intuitive scheduling tool and a method that can reduce the possibility of making mistakes during scheduling.

APA, Harvard, Vancouver, ISO, and other styles

40

Zhao, Anran, Peng Liu, Xiyu Gao, Guotai Huang, Xiuguang Yang, Yuan Ma, Zheyu Xie, and Yunfeng Li. "Data-Mining-Based Real-Time Optimization of the Job Shop Scheduling Problem." Mathematics 10, no. 23 (December 5, 2022): 4608. http://dx.doi.org/10.3390/math10234608.

Full text

Abstract:

In the job-shop scheduling field, timely and proper updating of the original scheduling strategy is an effective way to avoid the negative impact of disturbances on manufacturing. In this paper, a pure reactive scheduling method for updating the scheduling strategy is proposed to deal with the disturbance of the uncertainty of the arrival of new jobs in the job shop. The implementation process is as follows: combine data mining, discrete event simulation, and dispatching rules (DRs), take makespan and machine utilization as scheduling criteria, divide the manufacturing system production period into multiple scheduling subperiods, and build a dynamic scheduling model that assigns DRs to subscheduling periods in real-time; the scheduling strategies are generated at the beginning of each scheduling subperiod. The experiments showed that the method proposed enables a reduction in the makespan of 2–17% and an improvement in the machine utilization of 2–21%. The constructed scheduling model can assign the optimal DR to each scheduling subperiod in real-time, which realizes the purpose of locally updating the scheduling strategy and enhancing the overall scheduling effect of the manufacturing system.

APA, Harvard, Vancouver, ISO, and other styles

41

Middleton, Townsend. "Scheduling tribes." Focaal 2013, no. 65 (March 1, 2013): 13–22. http://dx.doi.org/10.3167/fcl.2013.650102.

Full text

Abstract:

Venturing into an ethnography of government anthropologists themselves, this article interrogates the bureaucratic inner workings and actual agents of today's “ethnographic state." By engaging with the civil servants who verify India's Scheduled Tribes, I explore the politics of “tribal“ recognition from the inside out. This perspective lends timely insight into the logistical, political, and epistemological difficulties integral to the functioning-and current crisis-of India's affirmative action system. Weighing the demands of “tribal“ recognition through those that arguably know them best-government anthropologists themselves- this study examines the human dimension (and dilemmas) of the Indian state and its affirmative action system for Scheduled Tribes.

APA, Harvard, Vancouver, ISO, and other styles

42

Şenyiğit, Ercan. "Ergo-Scheduling." New Trends and Issues Proceedings on Humanities and Social Sciences 4, no. 10 (January 12, 2018): 208–17. http://dx.doi.org/10.18844/prosoc.v4i10.3079.

Full text

Abstract:

In this paper we consider scheduling problem under ergonomic risk factors. We recruit OCRA index to control musculoskeletal disorder along schedule. Modern manufacturing systems competition power depends on cost, time and flexibility level. Despite of high level automation in manufacturing system, flexibility depends on human workforce. From this perspective, for gaining high rate production, workforces have to endure high frequency manual job. This case causes musculoskeletal disorder. Musculoskeletal disorder which had to be control is one of the most important ergonomic risks in work environment. We used OCRA index mean value for ergonomic risk assessment. We also named this new type of scheduling as Ergo-Scheduling. Keywords: Ergonomic risk assessment, scheduling, single machine scheduling, deterioration, OCRA Index;

APA, Harvard, Vancouver, ISO, and other styles

43

Veselý, Pavel. "Packet Scheduling." ACM SIGACT News 52, no. 2 (June 14, 2021): 72–84. http://dx.doi.org/10.1145/3471469.3471481.

Full text

Abstract:

Online packet scheduling with deadlines is one of the fundamental models in buffer management. Recently, the author together with Chrobak, Jez, and Sgall (SODA 2019) designed an optimal ϕ-competitive algorithm for this problem, where ϕ ≈1.618 is the golden ratio. In this column, we sketch ideas that led us to the development of this algorithm and outline the concepts in its analysis. We also highlight open questions in packet scheduling.

APA, Harvard, Vancouver, ISO, and other styles

44

Dieffenbach, Robert M. "Combinatorial Scheduling." Mathematics Teacher 83, no. 4 (April 1990): 269–73. http://dx.doi.org/10.5951/mt.83.4.0269.

Full text

Abstract:

Small projects like putting up a swing set and big projects like building a house all consist of interrelated tasks. Some of these tasks must be done in sequence, but often several tasks can be going on at once.

APA, Harvard, Vancouver, ISO, and other styles

45

Maggio, Martina, Federico Terraneo, and Alberto Leva. "Task scheduling." ACM Transactions on Embedded Computing Systems 13, no. 4 (December 5, 2014): 1–22. http://dx.doi.org/10.1145/2560015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Johns, Stuart, and Peter Brucker. "Scheduling Algorithms." Journal of the Operational Research Society 47, no. 8 (August 1996): 1077. http://dx.doi.org/10.2307/3010416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Aubin, Jean. "Scheduling Ambulances." Interfaces 22, no. 2 (April 1992): 1–10. http://dx.doi.org/10.1287/inte.22.2.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Mahlke, Scott A., William Y. Chen, Roger A. Bringmann, Richard E. Hank, Wen-Mei W. Hwu, B. Ramakrishna Rau, and Michael S. Schlansker. "Sentinel scheduling." ACM Transactions on Computer Systems 11, no. 4 (November 1993): 376–408. http://dx.doi.org/10.1145/161541.159765.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

GUPTA, S. M., and K. N. TALEB. "Scheduling disassembly." International Journal of Production Research 32, no. 8 (August 1994): 1857–66. http://dx.doi.org/10.1080/00207549408957046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Xia, Feng, Guosong Tian, and Youxian Sun. "Feedback scheduling." ACM SIGPLAN Notices 42, no. 12 (December 2007): 7–14. http://dx.doi.org/10.1145/1341752.1341753.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!