Search results for " Scheduling"

showing 10 items of 158 documents

Application of learning pallets for real-time scheduling by the use of radial basis function network

2013

The expansion of the scope and scale of products in the current business environments causes a continuous increase in complexity of logistics activities. In order to deal with this challenge in planning and control of logistics activities, several solutions have been introduced. One of the most latest one is the application of autonomy. The paradigm of autonomy in inbound logistics, can be reflected in decisions for real-time scheduling and control of material flows. Integration of autonomous control with material carrier objects can realize the expected advantages of this alternative into shop-floors. Since pallets (bins, fixtures, etc.) are some common used carrier objects in logistics, t…

Radial basis function networkArtificial neural networkJob shop schedulingArtificial IntelligenceComputer sciencebusiness.industryCognitive NeurosciencePalletArtificial intelligencebusinessIndustrial engineeringComputer Science ApplicationsScheduling (computing)Neurocomputing
researchProduct

Looking for the best modes helps solving the MRCPSP/max

2013

The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags MRCPSP/max is a very general project scheduling problem with multiple execution modes per activity, renewable and non-renewable resources and minimum and maximum time lags between activities. In this paper, we describe SA-EVA, an algorithm for the problem. SA-EVA first searches for the best mode for each activity, without considering renewable resources. In this phase a simulated annealing is applied. Once a mode vector has been chosen, the problem reduces to the RCPSP/max, which SA-EVA solves with EVA, an algorithm designed in Ballestin et al. [2009. An evolutionary algorithm for the resource-…

Rate-monotonic schedulingEarliest deadline first schedulingMathematical optimizationNurse scheduling problemComputer scienceGenetic algorithm schedulingStrategy and ManagementEvolutionary algorithmDynamic priority schedulingManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringFair-share schedulingScheduling (computing)International Journal of Production Research
researchProduct

Approximation algorithm for constrained coupled-tasks scheduling problem

2014

International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.

Rate-monotonic schedulingEarliest deadline first schedulingOptimizationBipartite graphMathematical optimizationOpen-shop schedulingSchedulesDistributed computingComplexity theoryProcessor schedulingDynamic priority schedulingApproximation methodscoupled-tasksFair-share schedulingApproximation algorithmsFixed-priority pre-emptive schedulingNurse scheduling problemTwo-level schedulingMathematics[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
researchProduct

An approximate/exact objective based search technique for solving general scheduling problems

2018

Abstract In this paper, we analyze single machine scheduling problems under the following minimization objectives: the maximum completion time (makespan), the total completion time and the maximum lateness, including fundamental practical aspects, which often occur in industrial or manufacturing reality: release dates, due dates, setup times, precedence constraints, deterioration (aging) of machines, as well as maintenance activities. To solve the problems, we propose an efficient representation of a solution and a fast neighborhood search technique, which calculates an approximation of criterion values in a constant time per solution in a neighborhood. On this basis, a novel approximate/ex…

Rate-monotonic schedulingMathematical optimization021103 operations researchSingle-machine schedulingJob shop schedulingComputer science0211 other engineering and technologiesaging effectmetaheuristic02 engineering and technologyDynamic priority schedulingsetup timeFair-share schedulingScheduling (computing)Metaheuristic algorithmsTwo-level scheduling0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingschedulingmaintenance activitySoftwareprecedence constraintsApplied Soft Computing
researchProduct

Two Job Cyclic Scheduling with Incompatibility Constraints

2001

The present paper deals with the problem of scheduling several repeated occurrences of two jobs over a finite or infinite time horizon in order to maximize the yielded profit. The constraints of the problem are the incompatibilities between some pairs of tasks which require a same resource.

Rate-monotonic schedulingMathematical optimizationJob shop schedulingComputer scienceStrategy and ManagementDistributed computingFlow shop schedulingDynamic priority schedulingManagement Science and Operations ResearchFair-share schedulingMultiprocessor schedulingComputer Science ApplicationsNurse scheduling problemManagement of Technology and InnovationTwo-level schedulingBusiness and International ManagementComputer Science::Operating Systems
researchProduct

Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres

2012

Abstract In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowi…

Rate-monotonic schedulingService (systems architecture)Information Systems and ManagementPrecedence diagram methodGeneral Computer ScienceOperations researchComputer scienceDistributed computingDynamic priority schedulingSchedule (project management)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringFair-share schedulingFixed-priority pre-emptive schedulingGenetic algorithm schedulingModeling and SimulationTwo-level schedulingEuropean Journal of Operational Research
researchProduct

Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling

2009

Hierarchical scheduling has recently been used to provide temporal isolation to embedded virtualised systems. Response time analysis is a common way to derive a schedulability test for these systems. This paper points out that response time analysis for hierarchical fixed-priority scheduling found in the literature is only exact for tasks of the highest priority domain. For the rest of the tasks is an upper bound. In our work, we provide the exact analysis and we compare it with previously published works.

Rate-monotonic schedulingTheoretical computer scienceComputer scienceServerResponse timeDynamic priority schedulingParallel computingTemporal isolationUpper and lower boundsFair-share schedulingScheduling (computing)2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
researchProduct

HEURISTIC PROCEDURES FOR GROUP SCHEDULING

1989

ABSTRACT The group scheduling problem is investigated, solving numerous small and large sized examples with eight sequencing algorithms. A new approach, basically consisting in the definition of real machines' idles for each group, utilizing allowed shifting of non critical activities, is proposed. Moreover the CDS multi-shot algorithm is extended to group scheduling.

Rate-monotonic schedulingTheoretical computer scienceHeuristic (computer science)Computer scienceGroup (mathematics)Two-level schedulingDynamic priority schedulingFlow shop schedulingFair-share schedulingGroup scheduling
researchProduct

Integrated Production and Predictive Maintenance Planning based on Prognostic Information

2019

International audience; This paper address the problem of scheduling production and maintenance operation in predictive maintenance context. It proposes a contribution in the decision making phase of the prognostic and health management framework. Theprognostics and decision processes are merged and an ant colony optimization approach for finding the sequence of decisions that optimizes the benefits of a production system is developed. A case study on a single machine composed of several components where machine can have several usage profiles. The results show thatour approach surpasses classical condition based maintenance policy.

Remaining UsefulLife0209 industrial biotechnology021103 operations researchHealth management systemOperations researchComputer scienceCondition-based maintenanceAnt colony optimization algorithms[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0211 other engineering and technologiesScheduling (production processes)02 engineering and technologyPredictive maintenanceAnt Colony Optimization[SPI.AUTO]Engineering Sciences [physics]/Automatic020901 industrial engineering & automationPrognostic InformationProduction and Maintenance SchedulingPrognosticsIntegrated productionDecision processPredic-tive Maintenance
researchProduct

VarySched: A Framework for Variable Scheduling in Heterogeneous Environments

2016

Despite many efforts to better utilize the potential of GPUs and CPUs, it is far from being fully exploited. Although many tasks can be easily sped up by using accelerators, most of the existing schedulers are not flexible enough to really optimize the resource usage of the complete system. The main reasons are (i) that each processing unit requires a specific program code and that this code is often not provided for every task, and (ii) that schedulers may follow the run-until-completion model and, hence, disallow resource changes during runtime. In this paper, we present VarySched, a configurable task scheduler framework tailored to efficiently utilize all available computing resources in…

ScheduleComputer science020204 information systemsDistributed computing0202 electrical engineering electronic engineering information engineeringProcessor scheduling020201 artificial intelligence & image processing02 engineering and technologyEfficient energy useScheduling (computing)2016 IEEE International Conference on Cluster Computing (CLUSTER)
researchProduct