Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection

DOI10.1016/j.ejor.2022.06.025OpenAlexW4283024855MaRDI QIDQ2098030

Christos P. Koulamas, Kyparisis, George J.

Publication date: 17 November 2022

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.06.025

zbMATH Keywords

schedulingflow shoprejectionproportionate``no-wait

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost

Cites Work

• Variability of completion time differences in permutation flow shop scheduling
• A lower bound for weighted completion time variance
• Mimimization of agreeably weighted variance in single machine systems
• Bounds for the position of the smallest job in completion time variance minimization
• Completion time variance minimization on a single machine is difficult
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• A survey of scheduling problems with no-wait in process
• The single machine weighted mean squared deviation problem
• New results on the completion time variance minimization
• Simple matching vs linear assignment in scheduling models with positional effects: a critical review
• A branch and price algorithm for single-machine completion time variance
• An almost exact solution to the min completion time variance in a single machine
• Review of the ordered and proportionate flow shop scheduling research
• Single- and multiple-processor models for minimizing completion time variance
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Minimizing Variation of Flow Time in Single Machine Systems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
• Minimizing Single-Machine Completion Time Variance
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Variance Minimization in Single Machine Sequencing Problems
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date