Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / 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: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Local Search / 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: Mean Flow Time Minimization in Reentrant Job Shops with a Hub / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spatial rule adaptation procedure for reliable production control in a wafer fabrication system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of scheduling policies in re-entrant manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production sequencing problem with re-entrant work flows and sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified shifting bottleneck procedure for job-shop scheduling / 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: Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of shifting bottleneck procedures for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of decomposition procedures for job shop scheduling problems with bottleneck machines / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1099-1425(200005/06)3:3<155::aid-jos39>3.0.co;2-e / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021693920 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:20, 30 July 2024

scientific article
Language Label Description Also known as
English
Decomposition methods for reentrant flow shops with sequence-dependent setup times
scientific article

    Statements

    Decomposition methods for reentrant flow shops with sequence-dependent setup times (English)
    0 references
    0 references
    0 references
    5 August 2001
    0 references
    reentrant flow shops
    0 references
    decomposition
    0 references
    sequence-dependent setup times
    0 references
    computational analysis
    0 references
    scheduling
    0 references

    Identifiers