8 results
Search Results
2. Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
- Author
-
Carlier, Jacques, Jouglet, Antoine, and Sahli, Abderrahim
- Published
- 2024
- Full Text
- View/download PDF
3. Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm.
- Author
-
Bianco, Lucio, Caramia, Massimiliano, Giordani, Stefano, and Salvatore, Alessio
- Subjects
SCHEDULING ,NETWORK analysis (Planning) ,JOB shops ,MANUFACTURING processes ,UNITS of time ,ALGORITHMS - Abstract
In some production processes, the effort associated with a certain activity for its execution can vary over time. In this case, the amount of work per time unit devoted to each activity, so as its duration, is not univocally determined. This kind of problem can be represented by an activity project network with the so-called feeding precedence relations, and activity variable execution intensity. In this paper, we propose a forward recursion algorithm able to find the earliest start and finish times of each activity, in O (m log n) time, with n and m being the number of activities and the number of precedence relations, respectively. In particular, this requires the calculation of the (optimal) execution intensity profile, for each activity, that warrants the earliest start schedule and the minimum completion time of the project. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. Improved algorithms for proportionate flow shop scheduling with due-window assignment.
- Author
-
Qian, Jin and Han, Haiyan
- Subjects
FLOW shop scheduling ,ALGORITHMS - Abstract
In a recent study, Sun et al. (AOR 292:113–131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For common due-window (denoted by CONW) and slack due-window (denoted by SLKW) assignment methods, they proved that these two problems can be solved in O (n 2 log n) time respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contribution is that the CONW problem can be optimally solved by a lower-order algorithm, which runs in O (n log n) time, implying an improvement of a factor of n. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Matchings under distance constraints I.
- Author
-
Madarasi, Péter
- Subjects
ALGORITHMS ,POLYNOMIAL time algorithms ,APPROXIMATION algorithms ,NP-complete problems ,SEARCH algorithms - Abstract
This paper introduces the d-distance matching problem, in which we are given a bipartite graph G = (S , T ; E) with S = { s 1 , ⋯ , s n } , a weight function on the edges and an integer d ∈ Z + . The goal is to find a maximum-weight subset M ⊆ E of the edges satisfying the following two conditions: (i) the degree of every node of S is at most one in M, (ii) if s i t , s j t ∈ M , then | j - i | ≥ d . This question arises naturally, for example, in various scheduling problems. We show that the problem is NP-complete in general and admits a simple 3-approximation. We give an FPT algorithm parameterized by d and also show that the case when the size of T is constant can be solved in polynomial time. From an approximability point of view, we show that the integrality gap of the natural integer programming model is at most 2 - 1 2 d - 1 , and give an LP-based approximation algorithm for the weighted case with the same guarantee. A combinatorial (2 - 1 d) -approximation algorithm is also presented. Several greedy approaches are considered, and a local search algorithm is described that achieves an approximation ratio of 3 / 2 + ϵ for any constant ϵ > 0 in the unweighted case. The novel approaches used in the analysis of the integrality gap and the approximation ratio of locally optimal solutions might be of independent combinatorial interest. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
6. On the summary measures for the resource-constrained project scheduling problem.
- Author
-
Van Eynde, Rob, Vanhoucke, Mario, and Coelho, José
- Subjects
SCHEDULING ,MEASUREMENT ,ALGORITHMS ,MANUSCRIPTS - Abstract
The resource-constrained project scheduling problem is a widely studied problem in the literature. The goal is to construct a schedule for a set of activities, such that precedence and resource constraints are respected and that an objective function is optimized. In project scheduling literature, summary measures are often used as a tool to evaluate the performance of algorithms and to analyze instances and datasets. They can be classified in two groups, network measures describe the precedence constraints of a project, while resource measures focus on the resource constraints of the instance. In this manuscript we make an exhaustive evaluation of the summary measures for project scheduling. We provide an overview of the most prevalent measures and also introduce some new ones. For our tests we combine different datasets from the literature and generate a new set with diverse characteristics. We evaluate the performance of the summary measures on three dimensions: consistency, instance complexity and algorithm selection. We conclude by providing an overview of which measures are best suited for each of the three investigated dimensions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
7. Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition.
- Author
-
Emde, Simon, Zehtabian, Shohre, and Disser, Yann
- Subjects
CONSTRAINT programming ,MILK ,SCHEDULING ,FLOW shop scheduling ,ALGORITHMS ,CAPITAL movements - Abstract
We consider the problem of scheduling a set of direct deliveries between a depot and multiple customers using a given heterogeneous truck fleet. The trips have time windows and weights, and they should be completed as soon after release as possible (minimization of maximum weighted flow time). Moreover, some trips can optionally be combined in predefined milk runs (i.e., round trip tours), which need not be linear combinations of the constituent direct trips, accounting, e.g., for consolidation effects because the loading dock needs to be approached only once. This problem has applications, e.g., in just-in-time, humanitarian, and military logistics. We adapt a mixed-integer programming model from the literature to this problem and show that deciding feasibility is NP-complete in the strong sense on three levels: assigning trips to trucks, selecting milk runs, and scheduling trips on each individual truck. We also show that, despite this complexity, a state-of-the-art constraint programming solver and a problem-specific approach based on logic-based Benders decomposition can solve even large instances with up to 175 trips in many cases, while the mixed-integer programming model is essentially unsolvable using commercial optimization software. We also investigate the robustness of the maximum flow time objective in the face of unforeseen delays as well as the influence of milk runs. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
8. An optimal data-splitting algorithm for aircraft sequencing on a single runway.
- Author
-
Prakash, Rakesh, Desai, Jitamitra, and Piplani, Rajesh
- Subjects
ALGORITHMS ,DYNAMIC programming ,SAFETY standards - Abstract
During peak-hour busy airports have the challenge of turning aircraft around as quickly as possible, which includes sequencing their landings and take-offs with maximum efficiency, without sacrificing safety. This problem, termed aircraft sequencing problem (ASP) has traditionally been hard to solve optimally in real-time, even for flights over a one-hour planning window. In this article, we present a novel data-splitting algorithm to solve the ASP on a single runway with the objective to minimize the total delay in the system both under segregated and mixed mode of operation. The problem is formulated as a 0–1 mixed integer program, taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting. Following divide-and-conquer paradigm, the algorithm divides the given set of flights into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. One hour peak-traffic instances of this problem, which is NP-hard in general, are computationally difficult to solve with direct application of the commercial solver, as well as existing state-of-the-art dynamic programming method. Using our data-splitting algorithm, various randomly generated instances of the problem can be solved optimally in near real-time, with time savings of over 90%. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.