The two-machine no-wait general and proportionate open shop makespan problem (Q296784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Shrikant S. Panwalkar / rank
Normal rank
 
Property / author
 
Property / author: Christos P. Koulamas / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6597516 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
open shop
Property / zbMATH Keywords: open shop / rank
 
Normal rank
Property / zbMATH Keywords
 
no wait
Property / zbMATH Keywords: no wait / rank
 
Normal rank
Property / author
 
Property / author: Shrikant S. Panwalkar / rank
 
Normal rank
Property / author
 
Property / author: Christos P. Koulamas / 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/j.ejor.2014.04.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090643029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-shop scheduling problems with dominated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4313087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with machine dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation flowshop scheduling problems with maximal and minimal time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation flow shops with exact time lags to minimise maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Execution Time Shop Problems / 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: Scheduling two-machine no-wait open shops to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling ordered open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of the ordered and proportionate flow shop scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Shops with No Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing problem with ordered processing time matrices: A general case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884350 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:10, 12 July 2024

scientific article
Language Label Description Also known as
English
The two-machine no-wait general and proportionate open shop makespan problem
scientific article

    Statements

    The two-machine no-wait general and proportionate open shop makespan problem (English)
    0 references
    23 June 2016
    0 references
    scheduling
    0 references
    open shop
    0 references
    no wait
    0 references

    Identifiers