Pareto optimizations for rescheduling problems

MaRDI QIDQ3054639zbMATH OpenFDO

Authors Yundong Mu, Xiaoyan Xu

Publication date 5 November 2010

zbMATH Keywords

Pareto optimizationreschedulingsequence disruptiontime disruption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
• Rescheduling problems with bicriteria
• Rescheduling for machine disruption to minimize makespan and maximum lateness
• Rescheduling for New Orders
• Rescheduling for multiple new orders

Cited in

(5)

• Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
• Pareto-optimal controls in the multi-activity scheduling problem are generalized priority controls
• Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• Generating all efficient solutions of a rescheduling problem on unrelated parallel machines

This page was built for publication: Pareto optimizations for rescheduling problems

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