Hierarchical minimization of completion time variance and makespan in jobshops

DOI10.1016/J.COR.2004.09.019MaRDI QIDQ2496030zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 30 June 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.09.019

zbMATH Keywords

backward schedulingcompletion time variancejobshopmakespansimulated annealing heuristic approaches

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Completion time variance minimization in single machine and multi-machine systems
• Completion time variance minimisation on two identical parallel processors
• Multi-machine scheduling with variance minimization
• On the Minimization of the Makespan Subject to Flowtime Optimality
• On the Minimization of Completion Time Variance with a Bicriteria Extension

Cites work

• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• A bi-directional scheduling approach for job shops
• A branch and bound algorithm to minimize completion time variance on a single processor.
• A Computational Study of the Job-Shop Scheduling Problem
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• Bounds for the position of the smallest job in completion time variance minimization
• Completion time variance minimization on a single machine is difficult
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Deterministic job-shop scheduling: Past, present and future
• Equation of state calculations by fast computing machines
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• General local search methods
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• scientific article; zbMATH DE number 553762 (Why is no real title available?)
• Job Shop Scheduling by Simulated Annealing
• Minimising Waiting Time Variance in the Single Machine Problem
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Minimizing flow time variance in a single machine system using genetic algorithms
• Minimizing Single-Machine Completion Time Variance
• Minimizing the Flow-time Variance in Single-machine Systems
• Minimizing Variation of Flow Time in Single Machine Systems
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Simulated annealing: A tool for operational research
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Simultaneous minimization of total completion time and total deviation of job completion times
• Some efficient heuristic methods for the flow shop sequencing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(1)

• A branch and price algorithm for single-machine completion time variance

This page was built for publication: Hierarchical minimization of completion time variance and makespan in jobshops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496030)