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

From MaRDI portal
Revision as of 16:48, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:881562


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

Yundong Mu, Jinjiang Yuan

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


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, A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling, Single-machine rescheduling problems with learning effect under disruptions, Cost allocation in rescheduling with machine unavailable period, Rescheduling for new orders on a single machine with setup times, Rescheduling problems with allowing for the unexpected new jobs arrival, Single machine rescheduling for new orders with maximum lateness minimization, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems, Rescheduling due to machine disruption to minimize the total weighted completion time, Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption, Predictive-reactive strategy for identical parallel machine rescheduling, Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption, Replanning working time under annualised working hours



Cites Work