Results 91 to 100 of about 25,495 (197)

Parameterized complexity of machine scheduling: 15 open problems

, 2018
Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms.
Mnich, Matthias, van Bevern, René
core   +1 more source

Scheduling MapReduce Jobs under Multi-Round Precedences

, 2016
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds.
AM Hariri, D Fotakis, DB Shmoys, FN Afrati, J Aspnes, JR Correa, LA Hall, M Mastrolilli, M Queyranne, M Queyranne, RL Graham, WL Eastman   +11 more
core   +1 more source

Taming the State-space Explosion in the Makespan Optimization of Flexible Manufacturing Systems [PDF]

, 2021
João Bastos, Jeroen Voeten, Sander Stuijk, R.R.H. Schiffelers, Henk Corporaal   +4 more
openalex   +1 more source

A New Evolutionary Algorithm Based on Bacterial Evolution and Its Application for Scheduling A Flexible Manufacturing System

Jurnal Teknik Industri, 2012
A new evolutionary computation algorithm, Superbug algorithm, which simulates evolution of bacteria in a culture, is proposed. The algorithm is developed for solving large scale optimization problems such as scheduling, transportation and assignment ...
Chandramouli Anandaraman, Arun Vikram Madurai Sankar, Ramaraj Natarajan   +2 more
doaj  

Minimizing the makespan on a single machine subject to modular setups [PDF]

, 2021
Dirk Briskorn, Konrad Stephan, Nils Boysen   +2 more
openalex   +1 more source

Dynamic Job Shop Scheduling Problem With New Job Arrivals Using Hybrid Genetic Algorithm

IEEE Access
The present paper tackles the dynamic job shop scheduling problem (DJSSP), aiming to schedule a new set of jobs while minimizing the completion time of all operations. The problem is an NP-hard combinatorial optimization problem.
Kaouther Ben Ali, Slim Bechikh, Ali Louati, Hassen Louati, Elham Kariri   +4 more
doaj   +1 more source

Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model

, 2013
We consider online scheduling on multiple machines for jobs arriving one-by-one with the objective of minimizing the makespan. For any number of identical parallel or uniformly related machines, we provide a competitive-ratio approximation scheme that ...
Megow, Nicole, Wiese, Andreas
core  

PENERAPAN EVOLUTIONARY ALGORITHM PADA PENJADWALAN PRODUKSI (Studi Kasus di PT Brother Silver Product Indonesia)

Jurnal Teknik Industri, 2001
This research gives an alternative to build production schedule using Evolutionary Algorithm. The objective function is minimizing production makespan. Shortest Processing Time (SPT) and Longest Processing Time (LPT) methods are used as initial solution.
Lala Febriana, I Gede Agus Widyadana
doaj  

Efficient Hybrid DDPG Task Scheduler for HPC and HTC in Cloud Environment

IEEE Access
Task Scheduling is a crucial challenge in cloud computing as diversified tasks come rapidly onto cloud console dynamically from heterogeneous resources which consists of different task lengths, processing capacities.
S. Sudheer Mangalampalli, Ganesh Reddy Karri, Sachi Nandan Mohanty, Shahid Ali, Atif M. Alamri, Salman A. Alqahtani   +5 more
doaj   +1 more source

Smwe: A Framework for Secure and Makespan-Oriented Workflow Execution in Serverless Computing

, 2022
Shuai Zhang, Yunfei Guo, Zehua Guo, Hongchao Hu, Thar Baker   +4 more
openalex   +1 more source