Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks

Agnetis, Alessandro; Rossi, Fabrizio; Smriglio, Stefano

doi:10.3390/a12120250

Cited by 6 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the paper [6], some special cases of flow and job shop problems with so-called s-precedence constraints are addressed. This means that a task of a job cannot start before the task which precedes it has started.…”

Section: Main Results Of the Special Issuementioning

confidence: 99%

Special Issue on Exact and Heuristic Scheduling Algorithms

2019

View full text Add to dashboard Cite

This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for Scheduling Problems’. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. In the Call for Papers, we mentioned topics such as single-criterion and multi-criteria scheduling problems with additional constraints including setup times (costs), precedence constraints, batching (lot sizing), resource constraints as well as scheduling problems arising in emerging applications.

show abstract

Section: Main Results Of the Special Issuementioning

confidence: 99%

Special Issue on Exact and Heuristic Scheduling Algorithms

2019

View full text Add to dashboard Cite

show abstract

“…An aggressive job do not let non-aggressive jobs start processing before it. Additional relaxed models of precedence constraints are studied in [14], [2].…”

Section: Definition 22mentioning

confidence: 99%

Minimizing Tardiness in a Scheduling Environment with Jobs' Hierarchy

Sinai¹,

Tamir²

2021

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

In many scheduling environments, some jobs have higher priority than others. Such scenarios are theoretically modelled by associating jobs with weights, or by having precedence constraints that limit jobs' processing order. In this paper we define and consider a new model, motivated by real-life behaviour, in which the priority among jobs is defined by a dominance hierarchy. Specifically, the jobs are arranged in hierarchy levels, and high ranking jobs are ready to accept only outcomes in which the service they receive is better than the service of subordinate jobs. We first define the model and the set of feasible schedules formally. We then consider two classical problems: minimizing the maximal tardiness and minimizing the number of tardy jobs. We provide optimal algorithms or hardness proofs for these problems, distinguishing between a global objective function and a multi-criteria objective.

show abstract

“…They determined a high quality lower bound by applying column generation to the LP-relaxation. Agnetis et al addressed some special cases of job shop and flow shop scheduling problems with S-type precedence constraints [1]. They provided polynomial exact algorithms for a two-machine job shop and a two-machine flow shop, and an m-machine flow shop with two jobs.…”

Section: Problems With Precedence Constraintsmentioning

confidence: 99%

“…Recently, the LBBD was applied to address the heterogeneous fixed fleet vehicle routing problem with time windows with the aim of cost minimization [?]. Valid op- multi-trip single vehicle routing -exact algorithm [4] multi-trip single vehicle routing -exact algorithm [2] multi-trip single vehicle routing -Cplex solver [33] multi-trip single vehicle routing -meta-heuristic algorithm [60] parallel machine scheduling AND/OR type PCs column generation [62] machine scheduling Soft type PCs approximation algorithms [31] flexible job-shop scheduling AND/OR type PCs heuristic algorithm [25] machine scheduling AND type PCs heuristic algorithms [1] machine scheduling S type PCs exact algorithms [27] assembly sequencing AND/OR type PCs - [39] travelling salesman problem conventional PCs genetic algorithm [35] travelling salesman problem conventional PCs dynamic programming [45] pickup and delivery TSP conventional PCs heuristic model [8] combined vehicle routing and scheduling conventional PCs - [7] travelling salesman problem pre-specified sequence heuristic [44] vehicle routing problem given priority order meta-heuristics and heuristic [6] assignment problem conventional PCs heuristic [63] order-picking pre-specified sequence dynamic programming [17] storage assignment and routing pre-specified sequence heuristics [34] order batching and picker-routing pre-specified sequence meta-heuristic [11] order-picking routing pre-specified sequence branch-and-cut and heuristics [24] Machine scheduling -LBBD [47] multi-modal outpatient scheduling -LBBD [49] operating room scheduling -LBBD [5] integrated planning and scheduling -LBBD [33] planning, lot sizing and scheduling -LBBD [59] planning and scheduling -LBBD [?] vehicle routing -LBBD current research multi-trip single vehicle routing And type PCs LBBD timality and feasibility cuts were devised to guarantee the convergence of the algorithm.…”

Section: Logic Based Benders Decomposition Algorithmmentioning

confidence: 99%

Decomposition Algorithm for the Multi-Trip Single Vehicle Routing Problem with AND-type Precedence Constraints

Roohnavazfar¹,

Pasandideh²

2021

Preprint

View full text Add to dashboard Cite

This paper addresses a new variant of the multi-trip single vehicle routing problem where the nodes are related to each other through AND-type precedence constraints. The problem aims at determining a sequence of trips to visit all the nodes respecting every precedence constraint within and among the routes so to minimize the total traveling cost. Our motivation comes from routing problems where a node may have a set of predecessors (not just single one proposed in the dial-a-ride or pickup and delivery problems) resulting in a set of pairwise relations that specify which customers need to be visited before which other ones. We develop three Mixed Integer Programming (MIP) models to formulate the problem. The models are experimentally compared to determine the best one. Moreover, a solution approach based on the Logic-Based Benders Decomposition (LBBD) algorithm is developed which allows to decompose the original problem into an assignment master problem and independent sequencing subproblems. A new valid optimality cut is devised to achieve faster convergence. The cut performance is experimentally investigated by comparing with a recently proposed one in the literature. We further relax the algorithm to find the sub-optimal solution and demonstrate its efficiency. Extensive computational experiments are conducted to assess the proposed algorithms in terms of solution quality and CPU time.

show abstract

Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks

Cited by 6 publications

References 9 publications

Special Issue on Exact and Heuristic Scheduling Algorithms

Special Issue on Exact and Heuristic Scheduling Algorithms

Minimizing Tardiness in a Scheduling Environment with Jobs' Hierarchy

Decomposition Algorithm for the Multi-Trip Single Vehicle Routing Problem with AND-type Precedence Constraints

Contact Info

Product

Resources

About