Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
From MaRDI portal
(Redirected from Publication:1374439)
Recommendations
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- scientific article; zbMATH DE number 10435
Cited in
(19)- An online algorithm for a problem in scheduling with set-ups and release times
- An iterative approach for the serial batching problem with parallel machines and job families
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
- scientific article; zbMATH DE number 5149339 (Why is no real title available?)
- Scheduling with batching: A review
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- Optimization of setup times in the furniture industry
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
- Dynamic scheduling of aircraft landings
- Approximation algorithms for problems in scheduling with set-ups
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Two simulated annealing-based heuristics for the job shop scheduling problem
This page was built for publication: Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374439)