Rescheduling to minimize the maximum weighted completion time

zbMATH Open1399.90118MaRDI QIDQ3175716FDOQ3175716

Authors Xijie Zang, Xifeng Wang, Shisheng Li 

Publication date 18 July 2018

zbMATH Keywords

disruptionNP-hardnessreschedulingmaximum weighted completion time

Mathematics Subject Classification ID

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

Recommendations

• Rescheduling due to machine disruption to minimize the total weighted completion time
• Rescheduling to minimize total weighted completion time under anticompatible job systems
• Rescheduling problems with allowing for the unexpected new jobs arrival
• Rescheduling for New Orders
• Rescheduling for multiple new orders

Cited in

(11)

• Scheduling start time dependent jobs to minimize the total weighted completion time
• Extension of Rescheduling Based on Minimal Graph Cut
• Rescheduling to minimize total weighted completion time under anticompatible job systems
• Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
• Rescheduling problems with bicriteria
• Rescheduling for job unavailability
• Rescheduling with release time to minimize sum of waiting time considering waiting constraint of original loads
• Scheduling to minimize the total compression and late costs
• Rescheduling due to machine disruption to minimize the total weighted completion time
• Rescheduling for New Orders
• A bi-objective approach to reschedule new jobs in a one machine model

This page was built for publication: Rescheduling to minimize the maximum weighted completion time

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