A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage
From MaRDI portal
Publication:4973250
DOI10.1134/S1990478919020054zbMath1438.90106OpenAlexW2949545676WikidataQ127702732 ScholiaQ127702732MaRDI QIDQ4973250
P. A. Kononova, Yury A. Kochetov
Publication date: 2 December 2019
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478919020054
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bilevel planning model for public-private partnership
- The third comprehensive survey on scheduling problems with setup times/costs
- Bilevel competitive facility location and pricing problems
- The \(p\)-median problem: a survey of metaheuristic approaches
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Attraction probabilities in variable neighborhood search
- Variable neighborhood search variants for min-power symmetric connectivity problem
- VNS matheuristic for a bin packing problem with a color constraint
- Competitive location in cognitive radio networks
- Local search for load balancing problems for servers with large dimension
- Genetic local search and hardness of approximation for the server load balancing problem
- Using VNS for the optimal synthesis of the communication tree in wireless sensor networks
- Local search with an exponential neighborhood for the servers load balancing problem
- Production Planning by Mixed Integer Programming
- Combinatorial optimization. Theory and algorithms
This page was built for publication: A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage
