Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2016.05.006 / 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.cor.2016.05.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2354105049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean absolute deviation of completion times about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation flow shop scheduling with earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new set of high-performing heuristics to minimise flowtime in permutation flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Just-in-time scheduling. Models and algorithms for computer and manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distributed permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs / 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: Heuristics for the flow line problem with setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2016.05.006 / rank
 
Normal rank

Latest revision as of 14:55, 9 December 2024

scientific article
Language Label Description Also known as
English
Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
scientific article

    Statements

    Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    scheduling
    0 references
    flowshop
    0 references
    heuristics
    0 references
    PFSP
    0 references
    earliness
    0 references
    tardiness
    0 references
    0 references
    0 references

    Identifiers