Filters








36 Hits in 7.8 sec

Properties of optimal schedules in preemptive shop scheduling

Ph. Baptiste, J. Carlier, A. Kononov, M. Queyranne, S. Sevastyanov, M. Sviridenko
2011 Discrete Applied Mathematics  
We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems. (J. Carlier), alvenko@math.nsc.ru (A. Kononov), Maurice.Queyranne@commerce.ubc.ca (M.  ...  interruptions and all starting and completion times occur at integral dates.  ...  The fourth author was supported by a research grant from the Natural Sciences and Research Council of Canada.  ... 
doi:10.1016/j.dam.2010.11.015 fatcat:zykp7iykrbc67g4twljdtd6w4q

Resource Augmentation for Weighted Flow-time explained by Dual Fitting [chapter]

S. Anand, Naveen Garg, Amit Kumar
2012 Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms  
This is an improvement by a factor of 1 ε on the competitive ratio of this algorithm as analyzed by them. • For the problem of minimizing weighted k norm of flow-time, we show that a greedy algorithm gives  ...  We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time, and we allow the machines  ...  Their algorithm, however, is based on a non-trivial potential function. For the objective of weighted flow-time plus energy on a single machine, Bansal et al.  ... 
doi:10.1137/1.9781611973099.97 dblp:conf/soda/AnandGK12 fatcat:lezvpulvtrgydbhrk42fmkp5oe

Two-agent scheduling in open shops subject to machine availability and eligibility constraints

Ling-Huey Su, Ming-Chih Hsiao
2015 Journal of Industrial Engineering and Management  
problems up to 110 jobs combined with 10 machines without considering the constraint that each operation can be processed on at most one machine at a time.  ...  Purpose: The aims of this article are to develop a new mathematical formulation and a new heuristic for the problem of preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility  ...  As for the preemptive open shop problem, Gonzalez and Sahni (1976) proposed a polynomial time algorithm to obtain the minimum makespan.  ... 
doi:10.3926/jiem.1352 fatcat:nyxcpin5hvgmjkwahf7jmfl6ui

An efficient dynamic dispatching rule for scheduling in a job shop

T.S. Raghu, Chandrasekharan Rajendran
1993 International Journal of Production Economics  
Job scheduling systems employ a pair of rules: a routing rule which assigns a machine to process an operation and a sequencing rule which determines the order of operation processing.  ...  Since hand-crafted rules can be time and effort-consuming, many papers employ genetic programming to generate optimum rule trees from a set of terminals and operators.  ...  NMWT barely passed the threshold for sequencing in mean weighted and maximum flow-time.  ... 
doi:10.1016/0925-5273(93)90044-l fatcat:btfd5qxsofccxekzmtd4pmuohi

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
2018 Journal of Global Optimization  
We present a number of algorithms based on common general principles adapted with a purpose of reducing the resulting running times.  ...  We consider a range of scheduling problems with controllable processing times, in which the jobs must be completed by a common deadline by compressing appropriately their processing times.  ...  Acknowledgements This research was supported by the EPSRC funded project EP/J019755/1 "Submodular Optimisation Techniques for Scheduling with Controllable Parameters".  ... 
doi:10.1007/s10898-018-0686-2 fatcat:py3xnmtj45cxjnb7ve7ylltygu

Using Sequence Mining to Predict Complex Systems: A Case Study in Influenza Epidemics

Theyazn H. H. Aldhyani, Manish R. Joshi, Shahab A. AlMaaytah, Ahmed Abdullah Alqarni, Nizar Alsharif, M. Irfan Uddin
2021 Complexity  
The current research is based on a weighted version of the Center for Disease Control and Prevention influenza-like illness activity level obtained from the Center for Disease Control and Prevention data  ...  We developed a surveillance system for influenza epidemics using Google search queries.  ...  Acknowledgments e authors acknowledge the Deanship of Scientific Research at King Faisal University for the financial support under Nasher Track (Grant no. 186344).  ... 
doi:10.1155/2021/9929013 fatcat:ritp7vmv2rdtzd24zfaircb4ze

A multi-objective facility location model for closed-loop supply chain network under uncertain demand and return

Saman Hassanzadeh Amin, Guoqing Zhang
2013 Applied Mathematical Modelling  
A multi-objective facility location model for closed-loop supply chain network under uncertain demand and return. Applied Mathematical Modelling, 37 (6), 4165-4176.  ...  The model is extended to consider environmental factors by weighed sums and ε-constraint methods.  ...  The first author thanks the Government of Ontario for an OGS. The authors would like to thank the editor and referees for their helpful comments.  ... 
doi:10.1016/j.apm.2012.09.039 fatcat:kboo7piz2jfbdfpbs5v6qgib24

Single-machine common due window assignment and scheduling to minimize the total cost

Yunqiang Yin, T.C.E. Cheng, Jiayin Wang, Chin-Chia Wu
2013 Discrete Optimization  
The objective is to find a job sequence, a delivery date for each job, and a starting time and a size for the due window that jointly minimize the total cost comprising earliness, weighted number of tardy  ...  In this paper we consider a single-machine common due window assignment and scheduling problem with batch delivery cost. The starting time and size of the due window are decision variables.  ...  Acknowledgments We are grateful to the Editor and two anonymous referees for their constructive comments on the previous version of our paper.  ... 
doi:10.1016/j.disopt.2012.10.003 fatcat:aoh5opjhh5bcdjsm6nqztcf2iq

Comparisons of bi-objective genetic algorithms for hybrid flowshop scheduling with sequence-dependent setup times

S.M. Mousavi, M. Zandieh, M. Amiri
2012 International Journal of Production Research  
Furthermore, based on the review of the existing papers, the need for future research is recognized.  ...  A B S T R A C T Multi-criteria sequence dependent setup times scheduling problems exist almost everywhere in real modern manufacturing world environments.  ...  The problem was formulated as a MILP and a heuristic algorithm based on the ε-constraint method was proposed.  ... 
doi:10.1080/00207543.2010.543178 fatcat:ch5qv36nyjedvojvytrmjh6wpu

Design of a Prioritized Error Control Scheme based on Load Differentiation for Time Sensitive Traffic on the Wireless LAN

Mikyung Kang, Junghoon Lee, Yongmoon Jin, Gyung-Leen Park, Hanil Kim
2006 Journal of Networks  
This paper proposes and analyzes the performance of a prioritized error control scheme for time sensitive application on the wireless sensor network.  ...  The simulation results show that the proposed scheme can improve recovered weight by 8% while showing 97% successful transmission at maximum for the given simulation parameter.  ...  The y-axis of Figure 6 . 6 Total weight vs. error rate Fig. 6 plots the measurement result of recovered weights according to the ε ranging from 10 -3 to 10 -2 . © 2006 ACADEMY PUBLISHER  ... 
doi:10.4304/jnw.1.2.45-51 fatcat:3fwbhefcgzbmflh7itccl5liji

VERIFICATION OF DATAFLOW SCHEDULING

TSUNG-HSI CHIANG, LAN-RONG DUNG
2008 International journal of software engineering and knowledge engineering  
Generally, dataflow algorithms need algorithmic transformations to achieve optimal goals and also need design scheduling to allocate processor resources before mapping on a silicon.  ...  This paper presents the formal verification method for high-level synthesis (HLS) to detect design errors of dataflow algorithms by using Petri Net (PN) and symbolic-modelverifier (SMV) techniques.  ...  For each task node op i j ∈ V , a schedule of the given FSFG is as follow: • Start time: t i j = ϕ(op i j ), ϕ : V → Z + = {1, 2, . . .} • Execution delay: d j ∈ Z = {0, 1, 2, . . .} • Finish time: ε j  ... 
doi:10.1142/s0218194008003891 fatcat:xf2ytemtsbbu5morvvidjkqzvu

A Deadline Constrained Time-Cost effective Salp Swarm Algorithm for Resource Optimization in Cloud Computing

2022 International Journal of Applied Metaheuristic Computing  
Here, in this paper, a Deadline Constrained Time-Cost effective Salp Swarm Algorithm (DTC-SSA) is proposed to achieve optimized resource allocation.  ...  Rigorous examination of the algorithm is conducted on the various scale and cloud resources.  ...  In this work, the following assumptions are: 1) All tasks are independent. 2) Execution of tasks is non-preemptive. 3) All resources are non-shareable i.e., only one task can occupy one resource at a time  ... 
doi:10.4018/ijamc.292509 fatcat:emabcdwfgnfwbcznqbyzoxupla

Optimal Workload Allocation for Edge Computing Network Using Application Prediction

Zhenquan Qin, Zanping Cheng, Chuan Lin, Zhaoyi Lu, Lei Wang
2021 Wireless Communications and Mobile Computing  
Considering the limited computing or storage resources on the edge server side, the workload allocation among edge servers for each Internet of Things (IoT) application affects the response time of the  ...  By deploying edge servers on the network edge, mobile edge computing network strengthens the real-time processing ability near the end devices and releases the huge load pressure of the core network.  ...  Innovation Fund" with Nos. 2019J11CY004 and 2020JJ26GX037, and "the Fundamental Research Funds for the Central Universities" with Nos.  ... 
doi:10.1155/2021/5520455 doaj:e32f5455d34749839ef0b27f383232b2 fatcat:4vszpeh4arhnbmtmwbthmjqaku

A Multi-Objective Task Reallocating Method in Complex Product Design Process Considering Design Changes

Yinhe Wang, Meng Wei, Jiafu Su, Hongyuan Hu, Heng Wang
2019 IEEE Access  
than the other algorithms, along with a better solution.  ...  In this paper, we propose a task reallocating model based on an adaptive multi-objective genetic algorithm and Tabu search (AMOGATS) method to study the dynamic task allocating procedure considering design  ...  [31] develop a dynamic tasks scheduling algorithm based on weighted bi-graph model.  ... 
doi:10.1109/access.2019.2954204 fatcat:cyxwofungfarjboymg5dx3tqce

Towards a Unified Pandemic Management Architecture: Survey, Challenges and Future Directions [article]

Satyaki Roy, Nirnay Ghosh, Nitish Uplavikar, Preetam Ghosh
2022 arXiv   pre-print
The pandemic caused by SARS-CoV-2 has left an unprecedented impact on health, economy and society worldwide. Emerging strains are making pandemic management increasingly challenging.  ...  In this paper, we perform a survey of the existing approaches for pandemic management, including online data repositories and contact-tracing applications.  ...  Along similar lines, Hesamifard et al. provide a framework to enable privacy-preserving machine learning as a service (MLaaS) for applying deep neural network algorithms on encrypted data [120] .  ... 
arXiv:2202.07448v1 fatcat:zro3hesk6jawnj7tdxy2jczpgq
« Previous Showing results 1 — 15 out of 36 results