Scheduling with forbidden sets

DOI10.1016/S0166-218X(96)00042-XzbMath0879.90118MaRDI QIDQ5961611

Markus W. Schäffter

Publication date: 25 February 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

sensitivityworst-case ratio\(m\)-machine problemforbidden setsminimizing the makespanpolynomial-time approximation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on combinatorial optimization in dynamic environments, Reoptimization of parameterized problems, Reoptimizing the 0-1 knapsack problem, Reoptimization of maximum weight induced hereditary subgraph problems, Robust reoptimization of Steiner trees, Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications, Steiner tree reoptimization in graphs with sharpened triangle inequality, Reoptimization of NP-Hard Problems, Unnamed Item, Reoptimization of the shortest common superstring problem, Probabilistic analysis for scheduling with conflicts, Reoptimization in machine scheduling, A note on the traveling salesman reoptimization problem under vertex insertion, Knowing All Optimal Solutions Does Not Help for TSP Reoptimization, Iterative Flattening Search on RCPSP/max Problems: Recent Developments, Fast reoptimization for the minimum spanning tree problem, Reoptimization of the Shortest Common Superstring Problem, Approximate and robust bounded job start scheduling for Royal Mail delivery offices, Finding Optimal Solutions With Neighborly Help., Reoptimization of minimum and maximum traveling salesman's tours, REOPTIMIZATION UNDER VERTEX INSERTION: MAX P_k-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH

Cites Work

• Some simplified NP-complete graph problems
• Rescheduling to minimize makespan on a changing number of identical processors
• Two-Processor Scheduling with Start-Times and Deadlines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item