Results 11 to 20 of about 6,771,333 (197)
Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling [PDF]
Applied Computer Systems, 2019 Abstract Two possibilities of obtaining the minimal total weighted tardiness in tight-tardy single machine preemptive idling-free scheduling are studied. The Boolean linear programming model, which allows obtaining the exactly minimal tardiness, becomes too time-consuming as either the number of jobs or numbers of job parts increase ...
Romanuke Vadim
doaj +11 more sources
Sensitivity Analysis for the Single-Machine Preemptive Scheduling Problem of Minimizing Flow Time
IEEE Access, 2023 Sensitivity analysis for the single-machine preemptive scheduling problem of minimizing flow time is discussed herein. Note that an optimal solution of the scheduling problem contains not just a combinatorial structure but also a temporal structure. The combinatorial structure specifies the sequence in which jobs or job pieces are processed.
Xiaoxi Li, Shanlin Li
openaire +3 more sources
Applied Computer Systems, 2022 Abstract A problem of minimizing the total weighted tardiness in the preemptive single machine scheduling for discrete manufacturing is considered. A hyper-heuristic is presented, which is composed of 24 various heuristics, to find an approximately optimal schedule whenever finding the exact solution is practically intractable.
Romanuke Vadim
openaire +2 more sources
Single machine preemptive scheduling Considering Energy Consumption and Predicting Machine failures with Data Mining Approach [PDF]
International Journal of Industrial Engineering and Production Research, 2023 Prediction of unexpected incidents and energy consumption are some industry issues and problems. Single machine scheduling with preemption and considering failures has been pointed out in this study. Its aim is to minimize earliness and tardiness penalties by using job expansion or compression methods. The present study solves this problem in two parts.
Qorbani, Ali +2 more
openaire +2 more sources
The power of?-points in preemptive single machine scheduling [PDF]
Journal of Scheduling, 2002 We consider the NP-hard preemptive single machine scheduling problem to minimize the total weighted completion time subject to release dates. A natural extension of Smith's ratio rule is to preempt the currently active job whenever a new job arrives that has higher ratio of weight to processing time.
Schulz, Andreas S., Skutella, Martin
openaire +4 more sources
Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
Mathematics, 2020 In this paper, we consider three preemptive Pareto-scheduling problems with two competing agents on a single machine. In each problem, the objective function of agent A is the total completion time, the maximum lateness, or the total late work while the ...
Ruyan He, Jinjiang Yuan
doaj +1 more source
Preemptive scheduling on two identical parallel machines with a single transporter [PDF]
Journal of Combinatorial Optimization, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans Kellerer +2 more
openaire +2 more sources
Effective Heuristic Algorithms Solving the Jobshop Scheduling Problem with Release Dates
Mathematics, 2020 Manufacturing industry reflects a country’s productivity level and occupies an important share in the national economy of developed countries in the world.
Tao Ren +7 more
doaj +1 more source
Foundations of Computing and Decision Sciences, 2014 It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP- hard.
He Cheng, Lin Hao, Lin Yixun, Dou Junmei
doaj +1 more source
Single machine scheduling and due date assignment under series-parallel precedence constraints
, 2005 We consider a single machine due date assignment and scheduling problem of minimizing holding costs with no tardy jobs tinder series parallel and somewhat wider class of precedence constraints as well as the properties of series-parallel ...
Gordon, Valery +2 more
core +6 more sources