Scheduling unrelated parallel machines with sequence-dependent setups
From MaRDI portal
Recommendations
- A tabu search algorithm for parallel machine total tardiness problem
- Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- A novel B and B algorithm for a unrelated parallel machine scheduling problem to minimize the total weighted tardiness
Cites work
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- A state-of-the-art review of parallel-machine scheduling research
- A tabu search algorithm for parallel machine total tardiness problem
- Algorithms for Scheduling Tasks on Unrelated Processors
- An effective heuristic for minimising makespan on unrelated parallel machines
- Heuristics for minimizing mean tardiness form parallel machines
- Heuristics for scheduling unrelated parallel machines
- Minimizing the number of tardy jobs for m parallel machines
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- The Single Machine Early/Tardy Problem
- The Total Tardiness Problem: Review and Extensions
- Unrelated parallel machine scheduling using local search
Cited in
(36)- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm
- scientific article; zbMATH DE number 5310692 (Why is no real title available?)
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
- A scheduling problem with unrelated parallel machines and sequence dependent setups
- An adaptive large neighborhood search for unrelated parallel machine scheduling with setup times and delivery times
- Domino sequencing: scheduling with state-based sequence-dependent setup times
- Revisiting the development trajectory of parallel machine scheduling
- Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost
- scientific article; zbMATH DE number 1301841 (Why is no real title available?)
- Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
- The third comprehensive survey on scheduling problems with setup times/costs
- Planning production using mathematical programming: The case of a woodturning company
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
- A comparative study of solution representations for the unrelated machines environment
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times
- The traveling salesman problem with job-times (\textit{TSPJ})
- Bicriteria scheduling problem for unrelated parallel machines with release dates
- The unrelated parallel machine scheduling problem with sequence and machine dependent setup times and a shared resource without overlap
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Branch-and-cut algorithms for the traveling salesman problem with job times
- A tabu search algorithm for parallel machine total tardiness problem
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
- Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Scheduling unrelated parallel machines with optional machines and jobs selection
This page was built for publication: Scheduling unrelated parallel machines with sequence-dependent setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883307)
