Sensitivity analysis for some scheduling problems

DOI10.1007/s11741-008-0104-3zbMath1164.90338OpenAlexW2022915024MaRDI QIDQ3538478

Zhenduo Jiang, Shijie Sun, Zhi-Gang Wu

Publication date: 24 November 2008

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-008-0104-3

zbMATH Keywords

schedulingsensitivity analysissingle machineflowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Sensitivity analysis of list scheduling heuristics
• Flowshop scheduling with dominant machines
• On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?
• Rescheduling to minimize makespan on a changing number of identical processors
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Sequencing with due-dates and early start times to minimize maximum tardiness
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Sensitivity analysis for scheduling problems
• Sensitivity analysis of scheduling algorithms