Search results for "scheduling."
showing 10 items of 270 documents
Changes in the Scheduling Process According to Observed Activity-travel Flexibility
2014
Abstract In this work we analyze the reasons for changing pre-planned activities and travels episodes considering the type of modification observed during the scheduling process. Specifically we selected a small sample from those pre-planned episodes that are no executed at all as a pilot study. The data analyzed was collected in the first wave of a weekly activity-travel panel survey carried out in Valencia (Spain) in 2010. Each survey wave consisted on a face-to-face interview to generate a pre-planned activity agenda for the following week, an activity-travel diary implemented on mobile phones to collect activities and travels as they are executed, and in-depth telephone interviews to in…
Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
2015
We consider the problem of scheduling a set of jobs on a set of identical parallel machines where the objective is to minimize the total weighted earliness and tardiness penalties with respect to a common due date. We propose a hybrid heuristic algorithm for constructing good solutions, combining priority rules for assigning jobs to machines and a local search with exact procedures for solving the one-machine subproblems. These solutions are then used in two metaheuristic frameworks, Path Relinking and Scatter Search, to obtain high quality solutions for the problem. The algorithms are tested on a large number of test instances to assess the efficiency of the proposed strategies. The result…
Identification for a general class of LPV Models
2000
Abstract In this paper we consider the problem of identifying discrete-time Linear Parameter Varying (LPV) models of non-linear or time-varying systems. LPV models are considered for their connection with the industrial practice of gain-scheduling. We assume that inputs, outputs and the scheduling parameters are measured, and a form of the functional dependence of the coefficients on the parameters is known. We show how the identification problem can be reduced to a linear regression so that a Least Mean Square identification algorithm can be reformulated. Conditions on the persistency of excitation in terms of the inputs and parameter trajectories are given to ensure the consistency of the…
Identification of linear parameter varying models
2003
We consider the problem of identifying discrete-time linear parameter varying models of nonlinear or time-varying systems. We assume that inputs, outputs and the scheduling parameters are measured, and a form of the functional dependence of the coefficients on the parameters. We show how the identification problem can be reduced to a linear regression, and we give conditions on persistency of excitation in terms of the inputs and parameter trajectories.
Simultaneous optimization of harvest schedule and data quality
2015
In many recent studies, the value of forest inventory information in harvest scheduling has been examined. In a previous paper, we demonstrated that making measurement decisions for stands for which the harvest decision is uncertain simultaneously with the harvest decisions may be highly profitable. In that study, the quality of additional measurements was not a decision variable, and the only options were between making no measurements or measuring perfect information. In this study, we introduce data quality into the decision problem, i.e., the decisionmaker can select between making imperfect or perfect measurements. The imperfect information is obtained with a specific scenario tree fo…
Two Simple Constructive algorithms for the Distributed Assembly Permutation Flowshop Scheduling Problem
2014
Nowadays, it is necessary to improve the management of complex supply chains which are often composed of multi-plant facilities. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP). This problem is a generalization of the Distributed Permutation Flowshop Scheduling Problem (DPFSP) presented by Naderi and Ruiz (Comput Oper Res, 37(4):754–768, 2010). The first stage of the DAPFSP is composed of f identical production factories. Each center is a flowshop that produces jobs that have to be assembled into final products in a second assembly stage. The objective is to minimize the makespan. Two simple constructive algorithms are proposed to solve the proble…
The effects of using participatory working time scheduling software on sickness absence: A difference-in-differences study.
2020
Abstract Background Participatory working time scheduling is a collaborative approach to scheduling shift work. As a potential way of improving work time control, it may provide a means to reducing sickness absence in shift work. So far, experimental and quasi-experimental studies on the effects of increased work time control on sickness absence are lacking. Objective To investigate the effects of using digital participatory working time scheduling software on ward-level sickness absence among Finnish hospital employees. Participants and methods This quasi-experimental study compared the amount of sickness absence in hospital wards using a participatory working time scheduling software (n=1…
Smart grid-aware scheduling in data centres
2015
In several countries the expansion and establishment of renewable energies result in widely scattered and often weather-dependent energy production, decoupled from energy demand. Large, fossil-fuelled power plants are gradually replaced by many small power stations that transform wind, solar and water power into electrical power. This leads to changes in the historically evolved power grid that favours top-down energy distribution from a backbone of large power plants to widespread consumers. Now, with the increase of energy production in lower layers of the grid, there is also a bottom-up flow of the grid infrastructure compromising its stability. In order to locally adapt the energy deman…
Financial Evaluation of SLA-based VM Scheduling Strategies for Cloud Federations
2017
In recent years, cloud federations have gained popularity. Small as well as big cloud service providers (CSPs) join federations to reduce their costs, and also cloud management software like OpenStack offers support for federations. In a federation, individual CSPs cooperate such that they can move load to partner clouds at high peaks and possibly offer a wider range of services to their customers. Research in this area addresses the organization of such federations and strategies that CSPs can apply to increase their profit.In this paper we present the latest extensions to the FederatedCloudSim framework that considerably improve the simulation and evaluation of cloud federations. These si…
Economic lot scheduling on multiple production lines with resource constraints
2003
Abstract This paper deals with the multiple production line economic lot scheduling problem, where some items cannot be produced concurrently since they compete for some discrete resources. In particular, cyclic schedules are sought for a problem where identical production lines are present, lost sales are allowed, and minimization of the long-range production, setup, inventory, and shortage penalty costs are required. A heuristic procedure for this problem is introduced, a numerical example is worked out and some computational experiments are presented.