A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
From MaRDI portal
Publication:2563872
Recommendations
- A GRASP for a difficult single machine scheduling problem
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
- A GRASP based on DE to solve single machine scheduling problem with SDST
- A heuristic approach for single-machine scheduling with due dates and class setups.
Cites work
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A probabilistic heuristic for a computationally difficult set covering problem
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- Branch-and-Bound Strategies for Dynamic Programming
- Note—Operations Sequencing in Discrete Parts Manufacturing
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Tabu Search—Part I
- Tabu Search—Part II
Cited in
(14)- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A GRASP for a difficult single machine scheduling problem
- Simulated annealing for machine layout problems in the presence of zoning constraints
- Greedy randomized adaptive search procedures
- Metaheuristics: A bibliography
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
- scientific article; zbMATH DE number 6678450 (Why is no real title available?)
- A meta-raps for the early/tardy single machine scheduling problem
- Single machine scheduling to minimize the setup time and the earliness
- A GRASP based on DE to solve single machine scheduling problem with SDST
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
- A single machine scheduling problem with availability constraints and sequence-dependent setup costs
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
This page was built for publication: A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563872)