ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
From MaRDI portal
Publication:670296
DOI10.1155/2016/9598041zbMATH Open1435.90074OpenAlexW2535926754WikidataQ59125235 ScholiaQ59125235MaRDI QIDQ670296FDOQ670296
Authors: Vinícius Vilar Jacob, José Elias Claudio Arroyo 
Publication date: 18 March 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/9598041
Recommendations
- Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
- Heuristics for single machine scheduling problem with family setup times
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
- A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
- Minimizing L max for the single machine scheduling problem with family set-ups
- A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of scheduling problems with setup times or costs
- Minimizing Total Tardiness on One Machine is NP-Hard
- Handbook of metaheuristics
- Single machine group scheduling with time dependent processing times and ready times
- A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
- Iterated local search for the team orienteering problem with time windows
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A deterministic iterated local search algorithm for the vehicle routing problem with backhauls
- Handbook of metaheuristics
- A memetic algorithm for the total tardiness single machine scheduling problem
- A simulated annealing algorithm for single machine scheduling problems with family setups
- TTT plots: a perl program to create time-to-target plots
- The third comprehensive survey on scheduling problems with setup times/costs
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- A GRASP based on DE to solve single machine scheduling problem with SDST
- Title not available (Why is that?)
- Title not available (Why is that?)
- Single machine group scheduling with family setups to minimize total tardiness
- A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- Single machine scheduling with family setups to minimize total earliness and tardiness
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Scheduling in a sequence dependent setup environment with genetic search
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- Iterated greedy local search methods for unrelated parallel machine scheduling
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
- Minimizing maximum lateness with job families
- Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
- Minimizing sum of completion times on a single machine with sequence-dependent family setup times
Cited In (3)
Uses Software
This page was built for publication: ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670296)
