The representation of partially-concurrent open shop problems (Q2398435): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-015-1934-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135659804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all the acyclic orientations of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for an open shop problem with unit processing times and tree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set of solutions of the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the concurrent open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order scheduling in an environment with dedicated resources in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of weighted completion times in a concurrent open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contribution and new heuristics for open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent open shop scheduling to minimize the weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring instance difficulty for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shops with jobs overlap / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:10, 14 July 2024

scientific article
Language Label Description Also known as
English
The representation of partially-concurrent open shop problems
scientific article

    Statements

    The representation of partially-concurrent open shop problems (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2017
    0 references
    open shop scheduling
    0 references
    concurrent machines
    0 references
    technician timetabling
    0 references
    matrix representation
    0 references
    graph orientation
    0 references
    reducibility
    0 references

    Identifiers