Log in

Relevant bibliographies by topics / Dynamic scheduling / Journal articles

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

Journal articles on the topic 'Dynamic scheduling'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 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 'Dynamic 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

Pan, Ying, Dong Juan Xue, Tian Yi Gao, Li Bin Zhou, and Xiao Yu Xie. "Modeling and Scheme Generation of Dynamic Flexible Job-Shop Scheduling." Applied Mechanics and Materials 423-426 (September 2013): 2232–36. http://dx.doi.org/10.4028/www.scientific.net/amm.423-426.2232.

Full text

Abstract:

Aiming at uncertain information and dynamic characteristic during flexible job-shop scheduling process, some kind of dynamic scheduling method for flexible job-shop scheduling problem (FJSP) is put forward based on real-time adjustment. A dynamic simulation solution mode framework is presented for FJSP. This framework is inspired by adaptive control, combined with the robust scheduling and foreseeing scheduling. It has both advantages of such two scheduling methods, and its stable and highly efficient. Preliminary scheme generation method based on foreseeing dynamics scheduling is introduced t

APA, Harvard, Vancouver, ISO, and other styles

2

Jiang, Hai, and Cynthia Barnhart. "Dynamic Airline Scheduling." Transportation Science 43, no. 3 (2009): 336–54. http://dx.doi.org/10.1287/trsc.1090.0269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yau, C. "Dynamic flight scheduling." Omega 17, no. 6 (1989): 533–42. http://dx.doi.org/10.1016/0305-0483(89)90057-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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 schedul

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Eliaz, Kfir, Daniel Fershtman, and Alexander Frug. "On Optimal Scheduling." American Economic Journal: Microeconomics 16, no. 4 (2024): 475–522. http://dx.doi.org/10.1257/mic.20230169.

Full text

Abstract:

We consider a decision-maker sequentially choosing among alternatives when periodic payoffs depend on both chosen and unchosen alternatives in that period. We show that when flow payoffs are the sum or product of payoffs from chosen and unchosen alternatives, the optimal policy is an index policy. We characterize key properties of the optimal dynamics and present an algorithm for computing the indices explicitly. Furthermore, we use the results to generalize Weitzman’s (1979) classic “Pandora’s boxes” problem to allow for complementarities. We illustrate the framework’s usefulness through appl

APA, Harvard, Vancouver, ISO, and other styles

7

Undozerov, Vadim. "Dynamic scheduling in construction projects." E3S Web of Conferences 457 (2023): 02044. http://dx.doi.org/10.1051/e3sconf/202345702044.

Full text

Abstract:

The aim of the study is to investigate the theoretical foundations of dynamic scheduling in construction projects and provide some recommendations for further research. While the theory of "static" scheduling is the most developed, much less attention is paid to "dynamic" scheduling. At the same time, research shows that "dynamic" scheduling is most suitable for construction industry, especially for complex and large projects. To achieve the aim of the study, such tasks as (1) the formulation of the problem associated with insufficient elaboration scheduling dynamism and complexity issues in c

APA, Harvard, Vancouver, ISO, and other styles

8

Cheng, Mingang, Hiromi Itoh Ozaku, Noriaki Kuwahara, Kiyoshi Kogure, and Jun Ota. "Dynamic Scheduling in Inpatient Nursing." International Journal of Automation Technology 3, no. 2 (2009): 174–84. http://dx.doi.org/10.20965/ijat.2009.p0174.

Full text

Abstract:

To shorten the notoriously long waits for service in hospitals in Japan and to improve efficiency, we propose a scheduling algorithm with a 2-layer local search based on simulated annealing -- permutating (switching) (i) tasks among nurses and (ii) subtasks on each nurse. The scheduling algorithm generates a solution initializing our proposed dynamic scheduling to iteratively generate new, feasible schedules based on the scheduling algorithm to accommodate interruptions while preventing nurses' work hours from increasing. To verify the effectiveness of our proposed scheduling, we executed a se

APA, Harvard, Vancouver, ISO, and other styles

9

M, Dhipa, Nisha Rathore, Pravin Prakash Adivarekar, and Shams Tabrez Siddiqui. "ENHANCING ENERGY EFFICIENCY IN SENSOR/AD-HOC NETWORKS THROUGH DYNAMIC SLEEP SCHEDULING." ICTACT Journal on Communication Technology 14, no. 3 (2023): 2974–81. http://dx.doi.org/10.21917/ijct.2023.0442.

Full text

Abstract:

Enhancing energy efficiency is a pivotal concern in sensor/ad-hoc networks, where devices are often constrained by limited power sources. Dynamic sleep scheduling emerges as a promising strategy to mitigate energy wastage and prolong network longevity. This approach involves orchestrating nodes to periodically transition between active and low-power sleep modes, aligning with data transmission requirements. Dynamic sleep scheduling optimizes energy usage, curbing the power-hungry nature of constant operation. This abstract explores the core concepts and applications of dynamic sleep scheduling

APA, Harvard, Vancouver, ISO, and other styles

10

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 e

APA, Harvard, Vancouver, ISO, and other styles

11

Qin, Ling, and Shu Lin Kan. "Production Dynamic Scheduling among Factories Based on Multi-Agent." Advanced Materials Research 466-467 (February 2012): 1386–91. http://dx.doi.org/10.4028/www.scientific.net/amr.466-467.1386.

Full text

Abstract:

To solve fluctuation problem in production plan and scheduling among factories, a logic framework of production dynamic scheduling among factories based on multi-agent technology was constructed. In this framework, the production dynamic scheduling multi-agent negotiation rules and mechanism among factories were established. Furthermore, the production dynamic scheduling multi-agent negotiation procedure among factories was investigated. Finally, the simulation system of production dynamic scheduling among factories based on multi-agent is demonstrated and validated by Flexsim software. It has

APA, Harvard, Vancouver, ISO, and other styles

12

Zhang, Shi Hai, Zi Miao Zhang, and Zhong Min Wang. "Research on Gain Scheduling Control of Online Dynamic Balance for Flexible Spindle." Applied Mechanics and Materials 488-489 (January 2014): 1083–86. http://dx.doi.org/10.4028/www.scientific.net/amm.488-489.1083.

Full text

Abstract:

The gain scheduling control is widely used in the system, whose dynamics parameters change with the operating conditions. In order to adapt the dynamic parameter variety of the high-speed and flexible spindle, the gain scheduling control method is applied to control the unbalance vectors of the correcting faces. The algorithm principle of gain scheduling control and its control method are given in the paper. The flexible spindle experiment system is designed to test the dynamic balance effect of gain scheduling control method. The experiment result indicates that the unbalance vectors of the c

APA, Harvard, Vancouver, ISO, and other styles

13

Ivanov, D., and B. Sokolov. "Dynamic supply chain scheduling." Journal of Scheduling 15, no. 2 (2010): 201–16. http://dx.doi.org/10.1007/s10951-010-0189-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Agnetis, Alessandro, Stanisław Gawiejnowicz, Bertrand Miao-Tsong Lin, and Gur Mosheiov. "Editorial: Dynamic Scheduling Problems." Journal of Scheduling 23, no. 6 (2020): 629–30. http://dx.doi.org/10.1007/s10951-020-00673-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Taunton, J. C., and C. M. Ready. "Intelligent dynamic production scheduling." Food Research International 27, no. 2 (1994): 111–16. http://dx.doi.org/10.1016/0963-9969(94)90151-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

He, Dong Feng, Ai Jun Xu, Gang Yu, and Nai Yuan Tian. "Dynamic Scheduling Method for Steelmaking-Continuous Casting." Applied Mechanics and Materials 44-47 (December 2010): 2162–67. http://dx.doi.org/10.4028/www.scientific.net/amm.44-47.2162.

Full text

Abstract:

A method of dynamic scheduling of steelmaking-continuous casting is proposed, which includes static scheduling based on genetic algorithm and dynamic scheduling based on scheduling rules, mathematical model and complete rescheduling utilizing genetic algorithm. The simulation with eight hours’ production data in S steel plant showed that the method could draw quickly a high quality and performable dynamic scheduling plan according to random production disturbance. The average utilization rate of converter could reach 95% and the generation period of initial scheduling is less than 3 minutes. T

APA, Harvard, Vancouver, ISO, and other styles

17

Hui, Ji Zhuang, Xiang Ding, and Kai Gao. "A FMS Dynamic Scheduling Optimization Strategy and Simulation Research." Applied Mechanics and Materials 389 (August 2013): 692–97. http://dx.doi.org/10.4028/www.scientific.net/amm.389.692.

Full text

Abstract:

This paper studied the FMS dynamic scheduling problem which was based on Petri net FMS static scheduling optimization algorithm, which in accorder to solve the FMS actual production scheduling problems. A rolling window dynamic re-scheduling strategy was proposed which based on event driven and cycle driven. Then take the emergency machine failure often appearing in the actual workshop for example, this scheduling strategy was analyzed and applied to dynamic simulation and finally the effectiveness of the dynamic scheduling strategy was verified.

APA, Harvard, Vancouver, ISO, and other styles

18

Serpanos, Dimitrios N., Asser N. Tantawi, and Ahmed N. Tantawy. "Credit scheduling: adaptive scheduling with dynamic service quota." Computer Communications 21, no. 10 (1998): 889–97. http://dx.doi.org/10.1016/s0140-3664(98)00141-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Pan, Ying, Dong Juan Xue, Tian Yi Gao, Li Bin Zhou, and Xiao Yu Xie. "Research on Strategy of Dynamic Flexible Job-Shop Scheduling." Applied Mechanics and Materials 423-426 (September 2013): 2237–43. http://dx.doi.org/10.4028/www.scientific.net/amm.423-426.2237.

Full text

Abstract:

A dynamic scheduling method for FJSP is put forward based on real-time adjustment of controllable margin, aiming at uncertain information and dynamic characteristic during practical job-shop scheduling process. Strategy and methods of dynamic scheduling adjustment are presented, which respond to real-time event. In view of practical operation condition and accuracy demands, two methods are proposed. One is rescheduling that condenses domain, the other is scheduling updating based on adjustment. Such strategy obtains dynamic robust scheduling of FJSP to ensure the real-time of algorithm, contin

APA, Harvard, Vancouver, ISO, and other styles

20

Li, Wei, Furong Tian, and Ke Li. "Fitness Distance Correlation Strategy for Solving the RGV Dynamic Scheduling Problem." International Journal of Cognitive Informatics and Natural Intelligence 14, no. 3 (2020): 20–40. http://dx.doi.org/10.4018/ijcini.2020070102.

Full text

Abstract:

Rail guide vehicle (RGV) problems have the characteristics of fast running, stable performance, and high automation. RGV dynamic scheduling has a great impact on the working efficiency of an entire automated warehouse. However, the relative intelligent optimization research of different workshop components for RGV dynamic scheduling problems are insufficient scheduling in the previous works. They appear idle when waiting, resulting in reduced operating efficiency during operation. This article proposes a new distance landscape strategy for the RGV dynamic scheduling problems. In order to solve

APA, Harvard, Vancouver, ISO, and other styles

21

Zhuang, Shufeng, Zhendong Yin, Zhilu Wu, and Xiaoguang Chen. "Dynamic Relay Satellite Scheduling Based on ABC-TOPSIS Algorithm." Mathematical Problems in Engineering 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/3161069.

Full text

Abstract:

Tracking and Data Relay Satellite System (TDRSS) is a space-based telemetry, tracking, and command system, which represents a research field of the international communication. The issue of the dynamic relay satellite scheduling, which focuses on assigning time resource to user tasks, has been an important concern in the TDRSS system. In this paper, the focus of study is on the dynamic relay satellite scheduling, whose detailed process consists of two steps: the initial relay satellite scheduling and the selection of dynamic scheduling schemes. To solve the dynamic scheduling problem, a new sc

APA, Harvard, Vancouver, ISO, and other styles

22

Fang, Jie, and Hong Shan Xia. "Aircraft Dynamic Scheduling Algorithm Research Based on Heuristic Column Generation Algorithm." Applied Mechanics and Materials 411-414 (September 2013): 2364–68. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.2364.

Full text

Abstract:

Aircraft dynamic scheduling affects the operation efficiency and flight benefits. Airlines make a rational organization of surplus aircraft to generate the best scheduling solution. The present research constructs an aircraft dynamic scheduling network diagram, define the surplus aircrafts available routings and create aircraft dynamic scheduling mathematical model. Through a mixture column generation algorithm with heuristic methods, the research find the routings in the optimal aircraft dynamic scheduling program. The given instance verifies the model and algorithm generate reasonable and pr

APA, Harvard, Vancouver, ISO, and other styles

23

Khamooshi, Homayoun. "Dynamic Priority–Dynamic Programming Scheduling Method (DP)2SM: a dynamic approach to resource constraint project scheduling." International Journal of Project Management 17, no. 6 (1999): 383–91. http://dx.doi.org/10.1016/s0263-7863(98)00052-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Zhang, Chenlu, and Ruijuan Zheng. "Event-driven dynamic Job-shop scheduling method with strong process constraints." Journal of Computing and Electronic Information Management 10, no. 3 (2023): 72–79. http://dx.doi.org/10.54097/jceim.v10i3.8705.

Full text

Abstract:

In the actual production environment, there are many uncertainties that need to be handled. Since the occurrence time and frequency of dynamic events cannot be predicted, frequent global scheduling calculation will cause waste of time and resources. Therefore, facing the challenge of job shop scheduling problem in dynamic scenarios, this paper studied the dynamic event-driven job shop scheduling problem with complex process constraints, and proposed an improved NSGAII algorithm. At the end of this paper, the designed dynamic scheduling method is applied to a variety of benchmarks through exper

APA, Harvard, Vancouver, ISO, and other styles

25

Takuma, Hikida, Nishikawa Hiroki, and Tomiyama Hiroyuki. "Heuristic algorithms for dynamic scheduling of moldable tasks in multicore embedded systems." International Journal of Reconfigurable and Embedded Systems 10, no. 3 (2021): 157–67. https://doi.org/10.11591/ijres.v10.i3.pp157-167.

Full text

Abstract:

Dynamic scheduling of parallel tasks is one of the efficient techniques to achieve high performance in multicore systems. Most existing algorithms for dynamic task scheduling assume that a task runs on one of the multiple cores or a fixed number of cores. Existing researches on dynamic task scheduling methods have evaluated their methods in different experimental environments and models. In this paper, the dynamic task scheduling methods are systematically rearranged and evaluated.

APA, Harvard, Vancouver, ISO, and other styles

26

Ahmad, Ishfaq. "Editorial: Resource management in parallel and distributed systems with dynamic scheduling: Dynamic scheduling." Concurrency: Practice and Experience 7, no. 7 (1995): 587–90. http://dx.doi.org/10.1002/cpe.4330070702.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Jin, Wangkai, and Xiangjun Peng. "SLITS: Sparsity-Lightened Intelligent Thread Scheduling." ACM SIGMETRICS Performance Evaluation Review 51, no. 1 (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

APA, Harvard, Vancouver, ISO, and other styles

28

Hikida, Takuma, Hiroki Nishikawa, and Hiroyuki Tomiyama. "Heuristic algorithms for dynamic scheduling of moldable tasks in multicore embedded systems." International Journal of Reconfigurable and Embedded Systems (IJRES) 10, no. 3 (2021): 157. http://dx.doi.org/10.11591/ijres.v10.i3.pp157-167.

Full text

Abstract:

Dynamic scheduling of parallel tasks is one of the efficient techniques to achieve high performance in multicore systems. Most existing algorithms for dynamic task scheduling assume that a task runs on one of the multiple cores or a fixed number of cores. Existing researches on dynamic task scheduling methods have evaluated their methods in different experimental environments and models. In this paper, the dynamic task scheduling methods are systematically rearranged and evaluated.

APA, Harvard, Vancouver, ISO, and other styles

29

PALIS, MICHAEL A., JING-CHIOU LIOU, SANGUTHEVAR RAJASEKARAN, SUNIL SHENDE, and DAVID S. L. WEI. "ONLINE SCHEDULING OF DYNAMIC TREES." Parallel Processing Letters 05, no. 04 (1995): 635–46. http://dx.doi.org/10.1142/s0129626495000564.

Full text

Abstract:

The scheduling problem for dynamic tree-structured task graphs is studied and is shown to be inherently more difficult than the static case. It is shown that any online scheduling algorithm, deterministic or randomized, has competitive ratio Ω((1/g)/ log d(1/g)) for trees with granularity g and degree at most d. On the other hand, it is known that static trees with arbitrary granularity can be scheduled to within twice the optimal schedule. It is also shown that the lower bound is tight: there is a deterministic online tree scheduling algorithm that has competitive ratio O((1/g)/ log d(1/g)).

APA, Harvard, Vancouver, ISO, and other styles

30

Yang, Shengluo, Zhigang Xu, and Junyi Wang. "Intelligent Decision-Making of Scheduling for Dynamic Permutation Flowshop via Deep Reinforcement Learning." Sensors 21, no. 3 (2021): 1019. http://dx.doi.org/10.3390/s21031019.

Full text

Abstract:

Dynamic scheduling problems have been receiving increasing attention in recent years due to their practical implications. To realize real-time and the intelligent decision-making of dynamic scheduling, we studied dynamic permutation flowshop scheduling problem (PFSP) with new job arrival using deep reinforcement learning (DRL). A system architecture for solving dynamic PFSP using DRL is proposed, and the mathematical model to minimize total tardiness cost is established. Additionally, the intelligent scheduling system based on DRL is modeled, with state features, actions, and reward designed.

APA, Harvard, Vancouver, ISO, and other styles

31

Wang, Yajun, Junyu Leng, Xiaoqi Liu, Jiajia Wang, and Qiunan Meng. "A Method for Dynamic Insertion Order Scheduling in Flexible Job Shops Based on Digital Twins." Applied Sciences 12, no. 23 (2022): 12430. http://dx.doi.org/10.3390/app122312430.

Full text

Abstract:

Various production disturbances occurring in the flexible job shop production process may affect the production of the workshop, some of which may lead to the prolongation of production completion time. Therefore, a flexible job shop dynamic scheduling method based on digital twins is proposed and a dynamic scheduling framework is constructed. Compared with the traditional workshop, the digital twin-based flexible job shop can upload the relevant production data of the physical workshop to the data management center in real time, and after fusion processing the data can work cooperatively with

APA, Harvard, Vancouver, ISO, and other styles

32

Liu, Yong Xian, J. Xiong, and B. M. Sun. "Research on Dynamic Scheduling of Job-Shop Production with the Ant Colony Optimal Algorithm." Applied Mechanics and Materials 10-12 (December 2007): 109–13. http://dx.doi.org/10.4028/www.scientific.net/amm.10-12.109.

Full text

Abstract:

Job-shop dynamic scheduling is an important subject in the fields of production management and combinatorial optimization. It is usually hard to achieve the optimal solution with classical methods due to the high computational complexity of the problem. A solution of job-shop scheduling problem based on multi-agent is presented for the comparability between the dynamic scheduling problem of job-shop production and the TSP problem. The dynamic scheduling of job-shop production is designed according to the pattern of TSP problem which can be applied with ACO. By the application case, the ACO is

APA, Harvard, Vancouver, ISO, and other styles

33

Terekhov, D., T. T. Tran, D. G. Down, and J. C. Beck. "Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems." Journal of Artificial Intelligence Research 50 (July 22, 2014): 535–72. http://dx.doi.org/10.1613/jair.4278.

Full text

Abstract:

Dynamic scheduling problems consist of both challenging combinatorics, as found in classical scheduling problems, and stochastics due to uncertainty about the arrival times, resource requirements, and processing times of jobs. To address these two challenges, we investigate the integration of queueing theory and scheduling. The former reasons about long-run stochastic system characteristics, whereas the latter typically deals with short-term combinatorics. We investigate two simple problems to isolate the core differences and potential synergies between the two approaches: a two-machine dynami

APA, Harvard, Vancouver, ISO, and other styles

34

Miao, Weiwei, Zeng Zeng, Rui Zhang, and Zesheng Xi. "A Dynamic Scheduling Algorithm Based on Endogenous Security." Journal of Physics: Conference Series 2306, no. 1 (2022): 012004. http://dx.doi.org/10.1088/1742-6596/2306/1/012004.

Full text

Abstract:

Abstract Endogenous security enables the network to have its own immunity against various known and unknown attacks. The redundant executive scheduling strategy is an important link, which determines the security and reliability of the architecture. The existing scheduling strategy lacks consideration of scheduling time and the number of executors, and does not flexibly utilize attack feedback information. They are relatively simple and lack of security to a certain extent. Based on this, this paper proposes a dynamic scheduling algorithm by introducing the consideration of scheduling attribut

APA, Harvard, Vancouver, ISO, and other styles

35

K.T., Vinod, S. Prabagaran, and O. A. Joseph. "Dynamic due date assignment method." Journal of Manufacturing Technology Management 30, no. 6 (2019): 987–1003. http://dx.doi.org/10.1108/jmtm-06-2017-0112.

Full text

Abstract:

Purpose The purpose of this paper is to determine the interaction between dynamic due date assignment methods and scheduling decision rules in a typical dynamic job shop production system in which setup times are sequence dependent. Two due date assignment methods and six scheduling rules are considered for detailed investigation. The scheduling rules include two new rules which are modifications of the existing rules. The performance of the job shop system is evaluated using various measures related to flow time and tardiness. Design/methodology/approach A discrete-event simulation model is d

APA, Harvard, Vancouver, ISO, and other styles

36

Yuan, Lulu. "Dynamic Scheduling of Multi-agent Electromechanical Production Lines based on Iterative Algorithms." Scalable Computing: Practice and Experience 25, no. 3 (2024): 1491–98. http://dx.doi.org/10.12694/scpe.v25i3.2660.

Full text

Abstract:

In response to the optimization scheduling problem in the dyeing production process, the author proposes a hierarchical scheduling method for dyeing vats based on genetic algorithm and multi-agent. In this method, a hierarchical scheduling algorithm is used to decompose production scheduling into static and dynamic strategies. The static strategy adopts a genetic algorithm that supports batch processing of multiple products, non equality of equipment, order delivery time, switching cost, and other constraints: Dynamic strategy is a coordinated dynamic optimization algorithm that uses multi-age

APA, Harvard, Vancouver, ISO, and other styles

37

Yang, Zhong, Li Bi, and Xiaogang Jiao. "Combining Reinforcement Learning Algorithms with Graph Neural Networks to Solve Dynamic Job Shop Scheduling Problems." Processes 11, no. 5 (2023): 1571. http://dx.doi.org/10.3390/pr11051571.

Full text

Abstract:

Smart factories have attracted a lot of attention from scholars for intelligent scheduling problems due to the complexity and dynamics of their production processes. The dynamic job shop scheduling problem (DJSP), as one of the intelligent scheduling problems, aims to make an optimized scheduling decision sequence based on the real-time dynamic job shop environment. The traditional reinforcement learning (RL) method converts the scheduling problem with a Markov process and combines its own reward method to obtain scheduling sequences in different real-time shop states. However, the definition

APA, Harvard, Vancouver, ISO, and other styles

38

Nwadigo, Okechukwu Bruno-Kizito, Nicola Naismith, Ali GhaffarianHoseini, Amirhosein GhaffarianHoseini, and John Tookey. "Construction project planning and scheduling as a dynamic system: a content analysis of the current status, technologies and forward action." Smart and Sustainable Built Environment 11, no. 4 (2021): 972–95. http://dx.doi.org/10.1108/sasbe-02-2021-0022.

Full text

Abstract:

PurposeDynamic planning and scheduling forms a widely adopted smart strategy for solving real-world problems in diverse business systems. This paper uses deductive content analysis to explore secondary data from previous studies in dynamic planning and scheduling to draw conclusions on its current status, forward action and research needs in construction management.Design/methodology/approachThe authors searched academic databases using planning and scheduling keywords without a periodic setting. This research collected secondary data from the database to draw an objective comparison of catego

APA, Harvard, Vancouver, ISO, and other styles

39

Wang, Chun, Jiapeng Chen, Binzi Xu, and Sheng Liu. "A Discrete Improved Gray Wolf Optimization Algorithm for Dynamic Distributed Flexible Job Shop Scheduling Considering Random Job Arrivals and Machine Breakdowns." Processes 13, no. 7 (2025): 1987. https://doi.org/10.3390/pr13071987.

Full text

Abstract:

Dueto uncertainties in real-world production, dynamic factors have become increasingly critical in the research of distributed flexible job shop scheduling problems. Effectively responding to dynamic events can significantly enhance the adaptability and quality of scheduling solutions, thereby improving the resilience of manufacturing systems. This study addresses the dynamic distributed flexible job shop scheduling problem, which involves random job arrivals and machine breakdowns, and proposes an effective discrete improved gray wolf optimization (DIGWO) algorithm-based predictive–reactive m

APA, Harvard, Vancouver, ISO, and other styles

40

RUHLUSARAÇ, Murat, and Filiz ÇALIŞKAN. "A MATHEMATICAL MODEL FOR DYNAMIC PROJECT SCHEDULING PROBLEM AND REACTIVE SCHEDULING IMPLEMENTATION." Business & Management Studies: An International Journal 8, no. 4 (2020): 83–97. http://dx.doi.org/10.15295/bmij.v8i4.1708.

Full text

Abstract:

In today's real-life implementations, projects are executed under uncertainty in a dynamic environment. In addition to resource constraints, the baseline schedule is affected due to the unpredictability of the dynamic environment. Uncertainty-based dynamic events experienced during project execution may change the baseline schedule partially or substantially and require projects' rescheduling. In this study, a mixed-integer linear programming model is proposed for the dynamic resource-constrained project scheduling problem. Three dynamic situation scenarios are solved with the proposed model,

APA, Harvard, Vancouver, ISO, and other styles

41

Dishan, Qiu, He Chuan, Liu Jin, and Ma Manhao. "A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy." Scientific World Journal 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/304047.

Full text

Abstract:

Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose th

APA, Harvard, Vancouver, ISO, and other styles

42

Najam, Aaima, Faizan Ahmad, and Zeeshan Ahmed. "Dynamic-Model Assembly Line Scheduling." Research Journal of Applied Sciences, Engineering and Technology 6, no. 8 (2013): 1446–49. http://dx.doi.org/10.19026/rjaset.6.3968.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Farach-Colton, Martín, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves Caro. "Dynamic Windows Scheduling with Reallocation." ACM Journal of Experimental Algorithmics 26 (July 8, 2021): 1–19. http://dx.doi.org/10.1145/3462208.

Full text

Abstract:

We consider the Windows Scheduling (WS) problem, which is a restricted version of Unit-Fractions Bin Packing, and it is also called Inventory Replenishment in the context of Supply Chain. In brief, WS problem is to schedule the use of communication channels to clients. Each client c i is characterized by an active cycle and a window w i . During the period of time that any given client c i is active, there must be at least one transmission from c i scheduled in any w i consecutive time slots, but at most one transmission can be carried out in each channel per time slot. The goal is to minimize

APA, Harvard, Vancouver, ISO, and other styles

44

Rennie, R. M., and E. J. Jumper. "Dynamic Leading-Edge Flap Scheduling." Journal of Aircraft 34, no. 5 (1997): 606–11. http://dx.doi.org/10.2514/2.2236.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Allahverdi, Ali, and G. M. Koole. "Stochastic Scheduling and Dynamic Programming." Journal of the Operational Research Society 47, no. 10 (1996): 1313. http://dx.doi.org/10.2307/3010046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Mauergauz, Yuri. "Dynamic group job shop scheduling." International Journal of Management Science and Engineering Management 10, no. 1 (2014): 41–49. http://dx.doi.org/10.1080/17509653.2014.952360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Bolychevsky, A., C. R. Jesshope, and V. B. Muchnick. "Dynamic scheduling in RISC architectures." IEE Proceedings - Computers and Digital Techniques 143, no. 5 (1996): 309. http://dx.doi.org/10.1049/ip-cdt:19960788.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Jin, Xin, Hongqiang Harry Liu, Rohan Gandhi, et al. "Dynamic scheduling of network updates." ACM SIGCOMM Computer Communication Review 44, no. 4 (2015): 539–50. http://dx.doi.org/10.1145/2740070.2626307.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Allahverdi, Ali. "Stochastic Scheduling and Dynamic Programming." Journal of the Operational Research Society 47, no. 10 (1996): 1313–14. http://dx.doi.org/10.1057/jors.1996.161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Almeida,, Ana, Carlos Ramos,, and Silvio do Carmo Silva,. "Toward Dynamic Scheduling of Manufacturing." Journal for Manufacturing Science and Production 4, no. 3 (2002): 169–79. http://dx.doi.org/10.1515/ijmsp.2002.4.3.169.

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!