Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
From MaRDI portal
Publication:6551087
DOI10.1016/J.COR.2023.106484MaRDI QIDQ6551087
Carlo Alberto Magni, Maxence Delorme, Author name not available (Why is that?), Manuel Iori
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
schedulinginteger linear programmingconstraint programmingresource constraintscombinatorial Benders' decomposition
Cites Work
- Title not available (Why is that?)
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
- Simultaneous job scheduling and resource allocation on parallel machines
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Event-based MILP models for resource-constrained project scheduling problems
- Online weighted flow time and deadline scheduling
- An integrated method for planning and scheduling to minimize tardiness
- A state-of-the-art review of parallel-machine scheduling research
- Scheduling subject to resource constraints: Classification and complexity
- Partitioning procedures for solving mixed-variables programming problems
- A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles
- An analysis of heuristics for the parallel-machine flexible-resource scheduling problem
- Logic-based Benders decomposition
- Parallel machine scheduling with a common server
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Mathematical models and decomposition methods for the multiple knapsack problem
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Scheduling with batching: A review
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers
- Coupled task scheduling with time-dependent processing times
- Benchmarking optimization software -- a (Hi)story
- A local search framework for industrial test laboratory scheduling
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Coupled task scheduling with exact delays: literature review and models
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Generalized Benders decomposition
- A survey on problems and methods in generalized assembly line balancing
- A survey on scheduling problems with due windows
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Complexity of Scheduling under Precedence Constraints
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
- The Total Tardiness Problem: Review and Extensions
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- Constraint Programming
- Scheduling
- A binary search algorithm for the general coupled task scheduling problem
- Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints
This page was built for publication: Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551087)