The generalized shifting bottleneck procedure (Q1268190): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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.1016/0377-2217(95)00135-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059887572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Openshop and flowshop scheduling to minimize sum of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Open-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Open Shop Preemptive Schedules / 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: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note On The Complexity Of Openshop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum Lateness in a Two-Machine Open Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank

Latest revision as of 16:49, 28 May 2024

scientific article
Language Label Description Also known as
English
The generalized shifting bottleneck procedure
scientific article

    Statements

    The generalized shifting bottleneck procedure (English)
    0 references
    0 references
    0 references
    23 June 1999
    0 references
    0 references
    makespan
    0 references
    heuristic
    0 references
    shifting bottleneck procedure
    0 references
    jobshop scheduling
    0 references
    partial precedence constraints
    0 references
    assembly shops
    0 references
    0 references
    0 references
    0 references