Scheduling with forbidden sets
From MaRDI portal
Recommendations
Cites work
- Bounds for Certain Multiprocessing Anomalies
- scientific article; zbMATH DE number 4135692 (Why is no real title available?)
- scientific article; zbMATH DE number 45843 (Why is no real title available?)
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Rescheduling to minimize makespan on a changing number of identical processors
- Some simplified NP-complete graph problems
- Two-Processor Scheduling with Start-Times and Deadlines
Cited in
(30)- Single machine scheduling with forbidden start times
- Reoptimization of minimum and maximum traveling salesman's tours
- On the generation of circuits and minimal forbidden sets
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices
- Reoptimization of parameterized problems
- Robust reoptimization of Steiner trees
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- Reoptimization in machine scheduling
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
- A survey on combinatorial optimization in dynamic environments
- Knowing all optimal solutions does not help for TSP reoptimization
- Off-line scheduling with forbidden zones
- Reoptimization of the Shortest Common Superstring Problem
- Reoptimization of maximum weight induced hereditary subgraph problems
- Steiner tree reoptimization in graphs with sharpened triangle inequality
- scientific article; zbMATH DE number 1061006 (Why is no real title available?)
- A note on the traveling salesman reoptimization problem under vertex insertion
- New algorithms for Steiner tree reoptimization
- Finding Optimal Solutions With Neighborly Help.
- Iterative Flattening Search on RCPSP/max Problems: Recent Developments
- Reoptimizing the 0-1 knapsack problem
- Reoptimization of NP-Hard Problems
- Reoptimization of the shortest common superstring problem
- Finding optimal solutions with neighborly help
- New algorithms for Steiner tree reoptimization
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Repairing schedules by removing waiting times: a parameterized complexity analysis
- Probabilistic analysis for scheduling with conflicts
- Fast reoptimization for the minimum spanning tree problem
This page was built for publication: Scheduling with forbidden sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961611)
