Local search performance guarantees for restricted related parallel machine scheduling [PDF]
We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In
Recalde Diego +3 more
core
The complexity of generating robust resource-constrained baseline schedules. [PDF]
Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that will change little when variations in the input parameters arise.
Herroelen, Willy, Leus, Roel
core
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or ...
Kis, Tamas +2 more
core +1 more source
Solution and quality robust project scheduling: a methodological framework. [PDF]
The vast majority of the research efforts in project scheduling over the past several years has concentrated on the development of exact and suboptimal procedures for the generation of a baseline schedule assuming complete information and a deterministic
Herroelen, Willy, Leus, Roel
core
Non-preemptive coordination mechanisms for identical machine scheduling games
, 2008 We study coordination mechanisms for scheduling n selfish tasks on m identical parallel machines and we focus on the price of anarchy of non-preemptive coordination mechanisms, i.e., mechanisms whose local policies do not delay or preempt tasks. We prove
Kollias, K.
core +1 more source
Project scheduling under undertainty – survey and research potentials. [PDF]
The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the
Herroelen, Willy, Leus, Roel
core
Permutation Flowshop Scheduling with Earliness and Tardiness Penalties [PDF]
We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process.
Peeyush Mehta +2 more
core
Genetic algorithm for single machine scheduling with general early-tardy penalty weights
, 1999 It is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal method genetic-based is presented to solve single machine scheduling problem with general early-tardy penalty weights in the paper.
Wang HB(王浩波) +3 more
core
Hybrid GA-DQL approach for efficient task mapping of IoT applications in fog computing framework. [PDF]
Sci RepTripathy N +3 more
europepmc +1 more source
A scalable scheduling and resource management framework for cloud-native B2B applications. [PDF]
Sci RepKomarasamy D +3 more
europepmc +1 more source