Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

DOI10.1016/S0377-2217(00)00170-3zbMath1024.90038OpenAlexW2028173720WikidataQ127646643 ScholiaQ127646643MaRDI QIDQ5939594

No author found.

Publication date: 1 December 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00170-3

zbMATH Keywords

heuristic\(m\)-machine flow shop schedulingbranch and bound algorithmsMSD problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Variability of completion time differences in permutation flow shop scheduling ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ Optimal Parallel Machine Allocation Problem in IC Packaging Using IC-PSO: An Empirical Study ⋮ A branch and price algorithm for single-machine completion time variance ⋮ An efficient local search for minimizing completion time variance in permutation flow shops ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection ⋮ Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests

Cites Work

• Unnamed Item
• Scheduling about a common due date with earliness and tardiness penalties
• Scheduling problems with non-regular penalty functions - a review
• Minimizing late jobs in the general one machine scheduling problem
• Minimizing flow time variance in a single machine system using genetic algorithms
• Completion time variance minimization on a single machine is difficult
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• A branch and bound procedure to minimize mean absolute lateness on a single processor
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Minimizing Variation of Flow Time in Single Machine Systems
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• Minimising Waiting Time Variance in the Single Machine Problem
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Variance Minimization in Single Machine Sequencing Problems