Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption

DOI10.1016/j.ejor.2006.07.026zbMath1121.90067MaRDI QIDQ881562

Jinjiang Yuan, Yundong Mu

Publication date: 30 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.026

zbMATH Keywords

single machine; makespan; NP-hard; release dates; disruption; rescheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs, Rescheduling on identical parallel machines with machine disruptions to minimize total completion time, Rescheduling with new orders and general maximum allowable time disruptions, Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption, Rescheduling for machine disruption to minimize makespan and maximum lateness, Rescheduling problems with deteriorating jobs under disruptions, Rescheduling for new orders on a single machine with setup times, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems, Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption, Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption, Replanning working time under annualised working hours

Cites Work

• Rescheduling on a single machine with part-type dependent setup times and deadlines
• Approximability of scheduling with fixed jobs
• Rescheduling for New Orders
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item
• Unnamed Item