A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apm.2013.02.003 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apm.2013.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979667184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The significance of reducing setup times/setup costs / 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: Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Johnson's Two-Machine Flow Shop with Random Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic scheduling with optimal customer service / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN EVOLUTIONARY ALGORITHM FOR PURE FUZZY FLOWSHOP SCHEDULING PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop minimum-length scheduling problem with random and bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schedule execution for two-machine flow-shop with interval processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted flow time of a set of jobs with interval processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time with uncertain data: a stability approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contribution to the stochastic flow shop scheduling problem. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APM.2013.02.003 / rank
 
Normal rank

Latest revision as of 09:12, 16 December 2024

scientific article
Language Label Description Also known as
English
A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
scientific article

    Statements

    A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (English)
    0 references
    0 references
    0 references
    9 October 2018
    0 references
    scheduling
    0 references
    flowshop
    0 references
    makespan
    0 references
    random and bounded processing times
    0 references
    setup times
    0 references

    Identifiers