Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
type: Item
instance of: scholarly article
title: Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
published in: European Journal of Operational Research
publication date: 2022-11-17T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7619273
zbMATH Keywords: scheduling
zbMATH Keywords: ``no-wait''
zbMATH Keywords: flow shop
zbMATH Keywords: proportionate
zbMATH Keywords: rejection
author: C. Koulamas
author: George J. Kyparisis
MaRDI profile type: Publication
full work available at URL: j.ejor.2022.06.025
OpenAlex ID: W4283024855
cites work: A survey of scheduling problems with no-wait in process
cites work: Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
cites work: Mimimization of agreeably weighted variance in single machine systems
cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension
cites work: Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
cites work: Single- and multiple-processor models for minimizing completion time variance
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Minimizing Variation of Flow Time in Single Machine Systems
cites work: Completion time variance minimization on a single machine is difficult
cites work: New results on the completion time variance minimization
cites work: Variability of completion time differences in permutation flow shop scheduling
cites work: Pseudopolynomial algorithms for CTV minimization in single machine scheduling
cites work: Bounds for the position of the smallest job in completion time variance minimization
cites work: Variance Minimization in Single Machine Sequencing Problems
cites work: An almost exact solution to the min completion time variance in a single machine
cites work: A lower bound for weighted completion time variance
cites work: Review of the ordered and proportionate flow shop scheduling research
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: The single machine weighted mean squared deviation problem
cites work: Simple matching vs linear assignment in scheduling models with positional effects: a critical review
cites work: Deterministic and Random Single Machine Sequencing with Variance Minimization
cites work: Minimizing Single-Machine Completion Time Variance
cites work: A branch and price algorithm for single-machine completion time variance
cites work: An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
DOI: 10.1016/J.EJOR.2022.06.025
description: scientific article; zbMATH DE number 7619273