China
Africa
Explore chapters and articles related to this topic
Introduction
Published in Joseph Y.-T. Leung, Handbook of SCHEDULING, 2004
Some scheduling algorithms permit that periodic/sporadic tasks Ti and Tj both have active jobs at times t and t‘ such that at time t,Ti‘s job has higher priority than Tj‘s job while at time t',Tj‘s job has higher priority than Ti‘s. Algorithms that permit such “switching” of priorities between tasks are known as dynamic priority algorithms. An example of dynamic priority scheduling algorithm is the earliest deadline first (EDF) scheduling algorithm [1,15]. By contrast, static priority algorithms satisfy the property that for every pair of tasks Ti and Tj, whenever Ti and Tj both have active jobs, it is always the case that the same task’s job has higher priority. An example of a static-priority scheduling algorithm for periodic scheduling is the rate-monotonic scheduling algorithm [1].
Scheduling in Industrial environment toward future: insights from Jean-Marie Proth
Published in International Journal of Production Research, 2023
Marzieh Khakifirooz, Michel Fathi, Alexandre Dolgui, Panos M. Pardalos
J.M. Proth's primary research areas encompassed mathematical optimisation, operations research, scheduling, and order management. His work in mathematical optimisation was predominantly focused on themes such as production control (Boulet et al. 1991; Nagi and Proth 1994) and job-shop scheduling (Dolgui and Proth 2010; Hillion and Proth 1989a). Scheduling, particularly concerning due dates (V. S. Gordon, Proth, and Chu 2002a, 2002b) and, in certain cases, tardiness and deadline-monotonic scheduling (Chu, Portmann, and Proth 1992; Duron, Louly, and Proth 2009), constituted a primary area of concentration for J.M. Proth. In the realm of operations research, he provided insights into the iterative method, group technology (Chauhan et al. 2006), manufacturing cell engineering (Chen, Chu, and Proth 1997; Hilger, Harhalakis, and Proth 1991), and supply chain engineering (Proth 2007). Job shop scheduling (Chen, Chu, and Proth 1998), dynamic priority scheduling, and flow shop scheduling (including fair-share scheduling, rate-monotonic scheduling, dynamic priority scheduling, and fixed-priority preemptive scheduling) received significant attention in his scheduling research (C. Wang, Chu, and Proth 1996, 1997; Chauvet, Herrmann, and Proth 2003). Furthermore, his research on order management challenges encompassed elements of microeconomics, outsourcing, and selection (Dolgui and Proth 2013). J.M. Proth's investigations in scheduling drew upon concepts from real-time computing (Chauvet et al. 2000), distributed computing, trace scheduling, industrial engineering, and systems theory (Hillion and Proth 1989b). Moreover, his exploration of job shop scheduling entailed computational complexity theory and heuristic concepts (Chu, Proth, and Sethi 1995; Harhalakis, Nagi, and Proth 1990). Petri net research by J.M. Proth encompassed bottlenecks, software engineering, and job shop planning, all of which featured interdisciplinary characteristics and relied on supply chain and manufacturing engineering (Hillion and Proth 1989c; Proth and Sauer 1998; Proth, Sauer, and Xie 1997; Proth, Wang, and Xie 1997). His studies on real-time computing principles intertwined with traffic flow (Awasthi, Parent, and Proth 2006), network analysis (Herrmann et al. 1996), dynamic network analysis (Herrmann et al. 1995), and flow network challenges (Awasthi et al. 2010). In his latest research on scheduling, J.M. Proth explored pooling, fleet management, cybernetics, and polynomial algorithms (Awasthi et al. 2011).