A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
From MaRDI portal
Publication:2563872
DOI10.1016/0305-0548(95)00084-4zbMath0859.90082OpenAlexW2011818161MaRDI QIDQ2563872
Thomas A. Feo, John McGahan, Kishore Sarathy
Publication date: 10 April 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(95)00084-4
single machine schedulinggreedy randomized adaptive search proceduresequence dependent setup costslinear delay penalties
Related Items
Metaheuristics: A bibliography, A hybrid heuristic approach to minimize number of tardy jobs in group technology systems, 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, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Simulated annealing for machine layout problems in the presence of zoning constraints, A Meta-RaPS for the early/tardy single machine scheduling problem, A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times, Greedy randomized adaptive search procedures, Single machine scheduling to minimize the setup time and the earliness
Uses Software
Cites Work
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A probabilistic heuristic for a computationally difficult set covering problem
- 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
- Branch-and-Bound Strategies for Dynamic Programming
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
