Sensitivity analysis in the single-machine scheduling problem with max-min criterion

DOI10.1111/J.1475-3995.2005.00505.XMaRDI QIDQ3025043zbMATH OpenOpenAlexFDO

Authors Stefan Chanas, Adam Kasperski

Publication date 4 July 2005

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2005.00505.x

zbMATH Keywords

schedulingsensitivity analysissingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Sensitivity analysis for some scheduling problems
• Sensitivity Analysis for Stochastic Scheduling Problems
• Sensitivity analysis for scheduling problems
• Sensitivity analysis for scheduling problems
• Minimization of the maximal lateness for a single machine

Cites work

• Advances in sensitivity analysis and parametric programming
• scientific article; zbMATH DE number 3634009 (Why is no real title available?)
• On the complexity of postoptimality analysis of 0/1 programs
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
• Sensitivity analysis of scheduling algorithms
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Some concepts of stability analysis in combinatorial optimization
• Stability of a schedule minimizing mean flow time

Cited in

(2)

• Sensitivity analysis for some scheduling problems
• scientific article; zbMATH DE number 1150206 (Why is no real title available?)

This page was built for publication: Sensitivity analysis in the single-machine scheduling problem with max-min criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3025043)