Parallel machine scheduling with precedence constraints and setup times
From MaRDI portal
Abstract: This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search methods mixed with local search principles, dominance conditions and specific lower bounds are proposed. The proposed methods are evaluated on a set of randomly generated instances and compared with previous results from the literature and those obtained with an efficient commercial solver. We conclude that our propositions are quite competitive and our results even outperform other approaches in most cases.
Recommendations
- List scheduling in a parallel machine environment with precedence constraints and setup times
- Scheduling preemptive jobs with precedence constraints on parallel machines
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
Cites work
- scientific article; zbMATH DE number 2013754 (Why is no real title available?)
- A state-of-the-art review of parallel-machine scheduling research
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
- An experimental study of algorithms for weighted completion time scheduling
- Earliness-tardiness scheduling with setup considerations
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- List scheduling in a parallel machine environment with precedence constraints and setup times
- List scheduling revisited
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Rangen: A random network generator for activity-on-the-node networks
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
- Search tree based approaches for parallel machine scheduling
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- Solving Parallel Machine Scheduling Problems by Column Generation
- Variable neighborhood search: Principles and applications
Cited in
(20)- scientific article; zbMATH DE number 5310692 (Why is no real title available?)
- Parallel dedicated machines scheduling with chain precedence constraints
- Parallel machine scheduling with nested processing set restrictions
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- A two-stage solution approach for plastic injection machines scheduling problem
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
- Discrepancy search for the flexible job shop scheduling problem
- Precedence constrained parallel-machine scheduling of position-dependent jobs
- scientific article; zbMATH DE number 6263704 (Why is no real title available?)
- Practical solutions for a dock assignment problem with trailer transportation
- The third comprehensive survey on scheduling problems with setup times/costs
- List scheduling in a parallel machine environment with precedence constraints and setup times
- Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm
- Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
This page was built for publication: Parallel machine scheduling with precedence constraints and setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991370)
