93,795 research outputs found

    A Combinatorial Optimization Approach to Accessibility Services in International Airports

    Get PDF
    In this PhD thesis we study a specific variant of the well known Fixed Job Scheduling Problem, namely the Tactical Fixed Job Scheduling Problem with Spread-Time constraints. In this problem it is required to schedule a number of jobs on non identical machines that differ from each other for the set of jobs they can perform and that have constraints on the length of their duty. After providing an extensive literature review of the Fixed Job Scheduling and of its main variants, the original contribution is presented. We illustrate some lower bounds for the optimal value of the problem and display the first heuristic algorithm for solving it. We also study a specific case of interest connected with the assistance of passengers with special needs in large scale international airports

    Tactical fixed job scheduling with spread-time constraints

    Get PDF
    We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs. Jobs of the same group can only be processed by machines of a given set of classes. All jobs have their fixed start and end times. Each machine is associated with a cost according to its machine class. Machines have spread-time constraints, with which each machine is only available for L consecutive time units from the start time of the earliest job assigned to it. The objective is to minimize the total cost of the machines used to process all the jobs. For this strongly NP-hard problem, we develop a branch-and-price algorithm, which solves instances with up to 300 jobs, as compared with CPLEX, which cannot solve instances of 100 jobs. We further investigate the influence of machine flexibility by computational experiments. Our results show that limited machine flexibility is sufficient in most situations

    Time-constrained project scheduling

    Get PDF
    We study the Time-Constrained Project Scheduling Problem (TCPSP), in which the scheduling of activities is subject to strict deadlines. To be able to meet these deadlines, it is possible to work in overtime or hire additional capacity in regular time or overtime. For this problem, we develop a two stage heuristic. The key of our approach lies in the first stage in which we construct partial schedules with a randomized sampling technique. In these partial schedules, jobs may be scheduled for a shorter duration than required. The second stage uses an ILP formulation of the problem to turn a partial schedule into a feasible schedule, and to perform a neighbourhood search. The developed heuristic is quite flexible and, therefore, suitable for practice. We present experimental results on modified RCPSP benchmark instances. The two stage heuristic solves many instances to optimality, and if we substantially decrease the deadline, the rise in cost is only small

    The complexity of generating robust resource-constrained baseline schedules.

    Get 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. Robustness can also be achieved by making the schedule makespan insensitive to variability. In this paper, we describe models for the generation of stable and insensitive baseline schedules for resource-constrained scheduling problems and present results on their complexity status. We start from a project scheduling viewpoint and derive results on machine scheduling sub-problems.Complexity; Information; Product scheduling; Robustness; sensitivity; stability;

    Minimisation of energy consumption variance for multi-process manufacturing lines through genetic algorithm manipulation of production schedule

    Get PDF
    Typical manufacturing scheduling algorithms do not consider the energy consumption of each job, or its variance, when they generate a production schedule. This can become problematic for manufacturers when local infrastructure has limited energy distribution capabilities. In this paper, a genetic algorithm based schedule modification algorithm is presented. By referencing energy consumption models for each job, adjustments are made to the original schedule so that it produces a minimal variance in the total energy consumption in a multi-process manufacturing production line, all while operating within the constraints of the manufacturing line and individual processes. Empirical results show a significant reduction in energy consumption variance can be achieved on schedules containing multiple concurrent jobs

    Overcommitment in Cloud Services -- Bin packing with Chance Constraints

    Full text link
    This paper considers a traditional problem of resource allocation, scheduling jobs on machines. One such recent application is cloud computing, where jobs arrive in an online fashion with capacity requirements and need to be immediately scheduled on physical machines in data centers. It is often observed that the requested capacities are not fully utilized, hence offering an opportunity to employ an overcommitment policy, i.e., selling resources beyond capacity. Setting the right overcommitment level can induce a significant cost reduction for the cloud provider, while only inducing a very low risk of violating capacity constraints. We introduce and study a model that quantifies the value of overcommitment by modeling the problem as a bin packing with chance constraints. We then propose an alternative formulation that transforms each chance constraint into a submodular function. We show that our model captures the risk pooling effect and can guide scheduling and overcommitment decisions. We also develop a family of online algorithms that are intuitive, easy to implement and provide a constant factor guarantee from optimal. Finally, we calibrate our model using realistic workload data, and test our approach in a practical setting. Our analysis and experiments illustrate the benefit of overcommitment in cloud services, and suggest a cost reduction of 1.5% to 17% depending on the provider's risk tolerance

    Factors Affecting the Development of Workforce Versatility

    Get PDF
    Among all strategies supporting the firms' flexibility and agility, the development of human resources versatility holds a promising place. This article presents an investigation of the factors affecting the development of this flexibility lever, related to the problem of planning and scheduling industrial activities, taking into account two dimensions of flexibility: the modulation of working time, which provides the company with fluctuating work capacities, and the versatility of operators: for all the multi-skilled workers, we adopt a dynamic vision of their competences. Therefore, this model takes into account the evolution of their skills over time, depending on how much they were put in practice in previous periods. The model was solved by using an approach relying on genetic algorithm that used an indirect encoding to build the chromosome genotype, and then a serial scheduling scheme is adopted to build the solution

    On the Benefits of Inoculation, an Example in Train Scheduling

    Get PDF
    The local reconstruction of a railway schedule following a small perturbation of the traffic, seeking minimization of the total accumulated delay, is a very difficult and tightly constrained combinatorial problem. Notoriously enough, the railway company's public image degrades proportionally to the amount of daily delays, and the same goes for its profit! This paper describes an inoculation procedure which greatly enhances an evolutionary algorithm for train re-scheduling. The procedure consists in building the initial population around a pre-computed solution based on problem-related information available beforehand. The optimization is performed by adapting times of departure and arrival, as well as allocation of tracks, for each train at each station. This is achieved by a permutation-based evolutionary algorithm that relies on a semi-greedy heuristic scheduler to gradually reconstruct the schedule by inserting trains one after another. Experimental results are presented on various instances of a large real-world case involving around 500 trains and more than 1 million constraints. In terms of competition with commercial math ematical programming tool ILOG CPLEX, it appears that within a large class of instances, excluding trivial instances as well as too difficult ones, and with very few exceptions, a clever initialization turns an encouraging failure into a clear-cut success auguring of substantial financial savings
    corecore