Robust scheduling on a single machine to minimize total flow time
type: Item
instance of: scholarly article
title: Robust scheduling on a single machine to minimize total flow time
zbMATH Open document ID: 1251.90167
author: Chung-Cheng Lu
author: Shih-Wei Lin
author: Kuo-Ching Ying
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6107598
zbMATH Keywords: robust scheduling
zbMATH Keywords: single machine scheduling
zbMATH Keywords: sequence-dependent family setup times
zbMATH Keywords: total flow time
MaRDI profile type: Publication
full work available at URL: j.cor.2011.10.003
OpenAlex ID: W2008541173
cites work: A survey of scheduling problems with setup times or costs
cites work: Single facility multi-class job scheduling
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Scheduling a flowline manufacturing cell with sequence dependent family setup times
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Single facility scheduling with multiple job classes
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Q4713573
cites work: Batch scheduling to minimize total completion time
cites work: Minimizing sum of completion times on a single machine with sequence-dependent family setup times
cites work: A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
cites work: Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
cites work: Stochastic scheduling to minimize expected maximum lateness
cites work: Minimizing the number of tardy jobs with stochastically-ordered processing times
cites work: Minimizing the number of late jobs in a stochastic setting using a chance constraint
cites work: Robust Optimization of Large-Scale Systems
cites work: Robust discrete optimization and its applications
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: On the robust single machine scheduling problem
cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Resource-Constrained Assignment Scheduling
cites work: A simulated annealing and hill-climbing algorithm for the traveling tournament problem
cites work: Simulated annealing heuristics for the dynamic facility layout problem
cites work: Designing optimal aviation baggage screening strategies using simulated annealing
cites work: A survey of simulated annealing as a tool for single and multiobjective optimization
cites work: Q4198056
cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
cites work: Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
cites work: An algorithm for the resource constrained shortest path problem
cites work: Lagrangian relaxation and enumeration for solving constrained shortest-path problems
cites work: Near-shortest and K-shortest simple paths
cites work: Q3888874
cites work: The shortest path problem with two objective functions
DOI: 10.1016/J.COR.2011.10.003
description: scientific article; zbMATH DE number 6107598