A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2014.09.004 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6378647 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
proportionate flowshop
Property / zbMATH Keywords: proportionate flowshop / rank
 
Normal rank
Property / zbMATH Keywords
 
just-in-time
Property / zbMATH Keywords: just-in-time / 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.ipl.2014.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981229180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed / 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: The three-machine proportionate flow shop problem with unequal machine speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize the number of early and tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / 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: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The just-in-time scheduling problem in a flow-shop scheduling system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time in a proportionate flow shop / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2014.09.004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:41, 9 December 2024

scientific article
Language Label Description Also known as
English
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
scientific article

    Statements

    A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    scheduling
    0 references
    proportionate flowshop
    0 references
    just-in-time
    0 references

    Identifiers