Minimizing total weighted flow time under uncertainty using dominance and a stability box

DOI10.1016/j.cor.2011.02.001zbMath1251.90190OpenAlexW1965108072MaRDI QIDQ1762112

Yuri N. Sotskov, Tsung-Chyan Lai

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.001

zbMATH Keywords

single-machine schedulingstability analysisinterval input datatotal weighted flow time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (18)

Optimality region for job permutation in single-machine scheduling with uncertain processing times ⋮ An integrated model for production planning and cell formation in cellular manufacturing systems ⋮ Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria ⋮ Single machine scheduling problem with interval processing times to minimize mean weighted completion time ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Measures of problem uncertainty for scheduling with interval processing times ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Stability polyhedra of optimal permutation of jobs servicing ⋮ Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times ⋮ Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems ⋮ An efficient bicriteria algorithm for stable robotic flow shop scheduling ⋮ Single machine scheduling problem with interval processing times and total completion time objective ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• On the robust single machine scheduling problem
• Scheduling for stability in single-machine production systems
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• Minimizing total weighted flow time of a set of jobs with interval processing times
• On the calculation of the stability radius of an optimal or an approximate schedule
• Robust discrete optimization and its applications
• Optimal makespan scheduling with given bounds of processing times
• Minmax regret solutions for minimax optimization problems with uncertainty
• A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
• Mean flow time minimization with given bounds of processing times
• Schedule execution for two-machine flow-shop with interval processing times
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• The complexity of machine scheduling for stability with a single disrupted job
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• The minmax regret permutation flow-shop problem with two jobs
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Sequencing with uncertain numerical data for makespan minimisation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Flowshop scheduling problem to minimize total completion time with random and bounded processing times
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

This page was built for publication: Minimizing total weighted flow time under uncertainty using dominance and a stability box