125 research outputs found
Practical solutions for a dock assignment problem with trailer transportation.
We study a distribution warehouse in which trailers need to be assigned to docks for loading or unloading. A parking lot is used as a buffer zone and transportation between the parking lot and the docks is performed by auxiliary resources called terminal tractors. Each incoming trailer has a known arrival time and each outgoing trailer a desired departure time. The primary objective is to produce a docking schedule such that the weighted sum of the number of late outgoing trailers and the tardiness of these trailers is minimized; the secondary objective is to minimize the weighted completion time of all trailers, both incoming and outgoing. The purpose of this paper is to produce high-quality solutions to large instances that are comparable to a real-life case. We implement several heuristic algorithms: truncated branch and bound, beam search and tabu search. Lagrangian relaxation is embedded in the algorithms for constructing an initial solution and for computing lower bounds. The different solution frameworks are compared via extensive computational experiments.Dock assignment; Multicriteria scheduling; Branch and bound; Beam search; Lagrangian relaxation; Tabu search;
Exact and suboptimal reactive strategies for resource-constrained project scheduling with uncertain resource availabilities.
In order to cope with the uncertainty inherent in practical project management, proactive and/or reactive strategies can be used. Proactive strategies try to anticipate future disruptions by incorporating slack time or excess resource availability into the schedule, whereas reactive strategies react after a disruption happened and try to revert to a feasible schedule. Traditionally, reactive approaches have focused on obtaining a good schedule with respect to the original objective function or a schedule that deviates as little as possible from the baseline schedule. In this paper, we present various approaches, exact as well as heuristic, for optimizing the latter objective and thus encouraging schedule stability. Furthermore, in contrast to traditional rescheduling algorithms, we present a new heuristic that also takes future uncertainty into account when repairing the schedule. We consider a variant of the resource- constrained project scheduling problem in which the uncertainty is modeled by means of unexpected resource breakdowns. The results of an extensive computational experiment are given to compare the performance of the proposed strategies.Schedule stability; Stability; Algorithms; Heuristic; Uncertainty; Project scheduling; Scheduling; Performance; Strategy; Order; Project management; Management; Time;
A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time
Different from most researches focused on the single objective hybrid flowshop scheduling (HFS) problem, this paper investigates a biobjective HFS problem with sequence dependent setup time. The two objectives are the minimization of total weighted tardiness and the total setup time. To efficiently solve this problem, a Pareto-based adaptive biobjective variable neighborhood search (PABOVNS) is developed. In the proposed PABOVNS, a solution is denoted as a sequence of all jobs and a decoding procedure is presented to obtain the corresponding complete schedule. In addition, the proposed PABOVNS has three major features that can guarantee a good balance of exploration and exploitation. First, an adaptive selection strategy of neighborhoods is proposed to automatically select the most promising neighborhood instead of the sequential selection strategy of canonical VNS. Second, a two phase multiobjective local search based on neighborhood search and path relinking is designed for each selected neighborhood. Third, an external archive with diversity maintenance is adopted to store the nondominated solutions and at the same time provide initial solutions for the local search. Computational results based on randomly generated instances show that the PABOVNS is efficient and even superior to some other powerful multiobjective algorithms in the literature
A Bi-Objective Airport Gate Scheduling with Controllable Processing Times Using Harmony Search and NSGA-II Algorithms
Optimizing gate scheduling at airports is an old, but also a broad problem. The main purpose of this problem is to find an assignment for the flights arriving at and departing from an airport, while satisfying a set of constraints.A closer look at the literature in this research line shows thatin almost all studies airport gate processing time has been considered as a fix parameter. In this research, however, we investigate a more realistic situation in which airport gate processing time is a controllable. It is also assumed that the possible compression/expansion processing time of a flight can be continuously controlled, i.e. it can be any number in a given interval.Doing sohas some positive effectswhich lead to increasing the total performance at airports’ terminals. Depending on the situation, different objectives become important.. Therefore, a model which simultaneously (1) minimize the total cost of tardiness, earliness, delay andthe compression as well as the expansion costs of job processing time, and (2) minimize passengers overcrowding on gate is presented. In this study, we first propose a mixed-integer programming model for the formulated problem. Due to complexity of problem, two multi-objective meta-heuristic algorithms, i.e. multi-objective harmony search algorithm (MOHSA) and non-dominated sorting genetic algorithm II (NSGA-II) are applied in order to generate Pareto solutions. For calibrating the parameter of the algorithms, Taguchi method is used and three optimal levels of the algorithm’s performance are selected. The algorithms are tested with real-life data from Mehrabad International Airport for nine medium size test problems. The experimental results show that NSGA-II has better convergence near the true Pareto-optimal front as compared to MOHSA; however, MOHSA finds a better spread in the entire Pareto-optimal region.Finally, it is possible to apply some practical constraints into the model and also test them with even large real-life problems instances
Recommended from our members
Bi-criteria group scheduling with learning in hybrid flow shops
In this research, a bi-criteria group scheduling problem is investigated in hybrid flow shop (HFS) environments, where the parallel machines in each stage are unrelated, meaning not identical. The objective of the problem is to minimize a linear combination of the total weighted completion times as a means of complying with the interests of the producer, and the total weighted tardiness as a means of complying with the interests of customers. The underlying assumptions of the problem include the group technology assumptions (GTA) that require all jobs within a group to be processed successively and on the same machine. The runtime of these jobs are dynamic and progressively decrease as the worker learns how to perform similar jobs. A sequence-dependent setup time is considered for switching between different groups on the same machine. Although all jobs have to move in unidirectional paths through the HFS, some may skip some of the stages. Furthermore, in order to capture more realistic features of the scheduling problems, the jobs are assumed to be released into the system at dynamic times, and the machines, as well, are assumed to be available at dynamic times. The problem is formulated as a mixed-integer linear programming (MILP) model. The MILP model for small sizes of the problem is solved to optimality using CPLEX. However, since the problem is strongly NP-hard, it is not possible to find its optimal solution within a reasonable time as the problem size increases to medium to large.
Several meta-heuristic algorithms based on tabu search (TS), simulated annealing (SA), and genetic algorithm (GA) are developed to find the optimal/near optimal solutions for this problem. Three alterations of algorithms are developed for TS and SA-based algorithms (referred to as local search algorithms) i.e. non-permutation, partial permutation and local searches with embedded progressive perturbations. Two alternatives are also considered for GA-based algorithms (referred to as population-based algorithms) i.e. simple GA and bi-level GA. The performances of these algorithms are compared to each other in order to identify which algorithm, if any, outperforms the others. Nevertheless, the performances of all algorithms are evaluated with respect to a tight lower bound (LB) obtained based on a branch-and-price (B&P) technique developed in this research.
The B&P technique uses Dantzig-Wolfe decomposition to divide the original problem into a master problem and several sub-problems. Although, the sub-problems are smaller than the original problem, they are still strongly NP-hard and cannot be optimally solved within a reasonable amount of time. However, an optimal dispatching rule is proposed that drastically reduces the number of variables and constraints in these sub-problems, and enables the B&P algorithm to find tight lower bounds even for large-size instances of the problem. A comparison between these lower bounds and the ones obtained from CPLEX reveals the impressive performance of the B&P algorithm, i.e. an average of 233% improvement for the largest size of the problems that have been tested. Evaluation of the proposed algorithms with respect to these tight lower bounds uncovers the outstanding performance of all the proposed algorithms, while identifying the bi-level GA as the best performing algorithm in dealing with the HFS scheduling problem. This algorithm reports a remarkable performance with an average deviation of only 2% from the optimal solution for small-size sample problems, and an average gap of 23% from the lower bound for the largest sizes of the tested problems. The largest problem tested in this research consists of a total of 1858 binary variables and 14654 constraints
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems
We study combinatorial problems with real world applications such as machine
scheduling, routing, and assignment. We propose a method that combines
Reinforcement Learning (RL) and planning. This method can equally be applied to
both the offline, as well as online, variants of the combinatorial problem, in
which the problem components (e.g., jobs in scheduling problems) are not known
in advance, but rather arrive during the decision-making process. Our solution
is quite generic, scalable, and leverages distributional knowledge of the
problem parameters. We frame the solution process as an MDP, and take a Deep
Q-Learning approach wherein states are represented as graphs, thereby allowing
our trained policies to deal with arbitrary changes in a principled manner.
Though learned policies work well in expectation, small deviations can have
substantial negative effects in combinatorial settings. We mitigate these
drawbacks by employing our graph-convolutional policies as non-optimal
heuristics in a compatible search algorithm, Monte Carlo Tree Search, to
significantly improve overall performance. We demonstrate our method on two
problems: Machine Scheduling and Capacitated Vehicle Routing. We show that our
method outperforms custom-tailored mathematical solvers, state of the art
learning-based algorithms, and common heuristics, both in computation time and
performance
Serial-batch scheduling – the special case of laser-cutting machines
The dissertation deals with a problem in the field of short-term production planning, namely the scheduling of laser-cutting machines. The object of decision is the grouping of production orders (batching) and the sequencing of these order groups on one or more machines (scheduling). This problem is also known in the literature as "batch scheduling problem" and belongs to the class of combinatorial optimization problems due to the interdependencies between the batching and the scheduling decisions. The concepts and methods used are mainly from production planning, operations research and machine learning
A survey on metaheuristics for stochastic combinatorial optimization
Metaheuristics are general algorithmic frameworks, often nature-inspired, designed to solve complex optimization problems, and they are a growing research area since a few decades. In recent years, metaheuristics are emerging as successful alternatives to more classical approaches also for solving optimization problems that include in their mathematical formulation uncertain, stochastic, and dynamic information. In this paper metaheuristics such as Ant Colony Optimization, Evolutionary Computation, Simulated Annealing, Tabu Search and others are introduced, and their applications to the class of Stochastic Combinatorial Optimization Problems (SCOPs) is thoroughly reviewed. Issues common to all metaheuristics, open problems, and possible directions of research are proposed and discussed. In this survey, the reader familiar to metaheuristics finds also pointers to classical algorithmic approaches to optimization under uncertainty, and useful informations to start working on this problem domain, while the reader new to metaheuristics should find a good tutorial in those metaheuristics that are currently being applied to optimization under uncertainty, and motivations for interest in this fiel
Heuristics and metaheuristics for heavily constrained hybrid flowshop problems
Due to the current trends in business as the necessity to have a large catalogue of products, orders that increase in frequency but not in size, globalisation and a market that is increasingly competitive, the production sector faces an ever harder economical environment. All this raises the need for production scheduling with maximum efficiency and effectiveness.
The first scientific publications on production scheduling appeared more than half a century ago. However, many authors have recognised a gap between the literature and the industrial problems. Most of the research concentrates on optimisation problems that are actually a very simplified version of reality. This allows for the use of sophisticated approaches and guarantees in many cases that optimal solutions are obtained. Yet, the exclusion of real-world restrictions harms the applicability of those methods. What the industry needs are systems for optimised production scheduling that adjust exactly to the conditions in the production plant and that generates good solutions in very little time. This is exactly the objective in this thesis, that is, to treat more realistic scheduling problems and to help closing the gap between the literature and practice.
The considered scheduling problem is called the hybrid flowshop problem, which consists in a set of jobs that flow through a number of production stages. At each of the stages, one of the machines that belong to the stage is visited. A series of restriction is considered that include the possibility to skip stages, non-eligible machines, precedence constraints, positive and negative time lags and sequence dependent setup times. In the literature, such a large number of restrictions has not been considered simultaneously before. Briefly, in this thesis a very realistic production scheduling problem is studied.
Various optimisation methods are presented for the described scheduling problem. A mixed integer programming model is proposed, in order to obtaiUrlings ., T. (2010). Heuristics and metaheuristics for heavily constrained hybrid flowshop problems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/8439Palanci
- …