Multi-family scheduling in a two-machine reentrant flow shop with setups (Q2467261): 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.1016/j.ejor.2006.06.065 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000155750 / 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 heuristic algorithm for two-machine re-entrant shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / 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: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: V-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in re-entrant permutation flow-shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequency on two and three machines with setup, processing and removal times separated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two- and three-machine flow shop scheduling problems with equal sized transfer batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Makespan in a Class of Reentrant Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop group scheduling problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:34, 27 June 2024

scientific article
Language Label Description Also known as
English
Multi-family scheduling in a two-machine reentrant flow shop with setups
scientific article

    Statements

    Multi-family scheduling in a two-machine reentrant flow shop with setups (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    scheduling
    0 references
    setup time
    0 references
    reentrant production flows
    0 references
    NP-hard
    0 references
    branch-and-bound
    0 references

    Identifiers