Three-machine flow shop scheduling with overlapping waiting time constraints (Q1628045): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129626301, #quickstatements; #temporary_batch_1724713111024
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2018.06.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809430302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Sequencing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problems with minimal and maximal delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a two-machine re-entrant flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic approach for the two-machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints / 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: A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling research after five decades / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transient Analysis of Serial Production Lines With Perishable Products: Bernoulli Reliability Model / 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: Minimizing makespan in three-machine flow shops with deteriorating jobs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129626301 / rank
 
Normal rank

Latest revision as of 23:59, 26 August 2024

scientific article
Language Label Description Also known as
English
Three-machine flow shop scheduling with overlapping waiting time constraints
scientific article

    Statements

    Three-machine flow shop scheduling with overlapping waiting time constraints (English)
    0 references
    0 references
    3 December 2018
    0 references
    branch and bound
    0 references
    scheduling
    0 references
    three-machine flow shop
    0 references
    waiting time constraint
    0 references
    0 references

    Identifiers