Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
From MaRDI portal
Publication:1628056
Recommendations
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- Decomposition methods for the parallel machine scheduling problem with setups
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
- Decomposition methods for the parallel machine scheduling problem with setups
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Integer linear programming formulations of multiple salesman problems and its variations
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Planning and Scheduling in Manufacturing and Services
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
- The third comprehensive survey on scheduling problems with setup times/costs
- Thirty years of heterogeneous vehicle routing
- Unrelated parallel machine scheduling using local search
Cited in
(26)- The traveling salesman problem with job-times (\textit{TSPJ})
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- The split delivery vehicle routing problem with time windows and three-dimensional loading constraints
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
- Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem
- Decomposition methods for the parallel machine scheduling problem with setups
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
- A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs
- Bi-objective parallel machine scheduling with additional resources during setups
- Scheduling unrelated parallel machines with attribute-dependent setup times: a case study
- Scheduling heating tasks on parallel furnaces with setup times and conflicts
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Unrelated parallel machine scheduling with new criteria: complexity and models
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- On the exact solution of a large class of parallel machine scheduling problems
- On modelling the maximum workload allocation for parallel unrelated machines with setups
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
This page was built for publication: Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628056)
