Variability of completion time differences in permutation flow shop scheduling

DOI10.1016/J.COR.2014.08.015zbMath1348.90284OpenAlexW2001749925MaRDI QIDQ337356

Chandrasekharan Rajendran, Rainer Leisten

Publication date: 10 November 2016

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

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

zbMATH Keywords

variabilityuniformityqueuingflow shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (3)

Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection

Cites Work

• Unnamed Item
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• Completion time variance minimization on a single machine is difficult
• Benchmarks for basic scheduling problems
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• On the algebra of queues
• Variance Minimization in Single Machine Sequencing Problems
• Scheduling
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem

This page was built for publication: Variability of completion time differences in permutation flow shop scheduling