Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2288973395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The routing open-shop problem on a network: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and parameterized complexity of multicover by \(c\)-intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling and colorful independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation algorithms for the routing open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Eulerian Extension and Rural Postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parametric complexity of schedules to minimize tardy tasks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list chromatic index of a bipartite multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of the k-Arc Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Parameterizations of the Mixed Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of \(k\)-Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip Graphs: Recognition and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(log m)-approximation for the routing open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The open shop problem with routing at a two-node network and allowed preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new view on rural postman based on Eulerian extension and matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing open shop and flow shop scheduling problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:48, 12 July 2024

scientific article; zbMATH DE number 6605920
Language Label Description Also known as
English
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing
scientific article; zbMATH DE number 6605920

    Statements

    Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (English)
    0 references
    0 references
    0 references
    25 July 2016
    0 references
    NP-hard scheduling problem
    0 references
    fixed-parameter algorithm
    0 references
    edge list-coloring
    0 references
    sequence-dependent family or batch setup times
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references