Proportionate flow shop: New complexity results and models with due date assignment (Q5249462): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1002/nav.21615 / 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.1002/nav.21615 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1941004152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Sequencing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>J</i> -maximal and <i>J</i> -minimal Flow-Shop Schedules / 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: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the influence of missing operations on scheduling problems / 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: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for a due date assignment problem with tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop and open shop scheduling with a critical machine and two operations per job / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common due window size and location determination in a single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling ordered open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on ''Flow shop and open shop scheduling with a critical machine and two operations per job'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focused Scheduling in Proportionate Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to optimal permutation schedules for certain flow shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Expected Makespan in Stochastic Flow Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two due date assignment problems in scheduling a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time in a proportionate flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop Sequencing Problem with Ordered Processing Time Matrices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NAV.21615 / rank
 
Normal rank

Latest revision as of 16:31, 30 December 2024

scientific article; zbMATH DE number 6433284
Language Label Description Also known as
English
Proportionate flow shop: New complexity results and models with due date assignment
scientific article; zbMATH DE number 6433284

    Statements

    Proportionate flow shop: New complexity results and models with due date assignment (English)
    0 references
    6 May 2015
    0 references
    flow shop
    0 references
    missing operations
    0 references
    due date determination
    0 references

    Identifiers