Variability of completion time differences in permutation flow shop scheduling

DOI10.1016/J.COR.2014.08.015zbMATH Open1348.90284OpenAlexW2001749925MaRDI QIDQ337356FDOQ337356

Authors: Rainer Leisten, Chandrasekharan Rajendran 

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

Recommendations

• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Minimising variance of job completion times in a single machine
• Diversity of processing times in permutation flow shop scheduling problems
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• New results on the completion time variance minimization

zbMATH Keywords

variabilityuniformityflow shop schedulingqueuing

Mathematics Subject Classification ID

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

Cites Work

• Scheduling
• Scheduling algorithms
• Benchmarks for basic scheduling problems
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• Completion time variance minimization on a single machine is difficult
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• On the algebra of queues
• Variance Minimization in Single Machine Sequencing Problems
• 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

Cited In (5)

• Reduction of permutation flowshop problems to single machine problems using machine dominance relations
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
• Diversity of processing times in permutation flow shop scheduling problems
• 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

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

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