A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2004.07.074 / 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.2004.07.074 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042261753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling tasks with sequence-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling to minimize mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job lateness in a two-machine flowshop with setup times separated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692527 / 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: Impact of sequence-dependent setup time on job shop scheduling performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a flowline manufacturing cell with sequence dependent family setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2004.07.074 / rank
 
Normal rank

Latest revision as of 07:43, 19 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
scientific article

    Statements

    A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (English)
    0 references
    0 references
    0 references
    4 November 2005
    0 references
    Scheduling
    0 references
    Distributed database
    0 references
    Flowshop
    0 references
    Total completion time
    0 references
    Dominance relation
    0 references
    Lower and upper bounds
    0 references
    Branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers