Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.cor.2004.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043899562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous minimization of total completion time and total deviation of job completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Variation of Flow Time in Single Machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and Random Single Machine Sequencing with Variance Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Flow-time Variance in Single-machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing flow time variance in a single machine system using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Single-Machine Completion Time Variance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the position of the smallest job in completion time variance minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to minimize completion time variance on a single processor. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion time variance minimization on a single machine is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising Waiting Time Variance in the Single Machine Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A backward approach in list scheduling algorithms for multi-machine tardiness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bi-directional scheduling approach for job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: General local search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing: A tool for operational research / 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: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:48, 24 June 2024

scientific article
Language Label Description Also known as
English
Hierarchical minimization of completion time variance and makespan in jobshops
scientific article

    Statements

    Hierarchical minimization of completion time variance and makespan in jobshops (English)
    0 references
    0 references
    30 June 2006
    0 references
    0 references
    completion time variance
    0 references
    makespan
    0 references
    backward scheduling
    0 references
    jobshop
    0 references
    simulated annealing heuristic approaches
    0 references
    0 references
    0 references