Scheduling in flowshops to minimize total tardiness of jobs (Q4671257): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/00207540310001657595 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067949393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for total tardiness minimization in flowshop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search approach for the flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing CONWIP flow-shops: Analysis and heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified simulated annealing algorithms for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing problems with limited buffer storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling in flowshop with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank

Latest revision as of 09:30, 10 June 2024

scientific article; zbMATH DE number 2161364
Language Label Description Also known as
English
Scheduling in flowshops to minimize total tardiness of jobs
scientific article; zbMATH DE number 2161364

    Statements

    Scheduling in flowshops to minimize total tardiness of jobs (English)
    0 references
    0 references
    26 April 2005
    0 references

    Identifiers