Minimizing total weighted flow time under uncertainty using dominance and a stability box
type: Item
instance of: scholarly article
title: Minimizing total weighted flow time under uncertainty using dominance and a stability box
zbMATH Open document ID: 1251.90190
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6107558
zbMATH Keywords: single-machine scheduling
zbMATH Keywords: total weighted flow time
zbMATH Keywords: interval input data
zbMATH Keywords: stability analysis
author: Yuri N. Sotskov
author: Tsung-Chyan Lai
MaRDI profile type: Publication
full work available at URL: j.cor.2011.02.001
OpenAlex ID: W1965108072
cites work: Q3525911
cites work: Minmax regret solutions for minimax optimization problems with uncertainty
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: Robust discrete optimization and its applications
cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion
cites work: A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
cites work: On the robust single machine scheduling problem
cites work: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
cites work: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
cites work: Optimal makespan scheduling with given bounds of processing times
cites work: Sequencing with uncertain numerical data for makespan minimisation
cites work: Schedule execution for two-machine flow-shop with interval processing times
cites work: Minimizing total weighted flow time of a set of jobs with interval processing times
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: The complexity of machine scheduling for stability with a single disrupted job
cites work: Scheduling for stability in single-machine production systems
cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
cites work: The minmax regret permutation flow-shop problem with two jobs
cites work: Mean flow time minimization with given bounds of processing times
cites work: Flowshop scheduling problem to minimize total completion time with random and bounded processing times
cites work: Q4131987
cites work: On the calculation of the stability radius of an optimal or an approximate schedule
DOI: 10.1016/J.COR.2011.02.001
description: scientific article; zbMATH DE number 6107558