A GRASP for a difficult single machine scheduling problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
- A probabilistic heuristic for a computationally difficult set covering problem
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
- Note—Operations Sequencing in Discrete Parts Manufacturing
- Semi-greedy heuristics: An empirical study
- Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
Cited in
(31)- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
- A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector
- Scheduling of outbound luggage handling at airports
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A meta-raps for the early/tardy single machine scheduling problem
- A model for warehouse order picking
- Metaheuristics: A bibliography
- scientific article; zbMATH DE number 5007490 (Why is no real title available?)
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- Real-time system with homogeneous servers and nonidentical channels in steady-state
- A sequential GRASP for the therapist routing and scheduling problem
- Real-time multiserver and multichannel systems with shortage of maintenance crews.
- Single machine scheduling with flow time and earliness penalties
- Improved modeling and solution methods for the multi-resource routing problem
- A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines
- Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities.
- A GRASP based on DE to solve single machine scheduling problem with SDST
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A robust approach for the single machine scheduling problem
- Randomized methods for the number partitioning problem
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
- A GRASP for parallel machine scheduling with time windows
- Computational aspects of the maximum diversity problem
- Scheduling activities at oil wells with resource displacement
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- Experimental and Efficient Algorithms
- Minimizing the sum of weighted completion times with unrestricted weights
- Greedy randomized adaptive search procedures
- A GRASP algorithm for flexible job-shop scheduling with maintenance constraints
This page was built for publication: A GRASP for a difficult single machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184452)
